Tytuł artykułu
Autorzy
Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
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.
Wydawca
Czasopismo
Rocznik
Tom
Strony
325--347
Opis fizyczny
bibliogr. 22 poz.
Twórcy
autor
- School of Computing, University of Plymouth, Devon, PL4 8AA, England, chrisj@soc.plymouth.ac.uk
Bibliografia
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BUS2-0003-0120