Transition systems for model generators -- a unifying approach
From MaRDI portal
Publication:3087449
Recommendations
Cites work
- A machine program for theorem-proving
- ASSAT: computing answer sets of a logic program by SAT solvers
- Abstract answer set solvers with backjumping and learning
- 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
- On the relation among answer set solvers
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- The relative efficiency of propositional proof systems
- The well-founded semantics for general logic programs
- Weight constraints as nested expressions
Cited in
(8)- An inductive approach for modal transition system refinement
- 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
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)