Characterizing D-WFS: confluence and iterated GCWA

DOI10.1007/3-540-61630-6_19MaRDI QIDQ5236439zbMATH OpenOpenAlexFDO

Authors J. Dix, Stefan Brass

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

zbMATH Keywords

deductive databasedisjunctive logicdisjunctive programlogic programmingresidual program

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
• The least fixpoint transformation for disjunctive logic programs
• Logic Programming
• Semantics of (disjunctive) logic programs based on partial evaluation
• scientific article; zbMATH DE number 915921

Cites work

• A procedural semantics for well-founded negation in logic programs
• A three-valued semantics for deductive databases and logic programs
• An overview of nonmonotonic reasoning and logic programming
• Characterizations of the stable semantics by partial evaluation
• Generalized disjunctive well-founded semantics for logic programs.
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 25192 (Why is no real title available?)
• scientific article; zbMATH DE number 88998 (Why is no real title available?)
• scientific article; zbMATH DE number 1241670 (Why is no real title available?)
• scientific article; zbMATH DE number 741348 (Why is no real title available?)
• Inferring negative information from disjunctive databases
• Logic programming and negation: A survey
• Partial deduction in disjunctive logic programming
• Static semantics for normal and disjunctive logic programs
• The well-founded semantics for general logic programs
• Three-valued nonmonotonic formalisms and semantics of logic programs
• Weak generalized closed world assumption

Cited in

(6)

• Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
• Semantics of (disjunctive) logic programs based on partial evaluation
• Prolegomena to logic programming for non-monotonic reasoning
• On logics and semantics for general logic programs
• Transformation-based bottom-up computation of the well-founded model
• Computation of non-ground disjunctive well-founded semantics with constraint logic programming

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)