Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases
نویسندگان
چکیده
This paper investigates the expressive power and complexity of partial model semantics for disjunctive deductive databases. In particular, partial stable, regular model, maximal stable (M-stable), and least undeened stable (L-stable) semantics for function-free disjunctive logic programs are considered, for which the expressiveness of queries based on possibility and certainty inference is determined. On the complexity side, we determine the data and expression complexity of query evaluation. The analysis pays particular attention to the impact of syntactical restrictions on programs in the form of limited use of disjunction and negation. It appears that the considered semantics capture complexity classes at the lower end of the polynomial hierarchy. In fact, each class P i , P i 1 i 3 is captured by some semantics using appropriate syntactical restrictions. Partial stable models have exactly the same expressive power and complexity as total stable models ((P 2 resp. P 2), while a higher degree of expressiveness is obtained by the semantics which minimize undeenedness (M-stable, regular, and L-stable semantics). In particular, L-stable semantics has the highest expressive power ((P 3 resp. P 3). An interesting result in this course is that, in contrast with total stable models, negation is for partial stable models more expressive than disjunction. For the data complexity of queries, we obtain completeness results for the classes P i , P i , i 3, and, for the expression complexity, completeness results for the analogous classes at the lower end of the weak exponential hierarchy. The results of this paper complement and extend previous results, and contribute to a more complete picture of the computational aspects of disjunctive logic programming and databases, which supports in choosing an appropriate setting that ts the needs in practice.
منابع مشابه
Expressive Power and Complexity of Partial Models for Disjunctive Deductive Databases 1
This paper investigates the expressive power and complexity of partial model semantics for disjunctive deductive databases. In particular, partial stable, regular model, maximal stable (M-stable), and least undeened stable (L-stable) semantics for function-free disjunctive logic programs are considered, for which the expressiveness of queries based on possibility and certainty inference is dete...
متن کاملPartial Evidential Stable Models for Disjunctive Deductive Databases
In this paper we consider the basic semantics of stable and partial stable models for disjunctive deductive databases (with default negation), cf. [9,16]. It is well–known that there are disjunctive deductive databases where no stable or partial stable models exist, and these databases are called inconsistent w.r.t. the basic semantics. We define a consistent variant of each class of models, wh...
متن کاملMinimal founded semantics for disjunctive logic programs and deductive databases
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases. The semantics, called minimal founded, generalizes stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model ...
متن کاملA Characterization of the Partial Stable Models for Disjunctive Deductive Databases
We give a characterization of the partial stable models of a disjunctive deductive database P in terms of the total stable models of a suitably transformed database P tu. The transformation is based on annotating the atoms in the given database by the truth values true (\t") and undeened (\u"). Currently many fast algorithms are being developed for computing the total stable models of disjuncti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 206 شماره
صفحات -
تاریخ انتشار 1998