• Home
  • Search
  • Evaluation of Queries under Closed-World Assumption
  • Cite Icon4
  • https://doi.org/10.1023/a:1005723423016Copy DOI Icon

Evaluation of Queries under Closed-World Assumption

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The minimal entailment vMin has been characterized elsewhere by P vMin} p iff Cn(P ∪ {p}) ∩ Pos ⊆ Cn(P) where Cn is the first-order consequence operation, P is a set of clauses (indefinite deductive data base; in short: a data base), p is a clause (a query), and Pos is the set of positive (that is, bodiless) ground clauses. In this paper, we address the problem of the computational feasibility of criterion (1). Our objective is to find a query evaluation algorithm that decides P vMin p by what we call indefinite modeling, without actually computing all ground positive consequences of P and P ∪ {p}. For this purpose, we introduce the concept of minimal indefinite Herbrand model MP of P, which is defined as the set of subsumption-minimal ground positive clauses provable from P. The algorithm first computes MP by finding the least fixed-point of an indefinite consequence operator μ TIP. Next, the algorithm verifies whether every ground positive clause derivable from MP ∪ {p} by one application of the parallel positive resolution rule (in short: the PPR rule) is subsumed by an element of MP. We prove that the PPR rule, which can derive only positive clauses, is positively complete, that is, every positive clause provable from a data base P is derivable from P by means of subsumption and finitely many applications of PPR. From this we conclude that the presented algorithm is partially correct and that it eventually halts if both P and MP are finite. Moreover, we indicate how the algorithm can be modified to handle data bases with infinite indefinite Herbrand models. This modification leads to a concept of universal model that allows for nonground clauses in its Herbrand base and appears to be a good candidate for representation of indefinite deductive data bases.

Similar Papers
  • Book Chapter

Resolution and Unification

  • Jan 01, 1997
  • Rolf Socher-Ambrosius +1
  • Research Article
  • Citations69

Positive Unit Hyperresolution Tableaux and Their Application to Minimal Model Generation

  • Jul 01, 2000
  • Journal of Automated Reasoning
  • François Bry +1
  • Book Chapter
  • Citations50

ON CLOSED WORLD DATA BASES

  • Jan 01, 1981
  • Readings in Artificial Intelligence
  • Raymond Reiter
  • Book Chapter
  • Citations71

ON CLOSED WORLD DATA BASES

  • Jan 01, 1989
  • Readings in Artificial Intelligence and Databases
  • Raymond Reiter
  • Book Chapter
  • Citations6

On the Complexity of H-Subsumption

  • Jan 01, 1999
  • Reinhard Pichler
  • Research Article
  • Citations10

Revising the logical foundations of inductive logic programming systems with ground reduced programs

  • Mar 01, 1999
  • New Generation Computing
  • Akihiro Yamamoto
  • Research Article
  • Citations1

An Improvement of Herbrand's Theorem and Its Application to Model Generation Theorem Proving

  • Jul 01, 2007
  • Journal of Computer Science and Technology
  • Yu-Yan Chao +5
  • Research Article

Normal forms and syntactic completeness proofs for functional independencies

  • Sep 01, 2001
  • Theoretical Computer Science
  • Duminda Wijesekera +3
  • Book Chapter
  • Citations10

Synthesis of Programs from Unfold/Fold Proofs

  • Jan 01, 1994
  • Maurizio Proietti +1
  • Research Article
  • Citations11

On the convergence of query evaluation

  • Apr 01, 1989
  • Journal of Computer and System Sciences
  • Foto Afrati +5
  • Book Chapter
  • Citations25

Chapter 9 - Some Proof Procedures Based on Herbrand's Theorem

  • Jan 01, 1973
  • Symbolic Logic and Mechanical Theorem Proving
  • Chin-Liang Chang +1
  • Book Chapter
  • Citations16

A natural semantics for logic programs with negation

  • Jan 01, 1989
  • Phan Minh Dung +1
  • Book Chapter
  • Citations75

An Improved Incremental Algorithm for Generating Prime Implicates

  • Jan 01, 1999
  • Johan Kleer
  • Research Article
  • Citations11

The diffusion of computer applications in medical settings.

  • Jan 01, 1984
  • Medical informatics = Medecine et informatique
  • James G Anderson +1
  • Book Chapter
  • Citations3

The Diffusion of Computer Applications in Medical Settings

  • Jan 01, 1984
  • James G Anderson +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.