Processing Indefinite Deductive Databases under the Possible Model Semantics

• Autorzy: Johnson C.A.
• Języki publikacji: EN

Abstrakty

EN

The relationship between possible and supported models of unstratified indefinite deductive databases is studied, when disjunction is interpreted inclusively. Possible and supported models are shown to coincide under a suitable definition of supportedness, and the concept of a supported cover is introduced and shown to characterise possible models and facilitate top-down query processing and compilation under the possible model semantics. The properties and query processing of deductive databases under the possible model semantics is compared and contrasted with the perfect model semantics.

Słowa kluczowe

EN

indefinite deductive databases; possible model; stable model; stationary model; supported model; perfect model; supported covers; query processing; query compilation

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2002
• Tom: Vol. 49, nr 4
• Strony: 325--347
• Opis fizyczny: bibliogr. 22 poz.

Twórcy

autor

Johnson C.A.

• School of Computing, University of Plymouth, Devon, PL4 8AA, England,