Transition systems for model generators—A unifying approach

DOI10.1017/S1471068411000214zbMath1222.68063OpenAlexW3103684517MaRDI QIDQ3087449

Miroslaw Truszczynski, Yuliya Lierler

Publication date: 16 August 2011

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1471068411000214

zbMATH Keywords

satisfiability solvers

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Logic programming (68N17)

Related Items

Connecting First-Order ASP and the Logic FO(ID) through Reducts ⋮ Disjunctive answer set solvers via templates ⋮ Constraint answer set solver EZCSP and why integration schemas matter ⋮ Abstract Solvers for Computing Cautious Consequences of ASP programs ⋮ What is answer set programming to propositional satisfiability ⋮ Relating constraint answer set programming languages and algorithms

Uses Software

• Smodels

Cites Work

• ASSAT: computing answer sets of a logic program by SAT solvers
• On the relation among answer set solvers
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Logic programs with stable model semantics as a constraint programming paradigm
• Nested expressions in logic programs
• Abstract answer set solvers with backjumping and learning
• Solving SAT and SAT Modulo Theories
• The relative efficiency of propositional proof systems
• The well-founded semantics for general logic programs
• Weight constraints as nested expressions
• A machine program for theorem-proving