Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs

DOI10.1007/978-3-319-48758-8_36zbMath1483.68058OpenAlexW2542099395MaRDI QIDQ2835899

Jonas Kvarnström, Patrick Doherty, Andrzej Szałas

Publication date: 30 November 2016

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-48758-8_36

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17) Many-valued logic (03B50)

Uses Software

• ASSAT
• Cmodels
• clasp

Cites Work

• ASSAT: computing answer sets of a logic program by SAT solvers
• An alternative approach to the semantics of disjunctive logic programs and deductive databases
• Extending and implementing the stable model semantics
• On the Minimality of Stable Models
• A Constructive semantic characterization of aggregates in answer set programming
• Thirteen Definitions of a Stable Model
• Stability, Supportedness, Minimality and Kleene Answer Set Programs
• Logic Programming
• Why are there so many loop formulas?
• The DLV system for knowledge representation and reasoning
• Logic Programming

This page was built for publication: Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs