Transition systems for model generators -- a unifying approach
DOI10.1017/S1471068411000214zbMATH Open1222.68063OpenAlexW3103684517MaRDI QIDQ3087449FDOQ3087449
Authors: Yuliya Lierler, Mirosław Truszczyński 
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
Recommendations
Logic programming (68N17) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- ASSAT: computing answer sets of a logic program by SAT solvers
- Nested expressions in logic programs
- The well-founded semantics for general logic programs
- Weight constraints as nested expressions
- On the relation among answer set solvers
- Logic programs with stable model semantics as a constraint programming paradigm
- Abstract answer set solvers with backjumping and learning
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- A machine program for theorem-proving
- The relative efficiency of propositional proof systems
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
Cited In (8)
- Disjunctive answer set solvers via templates
- Relating constraint answer set programming languages and algorithms
- Abstract Solvers for Computing Cautious Consequences of ASP programs
- Satisfiability Checking for PC(ID)
- Constraint answer set solver EZCSP and why integration schemas matter
- What is answer set programming to propositional satisfiability
- Connecting first-order ASP and the logic FO(ID) through reducts
- An inductive approach for modal transition system refinement
Uses Software
This page was built for publication: Transition systems for model generators -- a unifying approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087449)
