Answer set programming based on propositional satisfiability

DOI10.1007/S10817-006-9033-2zbMATH Open1107.68029OpenAlexW2100699693MaRDI QIDQ861709FDOQ861709

Authors: Enrico Giunchiglia, Yuliya Lierler, Marco Maratea 

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

Recommendations

• Logic Programming
• scientific article; zbMATH DE number 6747915
• scientific article; zbMATH DE number 1882048
• ASSAT: computing answer sets of a logic program by SAT solvers
• AI*IA 2005: Advances in Artificial Intelligence

zbMATH Keywords

ASPSAT

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

• Theory and Applications of Satisfiability Testing
• Logic Programming and Nonmonotonic Reasoning
• BerkMin: A fast and robust SAT-solver
• ASSAT: computing answer sets of a logic program by SAT solvers
• A structure-preserving clause form translation
• Extending and implementing the stable model semantics
• Propositional semantics for disjunctive logic programs
• Nested expressions in logic programs
• Title not available (Why is that?)
• Weight constraints as nested expressions
• Title not available (Why is that?)
• Title not available (Why is that?)
• The DLV system for knowledge representation and reasoning
• Making prolog more expressive
• Logic programs with stable model semantics as a constraint programming paradigm
• GRASP: a search algorithm for propositional satisfiability
• A machine program for theorem-proving
• Theory and Applications of Satisfiability Testing
• Computer Aided Verification
• Title not available (Why is that?)
• Linear-time algorithms for testing the satisfiability of propositional horn formulae
• Synthesis of distributed algorithms using asynchronous automata.
• Bounded LTL model checking with stable models
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• SAT2000. Highlights of satisfiability research in the year 2000. 3rd international workshop, September 1998
• Mechanizing Mathematical Reasoning
• SAT-based decision procedures for classical modal logics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming
• Title not available (Why is that?)
• The SAT-based approach to separation logic

Cited In (81)

• Aspmc: new frontiers of algebraic answer set counting
• A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure
• Logic programming
• {\textsc{ASPeRiX}}, a first-order forward chaining approach for answer set computing
• Omission-based abstraction for answer set programs
• Title not available (Why is that?)
• Unsatisfiable core analysis and aggregates for optimum stable model search
• An abstract view on optimizations in propositional frameworks
• Common equivalence and size of forgetting from Horn formulae
• Logic Programming and Nonmonotonic Reasoning
• Testing and debugging techniques for answer set solver development
• Prolog and ASP inference under one roof
• On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
• Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
• Answer Set Programming for Single-Player Games in General Game Playing
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• Automata and Answer Set Programming
• Design and results of the second international competition on computational models of argumentation
• The Design of the Sixth Answer Set Programming Competition
• Progress in clasp series 3
• Title not available (Why is that?)
• Improving the normalization of weight rules in answer set programs
• On abstract modular inference systems and solvers
• Predicate-calculus-based logics for modeling and solving search problems
• Answer Set Programming without Unstratified Negation
• Title not available (Why is that?)
• Answer Set Programming’s Contributions to Classical Logic
• Achievements in answer set programming
• Implementing prioritized merging with ASP
• Applications of intuitionistic logic in Answer Set Programming
• On Cascade Products of Answer Set Programs
• Computing loops with at most one external support rule for disjunctive logic programs
• Answer set programming with graded modality
• Integrating answer set programming and constraint logic programming
• On the relation among answer set solvers
• First-order Answer Set Programming as Constructive Proof Search
• An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bridging the gap between reinforcement learning and knowledge representation: a logical off- and on-policy framework
• Anytime answer set optimization via unsatisfiable core shrinking
• Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
• Title not available (Why is that?)
• AI*IA 2005: Advances in Artificial Intelligence
• On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
• A dynamic-programming based ASP-solver
• Constraint answer set solver EZCSP and why integration schemas matter
• Probabilistic Reasoning by SAT Solvers
• Conflict-driven answer set solving: from theory to practice
• Fixed point semantics for stream reasoning
• Approximate postdictive reasoning with answer set programming
• Design and results of the Fifth Answer Set Programming Competition
• Loop formulas for circumscription
• Optimizing answer set computation via heuristic-based decomposition
• Iterative and core-guided maxsat solving: a survey and assessment
• An abstract view on optimizations in SAT and ASP
• Inconsistency proofs for ASP: the ASP-DRUPE format
• Logic Programming and Nonmonotonic Reasoning
• ASSAT: computing answer sets of a logic program by SAT solvers
• The Significance of Memory Costs in Answer Set Solver Implementation
• Title not available (Why is that?)
• Answer set programming in intuitionistic logic
• Abstract Answer Set Solvers
• aspartame: solving constraint satisfaction problems with answer set programming
• Backdoors to tractable answer set programming
• Compact translations of non-disjunctive answer set programs to propositional clauses
• Answer set programs with queries over subprograms
• From (Quantified) Boolean Formulae to Answer Set Programming
• Backdoors to normality for disjunctive logic programs
• Title not available (Why is that?)
• Max-ASP: Maximum Satisfiability of Answer Set Programs
• What is answer set programming to propositional satisfiability
• Logic Programming
• Logic Programming
• Finding Reductions Automatically
• Answer Set Programming with Resources
• Shared aggregate sets in answer set programming
• Rewriting recursive aggregates in answer set programming: back to monotonicity
• Conflict-driven ASP solving with external sources
• Complexity results for answer set programming with bounded predicate arities and implications
• A characterization of answer sets for logic programs

Uses Software

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

This page was built for publication: Answer set programming based on propositional satisfiability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861709)