Stability, Supportedness, Minimality and Kleene Answer Set Programs

DOI10.1007/978-3-319-14726-0_9zbMath1432.68457MaRDI QIDQ5172611

Patrick Doherty, Andrzej Szałas

Publication date: 4 February 2015

Published in: Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-114218

Mathematics Subject Classification ID

68T27: Logic in artificial intelligence

68T30: Knowledge representation

68N17: Logic programming

Related Items

Rough set reasoning using answer set programs, A paraconsistent approach to actions in informationally complex environments, Many-valued dynamic object-oriented inheritance and approximations, Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs

Uses Software

• DLV

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equilibrium logic
• Situations, language and logic
• A sound and complete semantics for a version of negation as failure
• On the Minimality of Stable Models
• Answer Set Programming
• Thirteen Definitions of a Stable Model
• A Revised Concept of Safety for General Answer Set Programs
• A kripke-kleene semantics for logic programs*
• The family of stable models
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Computing minimal models, stable models and answer sets
• On notation for ordinal numbers