A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This paper investigates the expressive power and complexity of partial model semantics for disjunctive deductive databases. ... Partial stable models have exactly the same expressive power and complexity as total stable models (2;' resp. ... We have also investigated the impact of limited disjunction and negation on expressive power and complexity of partial models that minimize undefinedness. ...doi:10.1016/s0304-3975(97)00129-1 fatcat:io2zafah3jabzpkcbrg4oigq3y
(I-CLBR-EL; Arcavacata di Rende) Expressive power and complexity of partial models for disjunctive deductive databases. ... Summary: “This paper investigates the expressive power and complexity of partial model semantics for disjunctive deductive databases. ...
Summary: “We give a characterization of the partial stable models of a disjunctive deductive database FY in terms of the total stable models of a suitably transformed database A“. ... “Currently many fast algorithms are being developed for com- puting the total stable models of disjunctive deductive databases. ...
The notion of partial stable model has been extended to disjunctive deductive databases using 3-valued logics. ... Summary: “Partial stable models for deductive databases, i.e., nor- mal function-free logic programs (also called datalog programs), have two equivalent definitions: one based on 3-valued logics and another ...
We study the complexity of data disjunctions in disjunctive deductive databases (DDDBs). ... Our results extend and complement previous results on the complexity of disjunctive databases, and provide newly developed tools for the analysis of the complexity of function computation. ... Acknowledgements We are grateful to Iain Stewart and Georg Gottlob for discussions and remarks. ...doi:10.1016/s0304-3975(01)00147-5 fatcat:ghu6tkfyzramhlo3y5cmqzl4su
Partial information does not only come from the presence of null values ‘or disjunctive data in a single database, but may also arise from answering queries against several databases combined, each of ... In the present paper, they discuss deductive query languages with recursive types. The first focus of the paper is to study the expressive power of two extensions of the language COL [S. ...
The AI Magazine
I review developments in the field, assess contributions, consider the status of implementations of deductive databases, and discuss future work needed in deductive databases. Articles ... The impetus for it started approximately 20 years ago in 1976 when I visited Gallaire and Nicolas in Toulouse, France. ... The full paper is dedicated in honor of Hervé Gallaire and Jean-Marie Nicolas with whom I have worked as co-author, co-editor, colleague, and friend and who have helped to make the field of deductive databases ...doi:10.1609/aimag.v18i3.1304 dblp:journals/aim/Minker97 fatcat:6foa4j2a45cabojbsyxj7rwpfq
The model tree is a shared structure that contains the minimal models of the disjunctive deductive database. ... Przymusinski [1721 introduces the stable model semantics for disjunctive logic programs and disjunctive deductive databases. This generalizes the stable model semantics for normal logic programs. ...doi:10.1016/0743-1066(93)90028-f fatcat:zs5h4ximffdfvapevyr6rvs4fm
Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal model semantics of positive disjunctive programs and the stable model semantics of ... From the procedural side, disjunctive partial deduction is combined with a bottom-up proof procedure of disjunctive logic programs, and top-down partial deduction is introduced for query optimization. ... In this respect, partial deduction makes disjunctive logic programming more practical by providing a method for optimizing disjunctive logic programs and disjunctive deductive databases. 10 A model M ...doi:10.1016/s0743-1066(96)00120-3 fatcat:s4hiduubpneobm37ree5eol6ny
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. ... We study the expressive power of the semantics and show that for general disjunctive datalog programs it has the same power as disjunctive stable model semantics. ... Acknowledgement A preliminary version of this paper was presented at the LPNMR'99 conference (Greco, 1999) . The work was partially supported by the Murst projects "DataX" and "D2I". ...doi:10.1017/s1471068403001704 fatcat:33xpkgsxwzayda3xxs7t3e7jmq
A reformulation of the partial deduction procedure in terms of the fold/unfold transformation is given that permits the incorpo- ration into the partial deduction not only of folding and unfolding but ... Illustrations of these tech- niques are given for stable models, disjunctive well-founded and stationary semantics. ...
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. ... We study the expressive power of the semantics and show that for general disjunctive datalog programs it has the same power as disjunctive stable model semantics. ... Acknowledgement The authors are grateful to the anonymous referees for their useful comments and suggestions. ...arXiv:cs/0312028v1 fatcat:p4kxhotepzd2zhcj6ysycrnrha
Query languages for retrieving information from disjunctive databases are an interesting open area of research. ... The expressive power of the languages that we consider has been explored in the context of relational databases. ... and comments, and Victor Vianu for providing references to related work. ...doi:10.1016/0304-3975(95)00192-1 fatcat:knpw5am77fbxtd557mlq64uxli
Lecture Notes in Computer Science
Query answering is a key reasoning task for many ontology based applications in the Semantic Web. Unfortunately for OWL, the worst case complexity of query answering is very high. ... Moreover, caching techniques and a form of progressive query answering are also explored. This work is partially funded by the EC Indicate project. ... For example, the amount of backtracking that the reasoner performs while trying di«erent possibilities that arise from disjunctions defines the complexity of a model and hence the time that is needed to ...doi:10.1007/978-3-642-21064-8_45 fatcat:kumdiz4vhfahvd7mqyt7yhlivq
Logic has been a common ground where Database and Artificial Intelligence research competed and collaborated with each other for a long time (Abiteboulet al. 1995). ... Much has happened in data and knowledge base research since the introduction of the relational model in Codd (1970) and its strong logical foundations influence its advances ever since. ... Dahl for her insights on Datalog applications for Natural Language Processing and to B. Motik for his presentation on Datalog-based formalisms in the Semantic-Web community. ...doi:10.1017/s1471068410000086 fatcat:2zi7w5eejvanpknuncdy6qmw2e
« Previous Showing results 1 — 15 out of 2,526 results