On the equivalence and range of applicability of graph-based representations of logic programs.
From MaRDI portal
Publication:1853147
DOI10.1016/S0020-0190(02)00290-9zbMATH Open1042.68028OpenAlexW2070951159WikidataQ58946663 ScholiaQ58946663MaRDI QIDQ1853147FDOQ1853147
Authors: Stefania Costantini, Ottavio M. D'Antona, Alessandro Provetti 
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
Recommendations
Cites Work
- Title not available (Why is that?)
- The well-founded semantics for general logic programs
- Title not available (Why is that?)
- Graph theoretical structures in logic programs and default theories
- The expressive powers of the logic programming semantics
- Contributions to the stable model semantics of logic programs with negation
- Transformation-based bottom-up computation of the well-founded model
- On the Expressibility of Stable Logic Programming
- Title not available (Why is that?)
- Extremal problems in logic programming and stable model computation
- Normal forms for answer sets programming
Cited In (5)
- Some (in)translatability results for normal logic programs and propositional theories
- Justifications for logic programs under answer set semantics
- Answering the ``why in answer set programming -- a survey of explanation approaches
- On the Expressive Power of Graph Logic
- Logic for Programming, Artificial Intelligence, and Reasoning
This page was built for publication: On the equivalence and range of applicability of graph-based representations of logic programs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853147)
