Sciweavers

258 search results - page 38 / 52
» Nonmonotonic Reasoning
Sort
View
AAAI
2000
13 years 8 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
JAIR
2008
145views more  JAIR 2008»
13 years 7 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
AAAI
1996
13 years 8 months ago
Formalizing Narratives Using Nested Circumscription
The representation of narratives of actions and observations is a current issue in Knowledge Representation, where traditional plan-oriented treatments of action seem to fall shor...
Chitta Baral, Alfredo Gabaldon, Alessandro Provett...
ILP
2000
Springer
13 years 11 months ago
Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solu...
Floriana Esposito, Donato Malerba, Francesca A. Li...
KR
1998
Springer
13 years 11 months ago
Combining Narratives
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conju...
John McCarthy, Tom Costello