Stable models and difference logic

DOI10.1007/s10472-009-9118-9zbMath1165.68338MaRDI QIDQ1028651

Ilkka Niemelä

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

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

68N17: Logic programming

Related Items

Fuzzy answer set computation via satisfiability modulo theories, On relation between constraint answer set programming and satisfiability modulo theories, ASP modulo CSP: The clingcon system, Ordered completion for first-order logic programs on finite structures, Conflict-driven answer set solving: from theory to practice, SAT Modulo Graphs: Acyclicity, FO(FD): Extending classical logic with rule-based fixpoint definitions, Thirteen Definitions of a Stable Model

Uses Software

• ASSAT
• Cmodels
• Datalog

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