A simple proof-theoretic characterization of stable models: reduction to difference logic and experiments

DOI10.1016/J.ARTINT.2024.104276MaRDI QIDQ7018390zbMATH OpenFDO

Authors Martin Gebser, Enrico Giunchiglia, Marco Maratea

Publication date 5 March 2025

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2024.104276

zbMATH Keywords

answer-set programmingdifference logiclogic programmingstable models

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Cites work

• \textit{clingcon}: the next generation
• A translational approach to constraint answer set solving
• Answer set programming based on propositional satisfiability
• Answer set programming modulo acyclicity
• ASP-Core-2 input language format
• aspartame: solving constraint satisfaction problems with answer set programming
• ASSAT: computing answer sets of a logic program by SAT solvers
• Computing Stable Models via Reductions to Difference Logic
• Conflict-driven answer set solving: from theory to practice
• Constraint answer set programming: integrational and translational (or SMT-based) approaches
• Constraint answer set solver EZCSP and why integration schemas matter
• Design and results of the Fifth Answer Set Programming Competition
• Evaluation of disjunctive programs in WASP
• How to build your own ASP-based system?!
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 6747915 (Why is no real title available?)
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic Programming
• Logic Programming
• Logic programs with monotone abstract constraint atoms
• Logic programs with stable model semantics as a constraint programming paradigm
• Multi-shot ASP solving with clingo
• Properties and applications of programs with monotone and convex constraints
• Propositional semantics for disjunctive logic programs
• Stable models and difference logic
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• The Seventh Answer Set Programming Competition: Design and Results
• Thirteen Definitions of a Stable Model
• Tight logic programs

This page was built for publication: A simple proof-theoretic characterization of stable models: reduction to difference logic and experiments

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