Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs
Foundations of deductive databases and logic programming
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On solution correspondences in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Circumscriptive event calculus as answer set programming
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On stratified autoepistemic theories
AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Stable models and circumscription
Artificial Intelligence
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
| Hi-index | 0.00 |
The class of logic programs covered by the original definition of a stable model has the property that all stable models of a program in this class are minimal. In the course of research on answer set programming, the concept of a stable model was extended to several new programming constructs, and for some of these extensions the minimality property does not hold. We are interested in syntactic conditions on a logic program that guarantee the minimality of its stable models. This question is addressed here in the context of the general theory of stable models of first-order sentences.