A Tarskian Informal Semantics for Answer Set Programming

DOI10.4230/LIPICS.ICLP.2012.277zbMath1281.68147OpenAlexW2249048248MaRDI QIDQ5398066

Marc Denecker, Joost Vennekens, Miroslaw Truszczynski, Yuliya Lierler

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

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

Related Items (14)

On abstract modular inference systems and solvers ⋮ Connecting First-Order ASP and the Logic FO(ID) through Reducts ⋮ A progression semantics for first-order logic programs ⋮ FOLASP: FO(·) as Input Language for Answer Set Solvers ⋮ 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 withIDP3 ⋮ 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 ⋮ Beyond NP: Quantifying over Answer Sets ⋮ Answer set programming made easy ⋮ What is answer set programming to propositional satisfiability ⋮ Modular Answer Set Programming as a Formal Specification Language

Uses Software

• STeLP

This page was built for publication: A Tarskian Informal Semantics for Answer Set Programming