Sciweavers

JAIR
2008
92views more  JAIR 2008»
13 years 11 months ago
On the Expressiveness of Levesque's Normal Form
Levesque proposed a generalization of a database called a proper knowledge base (KB), which is equivalent to a possibly infinite consistent set of ground literals. In contrast to ...
Yongmei Liu, Gerhard Lakemeyer
JAIR
2008
173views more  JAIR 2008»
13 years 11 months ago
Creating Relational Data from Unstructured and Ungrammatical Data Sources
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
JAIR
2008
123views more  JAIR 2008»
13 years 11 months ago
CTL Model Update for System Modifications
Model checking is a promising technology, which has been applied for verification of many hardware and software systems. In this paper, we introduce the concept of model update to...
Yan Zhang, Yulin Ding
JAIR
2008
108views more  JAIR 2008»
13 years 11 months ago
A Multiagent Approach to Autonomous Intersection Management
Artificial intelligence research is ushering in a new era of sophisticated, mass-market transportation technology. While computers can already fly a passenger jet better than a tr...
Kurt M. Dresner, Peter Stone
JAIR
2008
104views more  JAIR 2008»
13 years 11 months ago
Sound and Complete Inference Rules for SE-Consequence
The notion of strong equivalence on logic programs with answer set semantics gives rise to a consequence relation on logic program rules, called SE-consequence. We present a sound...
Ka-Shu Wong
JAIR
2008
136views more  JAIR 2008»
13 years 11 months ago
Global Inference for Sentence Compression: An Integer Linear Programming Approach
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
James Clarke, Mirella Lapata
JAIR
2008
103views more  JAIR 2008»
13 years 11 months ago
ICE: An Expressive Iterative Combinatorial Exchange
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language (TBBL) that is co...
Benjamin Lubin, Adam I. Juda, Ruggiero Cavallo, S&...
JAIR
2008
145views more  JAIR 2008»
13 years 11 months ago
Efficiency and Envy-freeness in Fair Division of Indivisible Goods: Logical Representation and Complexity
We consider the problem of allocating fairly a set of indivisible goods among agents from the point of view of compact representation and computational complexity. We start by ass...
Sylvain Bouveret, Jérôme Lang
JAIR
2008
123views more  JAIR 2008»
13 years 11 months ago
The Computational Complexity of Dominance and Consistency in CP-Nets
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
Judy Goldsmith, Jérôme Lang, Miroslaw...
JAIR
2008
102views more  JAIR 2008»
13 years 11 months ago
An Ordinal Bargaining Solution with Fixed-Point Property
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
Dongmo Zhang, Yan Zhang