Saturation, nonmonotonic reasoning and the closed-world assumption
Artificial Intelligence
The logical basis for computer programming. Volume 1: deductive reasoning
The logical basis for computer programming. Volume 1: deductive reasoning
Logical foundations of artificial intelligence
Logical foundations of artificial intelligence
A storage scheme for efficient processing of queries in indefinite deductive databases
A storage scheme for efficient processing of queries in indefinite deductive databases
Compiling the GCWA in indefinite deductive databases
Foundations of deductive databases and logic programming
Incremental compilation of rules in indefinite deductive databases
Incremental compilation of rules in indefinite deductive databases
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Logic and Databases: A Deductive Approach
ACM Computing Surveys (CSUR)
A relational model of data for large shared data banks
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
Logic and Data Bases
Automated Reasoning: Introduction and Applications
Automated Reasoning: Introduction and Applications
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Semantics of extended relational model for managing uncertain information
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
| Hi-index | 0.00 |
We introduce an inference scheme, based on the compilation approach, that can answer "true," provable-false," "indefinite," or "assumable-false" to a closed query in an indefinite deductive database under the generalized closed world assumption. The inference scheme proposed in this paper consists of a representation scheme and an evaluation process that uses one of two groups of positive indefinite ground clauses (PIGC's) derivable from the database for a given query. These two groups of PIGC's are base-PIGC's and descendants of base-PIGC's. We prove that the set of base-PIGC's derivable from the database is sufficient to infer the indefiniteness of a query. This newly proposed method offers many advantages over the existing compilation method. This new method outperforms the existing one in terms of the cost of compilation, ease in the handling of updates, and efficiency in query evaluation.