Propositional satisfiability in answer-set programming
From MaRDI portal
Recommendations
- Answer set programming based on propositional satisfiability
- ASSAT: computing answer sets of a logic program by SAT solvers
- Compact translations of non-disjunctive answer set programs to propositional clauses
- What is answer set programming to propositional satisfiability
- scientific article; zbMATH DE number 6747915
Cited in
(22)- Answer set programming in intuitionistic logic
- What is answer set programming to propositional satisfiability
- Constrained pseudo-propositional logic
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- Extending the Smodels system with cardinality and weight constraints
- Compact translations of non-disjunctive answer set programs to propositional clauses
- scientific article; zbMATH DE number 5910656 (Why is no real title available?)
- From (Quantified) Boolean Formulae to Answer Set Programming
- scientific article; zbMATH DE number 6536279 (Why is no real title available?)
- A Pearl on SAT Solving in Prolog
- First-order Answer Set Programming as Constructive Proof Search
- Applications of intuitionistic logic in Answer Set Programming
- The aspps system
- assps -- an implementation of answer-set programming with propositional schemata
- Propositional calculus problems in CHIP
- Semantical characterizations and complexity of equivalences in answer set programming
- scientific article; zbMATH DE number 6747915 (Why is no real title available?)
- Logic Programming and Nonmonotonic Reasoning
- Answer Set Programming without Unstratified Negation
- RegSTAB: A SAT Solver for Propositional Schemata
- Answer set programming based on propositional satisfiability
- Approximate postdictive reasoning with answer set programming
This page was built for publication: Propositional satisfiability in answer-set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4797424)