Stable models and difference logic
From MaRDI portal
Publication:1028651
DOI10.1007/s10472-009-9118-9zbMath1165.68338OpenAlexW2130489957MaRDI QIDQ1028651
Publication date: 6 July 2009
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-009-9118-9
Related Items (9)
Safe Decomposition of Startup Requirements: Verification and Synthesis ⋮ SAT Modulo Graphs: Acyclicity ⋮ Fuzzy answer set computation via satisfiability modulo theories ⋮ On relation between constraint answer set programming and satisfiability modulo theories ⋮ Ordered completion for first-order logic programs on finite structures ⋮ ASP modulo CSP: The clingcon system ⋮ Conflict-driven answer set solving: from theory to practice ⋮ FO(FD): Extending classical logic with rule-based fixpoint definitions ⋮ Thirteen Definitions of a Stable Model
Uses Software
Cites Work
- Unnamed Item
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- Propositional semantics for disjunctive logic programs
- Logic programs with stable model semantics as a constraint programming paradigm
- A rational reconstruction of nonmonotonic truth maintenance systems
- Some (in)translatability results for normal logic programs and propositional theories
- Tight logic programs
- Logic Programming and Nonmonotonic Reasoning
- Enhancing ASP Systems for Planning with Temporal Constraints
- Logic Programming
- Computer Aided Verification
- Fast and Flexible Difference Constraint Propagation for DPLL(T)
- Bounded model checking using satisfiability solving
This page was built for publication: Stable models and difference logic