Sciweavers

1426 search results - page 52 / 286
» Specification of nonmonotonic reasoning
Sort
View
AAAI
2000
14 years 11 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
IJCAI
1993
14 years 11 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
COLING
1992
14 years 11 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»
14 years 9 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
APAL
2008
84views more  APAL 2008»
14 years 10 months ago
Resolution over linear equations and multilinear proofs
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
Ran Raz, Iddo Tzameret