What is answer set programming to propositional satisfiability

DOI10.1007/s10601-016-9257-7zbMath1423.68483OpenAlexW2304178603WikidataQ59611995 ScholiaQ59611995MaRDI QIDQ1699519

Yuliya Lierler

Publication date: 23 February 2018

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-016-9257-7

zbMATH Keywords

computational logicpropositional satisfiabilityanswer set programming

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items

Analyzing read-once cutting plane proofs in Horn systems, Block structured scheduling using constraint logic programming, Magic sets for disjunctive Datalog programs, An abstract view on optimizations in SAT and ASP, Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas

Uses Software

• MiniSat
• ASSAT
• Cmodels
• Gringo
• Smodels
• Lparse
• Chaff
• Potassco
• clasp
• WASP
• Clingo
• iClingo
• BEE
• aspcud
• IDP
• GidL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning as satisfiability: heuristics
• On the power of clause-learning SAT solvers as resolution engines
• ASSAT: computing answer sets of a logic program by SAT solvers
• Answer set programming based on propositional satisfiability
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Answer set programming and plan generation
• Extending and implementing the stable model semantics
• Conflict-driven answer set solving: from theory to practice
• The expressive powers of the logic programming semantics
• Logic programs with stable model semantics as a constraint programming paradigm
• Nested expressions in logic programs
• Writing Declarative Specifications for Clauses
• Connecting First-Order ASP and the Logic FO(ID) through Reducts
• Team-building with answer set programming in the Gioia-Tauro seaport
• Abstract answer set solvers with backjumping and learning
• Transition systems for model generators—A unifying approach
• Advances in WASP
• Solving SAT and SAT Modulo Theories
• Some (in)translatability results for normal logic programs and propositional theories
• GRASP: a search algorithm for propositional satisfiability
• Abstract gringo
• Checking termination of bottom-up evaluation of logic programs with function symbols
• On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
• Weight constraints as nested expressions
• Compiling finite domain constraints to SAT withBEE
• Planning with Effectively Propositional Logic
• Predicate-calculus-based logics for modeling and solving search problems
• Why are there so many loop formulas?
• The DLV system for knowledge representation and reasoning
• A Tarskian Informal Semantics for Answer Set Programming
• Logic Programming and Nonmonotonic Reasoning
• Conflict-Driven Answer Set Enumeration
• Logic Programming
• Computable Functions in ASP: Theory and Implementation
• A machine program for theorem-proving
• Theory and Applications of Satisfiability Testing
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution