Foundations of logic programming
Principles of knowledge representation
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Two-Literal Logic Programs and Satisfiability Representation of Stable Models: A Comparison
AI '02 Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
Graphs and colorings for answer set programming
Theory and Practice of Logic Programming
Why are there so many loop formulas?
ACM Transactions on Computational Logic (TOCL)
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Interval-type and affine arithmetic-type techniques for handling uncertainty in expert systems
Journal of Computational and Applied Mathematics - Special issue: Scientific computing, computer arithmetic, and validated numerics (SCAN 2004)
Extended asp tableaux and rule redundancy in normal logic programs1
Theory and Practice of Logic Programming
Stable models and difference logic
Annals of Mathematics and Artificial Intelligence
Modular Equivalence in General
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Computing Stable Models via Reductions to Difference Logic
LPNMR '09 Proceedings of the 10th 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
Compact translations of non-disjunctive answer set programs to propositional clauses
Logic programming, knowledge representation, and nonmonotonic reasoning
Reducing inductive definitions to propositional satisfiability
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Ordered completion for first-order logic programs on finite structures
Artificial Intelligence
On elementary loops of logic programs
Theory and Practice of Logic Programming
Backdoors to tractable answer-set programming
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
International Journal of Approximate Reasoning
Hi-index | 0.00 |
Fages showed that if a program is tight, then every propositional model of its completion is also its stable model. Recently, Babovich, Erdem, and Lifschitz generalized Fages' result, and showed that this is also true if the program is tight on the given model of the completion. As it turned out, this is quite a general result. Among the commonly known benchmark domains, only Niemelii's normal logic program encoding of the Hamiltonian Circuit (HC) problem does not have this property. In this paper, we propose a new normal logic program for solving the HC problem, and show that the program is tight on every model of its completion. Experimental results showed that for many graphs, this new encoding improves the performance of both SMODELS and ASSAT(Chaff2), especially of the latter system which is based on the SAT solver Chaff2. We also propose a notion of inherently tight logic programs and show that for any program, it is inherently tight iff all its completion models are stable models. We then propose a polynomial transformation from a logic programs to one that is inherently tight, thus providing a reduction of stable model semantics to program completion semantics and SAT.