Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
On the declarative and procedual semantics of logic programs
Journal of Automated Reasoning
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Theory and Practice of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Why are there so many loop formulas?
ACM Transactions on Computational Logic (TOCL)
SAT-based answer set programming
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Loop formulas for circumscription
Artificial Intelligence
Twelve Definitions of a Stable Model
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Elementary sets for logic programs
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A meta-programming technique for debugging answer-set programs
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
Declarative and computational properties of logic programs with aggregates
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Loop formulas for circumscription
Artificial Intelligence
Conflict-driven answer set enumeration
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Head-elementary-set-free logic programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
A translational approach to constraint answer set solving
Theory and Practice of Logic Programming
Catching the ouroboros: On debugging non-ground answer-set programs
Theory and Practice of Logic Programming
On Testing Answer-Set Programs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
On the problem of computing ambiguity propagation and well-founded semantics in defeasible logic
RuleML'10 Proceedings of the 2010 international conference on Semantic web rules
Symmetry-breaking answer set solving
AI Communications - Answer Set Programming
Abstract answer set solvers with backjumping and learning
Theory and Practice of Logic Programming
Thirteen definitions of a stable model
Fields of logic and computation
Weight constraint programs with evaluable functions
Annals of Mathematics and Artificial Intelligence
Unfounded sets for disjunctive logic programs with arbitrary aggregates
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
On modular translations and strong equivalence
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Tableau calculi for answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
On elementary loops of logic programs
Theory and Practice of Logic Programming
First-order stable model semantics and first-order loop formulas
Journal of Artificial Intelligence Research
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
Tableau Calculi for Logic Programs under Answer Set Semantics
ACM Transactions on Computational Logic (TOCL)
Relating constraint answer set programming languages and algorithms
Artificial Intelligence
| Hi-index | 0.00 |
In an important recent paper, Lin and Zhao introduced the concept of a loop formula, and showed that the answer sets for a logic program are exactly the models of Clark's completion of the program that satisfy the loop formulas. Just as supported sets are a model-theoretic account of completion, "externally supported" sets, defined in this paper, are a model-theoretic counterpart of loop formulas. This reformulation of loop formulas shows that they are related to assumption sets (Saccá and Zaniolo) and to unfounded sets (Van Gelder, Ross and Schlipf; Leone, Rullo and Scarcello), invented many years earlier. Other contributions of this paper includes a simplification of the definition of a loop, extending it to programs with classical negation and infinite programs, and a generalization of the definition of a loop formula.