Contributions to the stable model semantics of logic programs with negation
From MaRDI portal
Publication:672705
DOI10.1016/0304-3975(94)00259-LzbMath0874.68193OpenAlexW2161628186MaRDI QIDQ672705
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00259-l
Related Items (2)
RASP and ASP as a fragment of linear logic ⋮ On the equivalence and range of applicability of graph-based representations of logic programs.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The alternating fixpoint of logic programs with negation
- LOGIDATA+: deductive databases with complex objects
- A rational reconstruction of nonmonotonic truth maintenance systems
- Short note preferred extensions are partial stable models
- The well-founded semantics for general logic programs
- Computing abduction by using TMS with top-down expectation
This page was built for publication: Contributions to the stable model semantics of logic programs with negation