Computing Stable Models via Reductions to Difference Logic

DOI10.1007/978-3-642-04238-6_14MaRDI QIDQ3643113zbMATH OpenOpenAlexFDO

Authors Tomi Janhunen, Mark Sevalnev, Ilkka Niemelä

Publication date 10 November 2009

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04238-6_14

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Stable models and difference logic
• Compact translations of non-disjunctive answer set programs to propositional clauses
• scientific article; zbMATH DE number 2088041
• On computing logic programs
• scientific article; zbMATH DE number 1368933

Cited in

(15)

• Stable models and difference logic
• Conflict-driven answer set solving: from theory to practice
• Backdoors to tractable answer set programming
• Improving the normalization of weight rules in answer set programs
• Compact translations of non-disjunctive answer set programs to propositional clauses
• Progress in clasp series 3
• Testing and debugging techniques for answer set solver development
• Knowledge compilation of logic programs using approximation fixpoint theory
• scientific article; zbMATH DE number 2088041 (Why is no real title available?)
• scientific article; zbMATH DE number 7455719 (Why is no real title available?)
• Backdoors to normality for disjunctive logic programs
• Local Search For Satisfiability Modulo Integer Arithmetic Theories
• Local Search for SMT on Linear Integer Arithmetic
• A simple proof-theoretic characterization of stable models: reduction to difference logic and experiments
• Constraint answer set programming: integrational and translational (or SMT-based) approaches

Describes a project that uses

Uses Software

• ASSAT
• clasp

This page was built for publication: Computing Stable Models via Reductions to Difference Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3643113)