Answer set programming based on propositional satisfiability

DOI10.1007/s10817-006-9033-2zbMath1107.68029OpenAlexW2100699693MaRDI QIDQ861709

Yuliya Lierler, Marco Maratea, Enrico Giunchiglia

Publication date: 30 January 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-006-9033-2

zbMATH Keywords

ASPSAT

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Backdoors to Normality for Disjunctive Logic Programs, Implementing Prioritized Merging with ASP, On abstract modular inference systems and solvers, Progress in clasp Series 3, The Design of the Sixth Answer Set Programming Competition, Shared aggregate sets in answer set programming, Improving the Normalization of Weight Rules in Answer Set Programs, Model enumeration in propositional circumscription via unsatisfiable core analysis, Rewriting recursive aggregates in answer set programming: back to monotonicity, Anytime answer set optimization via unsatisfiable core shrinking, ASPeRiX, a first-order forward chaining approach for answer set computing, Constraint answer set solver EZCSP and why integration schemas matter, Design and results of the Fifth Answer Set Programming Competition, What is answer set programming to propositional satisfiability, Unnamed Item, Loop formulas for circumscription, Bridging the Gap between Reinforcement Learning and Knowledge Representation: A Logical Off- and On-Policy Framework, Conflict-driven ASP solving with external sources, Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs, On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers, Conflict-driven answer set solving: from theory to practice, Testing and debugging techniques for answer set solver development, Finding Reductions Automatically, Automata and Answer Set Programming, Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets, Design and results of the second international competition on computational models of argumentation, Optimizing Answer Set Computation via Heuristic-Based Decomposition, Omission-Based Abstraction for Answer Set Programs, Fixed point semantics for stream reasoning, An abstract view on optimizations in SAT and ASP, Probabilistic Reasoning by SAT Solvers, An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems, On the relation among answer set solvers, Integrating answer set programming and constraint logic programming, Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search, Detecting Inconsistencies in Large Biological Networks with Answer Set Programming, On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP, Abstract Answer Set Solvers, Backdoors to tractable answer set programming, Iterative and core-guided maxsat solving: a survey and assessment

Uses Software

• GNT
• MiniSat
• ASSAT
• Cmodels
• Chaff
• BerkMin

Cites Work

• ASSAT: computing answer sets of a logic program by SAT solvers
• The SAT-based approach to separation logic
• A structure-preserving clause form translation
• Extending and implementing the stable model semantics
• SAT-based decision procedures for classical modal logics
• Propositional semantics for disjunctive logic programs
• Logic programs with stable model semantics as a constraint programming paradigm
• Nested expressions in logic programs
• BerkMin: A fast and robust SAT-solver
• Making prolog more expressive
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• GRASP: a search algorithm for propositional satisfiability
• Weight constraints as nested expressions
• Bounded LTL model checking with stable models
• Logic Programming
• Logic Programming
• The DLV system for knowledge representation and reasoning
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming
• A machine program for theorem-proving
• Computer Aided Verification
• Mechanizing Mathematical Reasoning
• CONCUR 2003 - Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item