Characterizing D-WFS: Confluence and iterated GCWA
From MaRDI portal
Publication:5236439
DOI10.1007/3-540-61630-6_19zbMath1427.68041OpenAlexW1518971173MaRDI QIDQ5236439
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
- Inferring negative information from disjunctive databases
- Three-valued nonmonotonic formalisms and semantics of logic programs
- A three-valued semantics for deductive databases and logic programs
- Generalized disjunctive well-founded semantics for logic programs.
- Weak generalized closed world assumption
- Static semantics for normal and disjunctive logic programs
- A procedural semantics for well-founded negation in logic programs
- An overview of nonmonotonic reasoning and logic programming
- The well-founded semantics for general logic programs
- Logic programming and negation: A survey
- Partial deduction in disjunctive logic programming
- Characterizations of the stable semantics by partial evaluation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Characterizing D-WFS: Confluence and iterated GCWA