On the equivalence and range of applicability of graph-based representations of logic programs.
From MaRDI portal
(Redirected from Publication:1853147)
Recommendations
Cites work
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 1884391 (Why is no real title available?)
- Contributions to the stable model semantics of logic programs with negation
- Extremal problems in logic programming and stable model computation
- Graph theoretical structures in logic programs and default theories
- Normal forms for answer sets programming
- On the Expressibility of Stable Logic Programming
- The expressive powers of the logic programming semantics
- The well-founded semantics for general logic programs
- Transformation-based bottom-up computation of the well-founded model
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)