Characterizing D-WFS: Confluence and iterated GCWA
From MaRDI portal
Publication:5236439
DOI10.1007/3-540-61630-6_19zbMATH Open1427.68041OpenAlexW1518971173MaRDI QIDQ5236439FDOQ5236439
Publication date: 8 October 2019
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61630-6_19
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A three-valued semantics for deductive databases and logic programs
- The well-founded semantics for general logic programs
- Characterizations of the stable semantics by partial evaluation
- Logic programming and negation: A survey
- Static semantics for normal and disjunctive logic programs
- Inferring negative information from disjunctive databases
- Three-valued nonmonotonic formalisms and semantics of logic programs
- Weak generalized closed world assumption
- A procedural semantics for well-founded negation in logic programs
- An overview of nonmonotonic reasoning and logic programming
- Partial deduction in disjunctive logic programming
- Generalized disjunctive well-founded semantics for logic programs.
Cited In (4)
This page was built for publication: Characterizing D-WFS: Confluence and iterated GCWA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236439)