Weak generalized closed world assumption

DOI10.1007/BF00248321zbMath0683.68086WikidataQ109585681 ScholiaQ109585681MaRDI QIDQ1825049

Jorge Lobo, Arcot Rajasekar, Jack Minker

Publication date: 1989

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

logic programmingClosed World Assumptionnegation as finite failure

Mathematics Subject Classification ID

Artificial intelligence (68T99)

Related Items (16)

The complexity of propositional closed world reasoning and circumscription ⋮ Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete ⋮ An alternative approach to the semantics of disjunctive logic programs and deductive databases ⋮ On stratified disjunctive programs ⋮ Static semantics for normal and disjunctive logic programs ⋮ On the computational cost of disjunctive logic programming: Propositional case ⋮ Autoepistemic logic of knowledge and beliefs ⋮ Is intractability of nonmonotonic reasoning a real drawback? ⋮ Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete ⋮ Semantics of Horn and disjunctive logic programs ⋮ Query evaluation in probabilistic relational databases ⋮ Parsing as non-Horn deduction ⋮ An abductive framework for negation in disjunctive logic programming ⋮ Characterizing D-WFS: Confluence and iterated GCWA ⋮ Fuzzy information in extended fuzzy relational databases ⋮ Interpreting disjunctive logic programs based on a strong sense of disjunction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closures and fairness in the semantics of programming logic
• Inferring negative information from disjunctive databases
• An extension to linear resolution with selection function
• Linear resolution with selection function
• A fixpoint semantics for disjunctive logic programs
• Contributions to the Theory of Logic Programming
• The Semantics of Predicate Logic as a Programming Language

This page was built for publication: Weak generalized closed world assumption