1022 search results - page 2 / 205 » Stable models and circumscription |
AAAI
2000
13 years 6 months ago
2000
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...
LPAR
2000
Springer
13 years 8 months ago
2000
Springer
In this paper, we determine the complexity of propositional theory curbing. Theory Curbing is a nonmonotonic technique of common sense reasoning that is based on model minimality b...
IJAR
2010
13 years 3 months ago
2010
The logical and algorithmic properties of stable conditional independence (CI) as an alternative structural representation of conditional independence information are investigated...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...