JAIR 2008 - PDF Preprint Papers

JAIR 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed JAIR-2008 Paper

click to vote

JAIR
2008

173views more JAIR 2008»

Creating Relational Data from Unstructured and Ungrammatical Data Sources

14 years 13 days ago

Download www.jair.org

In order for agents to act on behalf of users, they will have to retrieve and integrate vast amounts of textual data on the World Wide Web. However, much of the useful data on the...

Matthew Michelson, Craig A. Knoblock

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	173	Creating Relational Data from Unstructured and Ungrammatical Data Sources	claim
2	173	Computational Logic Foundations of KGP Agents	claim
3	171	AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models	claim
4	164	Gesture Salience as a Hidden Variable for Coreference Resolution and Keyframe Extraction	claim
5	157	Learning to Reach Agreement in a Continuous Ultimatum Game	claim
6	157	Qualitative System Identification from Imperfect Data	claim
7	148	Learning Partially Observable Deterministic Action Models	claim
8	145	Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity	claim
9	145	Communication-Based Decomposition Mechanisms for Decentralized MDPs	claim
10	138	Networks of Influence Diagrams: A Formalism for Representing Agents' Beliefs and Decision-Making Processes	claim
11	136	Global Inference for Sentence Compression: An Integer Linear Programming Approach	claim
12	135	On Similarities between Inference in Game Theory and Machine Learning	claim
13	130	Axiomatic Foundations for Ranking Systems	claim
14	130	Online Planning Algorithms for POMDPs	claim
15	126	Extended RDF as a Semantic Foundation of Rule Markup Languages	claim
16	126	Optimal and Approximate Q-value Functions for Decentralized POMDPs	claim
17	126	Cooperative Search with Concurrent Interactions	claim
18	123	The Computational Complexity of Dominance and Consistency in CP-Nets	claim
19	123	CTL Model Update for System Modifications	claim
20	121	A Constraint Programming Approach for Solving a Queueing Control Problem	claim
21	120	Anytime Induction of Low-cost, Low-error Classifiers: a Sampling-based Approach	claim
22	120	MiniMaxSAT: An Efficient Weighted Max-SAT solver	claim
23	119	A Multiagent Reinforcement Learning Algorithm with Non-linear Dynamics	claim
24	118	On the Use of Automatically Acquired Examples for All-Nouns Word Sense Disambiguation	claim
25	117	Complexity of Strategic Behavior in Multi-Winner Elections	claim
26	113	Graphical Model Inference in Optimal Control of Stochastic Multi-Agent Systems	claim
27	111	New Islands of Tractability of Cost-Optimal Planning	claim
28	110	Completeness and Performance Of The APO Algorithm	claim
29	109	Modular Reuse of Ontologies: Theory and Practice	claim
30	108	A Multiagent Approach to Autonomous Intersection Management	claim
31	107	Exploiting Subgraph Structure in Multi-Robot Path Planning	claim
32	107	Planning with Durative Actions in Stochastic Domains	claim
33	104	Sound and Complete Inference Rules for SE-Consequence	claim
34	104	On the Qualitative Comparison of Decisions Having Positive and Negative Features	claim
35	104	M-DPOP: Faithful Distributed Implementation of Efficient Social Choice Problems	claim
36	103	ICE: An Expressive Iterative Combinatorial Exchange	claim
37	103	SATzilla: Portfolio-based Algorithm Selection for SAT	claim
38	102	An Ordinal Bargaining Solution with Fixed-Point Property	claim
39	99	The Complexity of Planning Problems With Simple Causal Graphs	claim
40	98	Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective	claim
41	98	Refining the Execution of Abstract Actions with Learned Action Models	claim
42	97	Adaptive Stochastic Resource Control: A Machine Learning Approach	claim
43	96	On the Value of Correlation	claim
44	94	The Ultrametric Constraint and its Application to Phylogenetics	claim
45	93	A Rigorously Bayesian Beam Model and an Adaptive Full Scan Model for Range Finders in Dynamic Environments	claim
46	93	Spectrum of Variable-Random Trees	claim
47	93	Dynamic Control in Real-Time Heuristic Search	claim
48	92	On the Expressiveness of Levesque's Normal Form	claim
49	82	A General Theory of Additive State Space Abstractions	claim
50	78	Analogical Dissimilarity: Definition, Algorithms and Two Experiments in Machine Learning	claim
51	63	A Unifying Framework for Structural Properties of CSPs: Definitions, Complexity, Tractability	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers