Using semantic information for processing negation and disjunction in logic programs

Conference · Thu Jul 01 04:00:00 EDT 1993

OSTI ID:10173101

Gaasterland, T ^[1]; Lobo, J ^[2]

---

1. Argonne National Lab., IL (US)
2. Univ. of Illinois, Chicago, IL (US). Dept. of Electrical Engineering and Computer Science

There are many applications in which integrity constraints can play an important role. An example is the semantic query optimization method developed by Chakravarthy, Grant, and Minker for definite deductive databases. They use integrity constraints during query processing to prevent the exploration of search space that is bound to fail. In this paper, the authors generalize the semantic query optimization method to apply to negated atoms. The generalized method is referred to as semantic compilation. They show that semantic compilation provides an alternative search space for negative query literals. They also 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., IL (United States)
• Sponsoring Organization: USDOE, Washington, DC (United States)
• DOE Contract Number: W-31109-ENG-38
• OSTI ID: 10173101
• Report Number(s): ANL/MCS/CP--80151; CONF-9306151--1; ON: DE93017412
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200
990301
CONSTRAINTS
DATA BASE MANAGEMENT
DATA HANDLING
DATA PROCESSING
INFORMATION
MATHEMATICAL LOGIC
MATHEMATICS AND COMPUTERS
OPTIMIZATION
PROGRAMMING