260 search results - page 34 / 52 » Nonmonotonic Reasoning in FLORA-2 |
AAAI
2000
13 years 11 months ago
2000
We analyze the complexity of propositional kernel resolution (del Val 1999), a general method for obtaining logical consequences in restricted target languages. Different choices ...
IJCAI
1993
13 years 11 months ago
1993
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...
COLING
1992
13 years 11 months ago
1992
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...
JAIR
2008
13 years 9 months ago
2008
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...
ECSQARU
2005
Springer
14 years 3 months ago
2005
Springer
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...