Answer Set Programming Based on Propositional Satisfiability
- 29 September 2006
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 36 (4) , 345-377
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- Weight constraints as nested expressionsTheory and Practice of Logic Programming, 2005
- Loops: Relevant or Redundant?Lecture Notes in Computer Science, 2005
- Generalizing Boolean Satisfiability II: TheoryJournal of Artificial Intelligence Research, 2004
- Lazy Theorem Proving for Bounded Model Checking over Infinite Domains2002
- Fages’ Theorem for Programs with Nested Expressions2001
- Propositional semantics for disjunctive logic programsAnnals of Mathematics and Artificial Intelligence, 1994
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Negation as Failure1978
- A machine program for theorem-provingCommunications of the ACM, 1962