On structural analysis of non-ground answer-set programs

MaRDI QIDQ4631192zbMATH OpenFDO

Authors Benjamin Kiesl, Peter Schüller, Hans Tompits

Publication date 24 April 2019

Full work available at URL http://ceur-ws.org/Vol-1433/tc_65.pdf

zbMATH Keywords

answer-set programminggenerate-define-test paradigmprogram analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• A Tarskian informal semantics for answer set programming
• On testing answer-set programs
• Specifying and verbalising answer set programs in controlled natural language
• Catching the Ouroboros: on debugging non-ground answer-set programs
• Program completion in the input language of GRINGO

Cited in

(7)

• Specifying and verbalising answer set programs in controlled natural language
• The power of non-ground rules in Answer Set Programming
• A logic-based framework leveraging neural networks for studying the evolution of neurological disorders
• An Answer Set Solver for non-Herbrand Programs: Progress Report
• Answer Set Programming without Unstratified Negation
• Program Correspondence under the Answer-Set Semantics: The Non-ground Case
• Abstraction for non-ground answer set programs

This page was built for publication: On structural analysis of non-ground answer-set programs

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