On the equivalence and range of applicability of graph-based representations of logic programs.

DOI10.1016/S0020-0190(02)00290-9zbMath1042.68028WikidataQ58946663 ScholiaQ58946663MaRDI QIDQ1853147

Alessandro Provetti, Stefania Costantini, Ottavio M. D'Antona

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00290-9

zbMATH Keywords

Graph algorithms; Logic Programming; Answer Set Programming

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68N17: Logic programming

Related Items

Answering the “why” in answer set programming – A survey of explanation approaches, Justifications for logic programs under answer set semantics, Some (in)translatability results for normal logic programs and propositional theories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph theoretical structures in logic programs and default theories
• Contributions to the stable model semantics of logic programs with negation
• The expressive powers of the logic programming semantics
• Extremal problems in logic programming and stable model computation
• The well-founded semantics for general logic programs
• Transformation-based bottom-up computation of the well-founded model
• On the Expressibility of Stable Logic Programming
• Normal forms for answer sets programming