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)

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

Describes a project that uses

Uses Software

• clasp
• ASSAT

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)