Normal forms for answer sets programming

DOI10.1017/S1471068404002339MaRDI QIDQ5715451zbMATH OpenWikidataFDO

Authors Stefania Costantini, Alessandro Provetti

Publication date 3 January 2006

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1471068404002339

zbMATH Keywords

normal formsprogram transformation

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• On the existence of stable models of non-stratified logic programs
• Graph properties for normal logic programs
• Normal Form Nested Programs
• Dual-normal logic programs -- the forgotten class
• Normal form nested programs

Cited in

(5)

• On the equivalence and range of applicability of graph-based representations of logic programs.
• Dual-normal logic programs -- the forgotten class
• Extensions in graph normal form
• Paracoherent answer set semantics meets argumentation frameworks
• About epistemic negation and world views in epistemic logic programs

This page was built for publication: Normal forms for answer sets programming

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