A Tarskian informal semantics for answer set programming

DOI10.4230/LIPICS.ICLP.2012.277MaRDI QIDQ5398066zbMATH OpenOpenAlexFDO

Authors Marc Denecker, Yuliya Lierler, Mirosław Truszczyński, Joost Vennekens

Publication date 25 February 2014

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2012/3629/pdf/27.pdf/

zbMATH Keywords

answer set programminggenerate-define-testinformal semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic in artificial intelligence (68T27)

Recommendations

• Answer Set Programming: A Primer
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Autoepistemic answer set programming
• Answer set programming
• On testing answer-set programs

Cited in

(20)

• A progression semantics for first-order logic programs
• What is answer set programming to propositional satisfiability
• Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version
• On abstract modular inference systems and solvers
• Connecting first-order ASP and the logic FO(ID) through reducts
• How Flexible Is Answer Set Programming? An Experiment in Formalizing Commonsense in ASP
• An ASP methodology for understanding narratives about stereotypical activities
• Knowledge compilation of logic programs using approximation fixpoint theory
• Semantics of templates in a compositional framework for building logics
• Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3
• Stable-unstable semantics: Beyond NP with normal logic programs
• First-order modular logic programs and their conservative extensions
• The KB paradigm and its application to interactive configuration
• On structural analysis of non-ground answer-set programs
• ASP Based Generation of Information Terms for Constructive ɛℒ
• Beyond NP: quantifying over answer sets
• Modular answer set programming as a formal specification language
• Program Correspondence under the Answer-Set Semantics: The Non-ground Case
• FOLASP: FO(·) as Input Language for Answer Set Solvers
• Answer set programming made easy

Describes a project that uses

Uses Software

• STeLP

This page was built for publication: A Tarskian informal semantics for answer set programming

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