Processing negation and disjunction in logic programs through integrity constraints.
Integrity constraints were initially defined to verify the correctness of the data that is stored in a database. They were used to restrict the modifications that can be applied to a database. However, there are many other applications in which integrity constraints can play an important role. For example, the semantic query optimization method developed by Chakravarthy, Grant, and Minker for definite deductive databases uses integrity constraints during query processing to prevent the exploration of search space that is bound to fail. In this paper, we generalize the semantic query optimization method to apply to negated atoms. The generalized method is referred to as semantic compilation. This exploration has led to two significant results. First, semantic compilation provides an alternative search space for negative query literals. The alternative search space can find answers in cases for which negation-as-finite-failure and constructive negation cannot. Second, we show how semantic compilation can be used to transform a disjunctive database with or without functions and denial constraints without negation into a new disjunctive database that complies with the integrity constraints.
- Research Organization:
- Argonne National Lab. (ANL), Argonne, IL (United States)
- Sponsoring Organization:
- ER
- DOE Contract Number:
- DE-AC02-06CH11357
- OSTI ID:
- 937678
- Report Number(s):
- ANL/MCS/JA-10862; TRN: US200905%%380
- Journal Information:
- J. Intelligent Inf. Syst., Vol. 2, Issue 3 ; 1993
- Country of Publication:
- United States
- Language:
- ENGLISH
Similar Records
Using semantic information for processing negation and disjunction in logic programs
Parallel-logic programming and parallel-system software and hardware. Final report, 1 Nov 89-31 Dec 90