Annotations on the consistency of the closed world assumption

DOI10.1016/0743-1066(90)90024-YMaRDI QIDQ4713089zbMATH OpenOpenAlexFDO

Authors Gerhard Jäger

Publication date 25 June 1992

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(90)90024-y

zbMATH Keywords

consistencylogic programmingnegationnegative informationReiter's closed world assumption

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Logic programming (68N17)

Recommendations

• scientific article; zbMATH DE number 589696
• scientific article; zbMATH DE number 1123619
• Adding closed world assumptions to well-founded semantics
• Weak generalized closed world assumption
• scientific article; zbMATH DE number 970713
• Closed world assumptions having precedence in predicates
• Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
• Saturation, nonmonotonic reasoning and the closed-world assumption
• scientific article; zbMATH DE number 732052
• Closed world assumption for disjunctive reasoning

Cited in

(2)

• Weak generalized closed world assumption
• scientific article; zbMATH DE number 970713 (Why is no real title available?)

This page was built for publication: Annotations on the consistency of the closed world assumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713089)