Sciweavers

1917 search results - page 46 / 384
» Experimenting with Nonmonotonic Reasoning
Sort
View
105
Voted
AAAI
2000
15 years 2 months ago
Computing Circumscriptive Databases by Integer Programming: Revisited
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
Ken Satoh, Hidenori Okamoto
97
Voted
AAAI
2000
15 years 2 months ago
The Complexity of Restricted Consequence Finding and Abduction
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
Alvaro del Val
82
Voted
IJCAI
1993
15 years 2 months ago
Notes on Formalizing Context
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c, p). It asserts that the proposition p is true in the context c. The most important f...
John McCarthy
64
Voted
COLING
1992
15 years 1 months ago
A Lexicalist Account of Icelandic Case Marking
Recent theoretical descriptions of the Icelandic case system distinguish between lexicai and structural case. Lexical case is assigned in ttle lexiCOIl, whereas structural case is...
Gosse Bouma
JAIR
2008
145views more  JAIR 2008»
15 years 21 days 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