Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)

DOI10.1007/978-3-319-48758-8_36MaRDI QIDQ2835899zbMATH OpenOpenAlexFDO

Authors Patrick Doherty, Jonas Kvarnström, 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

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

Recommendations

• Stability, supportedness, minimality and Kleene answer set programs
• Stable models for infinitary formulas with extensional atoms
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Well-supported semantics for logic programs with generalized rules
• On equivalence of infinitary formulas under the stable model semantics

Cites work

• A Constructive semantic characterization of aggregates in answer set programming
• 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
• Logic Programming
• Logic Programming
• On the minimality of stable models
• Stability, supportedness, minimality and Kleene answer set programs
• The DLV system for knowledge representation and reasoning
• Thirteen Definitions of a Stable Model
• Why are there so many loop formulas?

Cited in

(2)

• Stability, supportedness, minimality and Kleene answer set programs
• Signed dual tableaux for Kleene answer set programs

Describes a project that uses

Uses Software

• clasp
• Cmodels
• ASSAT

This page was built for publication: Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)

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