Closed world assumption for disjunctive reasoning

DOI10.1007/BF02948986zbMath1010.68062OpenAlexW2053269343MaRDI QIDQ5959358

Lizhu Zhou, Kewen Wang

Publication date: 3 April 2002

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02948986

zbMATH Keywords

closed world assumptiondisjunctive information

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An extension to linear resolution with selection function
• Static semantics for normal and disjunctive logic programs
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
• A lattice-theoretical fixpoint theorem and its applications
• An abductive approach to disjunctive logic programming
• Argumentation-based abduction in disjunctive logic programming
• Semantics of (disjunctive) logic programs based on partial evaluation

This page was built for publication: Closed world assumption for disjunctive reasoning