1022 search results - page 6 / 205 » Stable models and circumscription |
IJCAI
1997
14 years 10 months ago
1997
Explicit preferences on assumptions as used in prioritized circumscription [McCarthy, 1986; Lifschitz, 1985; Grosof, 1991] and preferred subtheories [Brewka, 1989] provide a clear...
IJCAI
1989
14 years 10 months ago
1989
One of the problems of the recent approaches to problem solving based on deep knowledge is the lack of a formal treatment of incomplete knowledge. However, dealing with incomplete...
TABLEAUX
1999
Springer
15 years 1 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
ACMSE
2010
ACM
14 years 7 months ago
2010
ACM
Although it takes O(n2 ) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identic...
KR
2000
Springer
15 years 29 days ago
2000
Springer
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...