T. Eiter and H. Veith. On the Complexity of Data Disjunctions. Technical Report DBAI-TR-99-29 (1999).  Home/Search   Document Details and Download   Summary   Related Articles

....logic program. In disjunctive logic programming a disjunction a 1 a n is allowed to occur in each head of a rule. We mention some words about the respective complexity issues in Section 4. 8 and refer to [Marek and Truszczynski, 1993; Dantsin et al. 1997; Eiter and Gottlob, 1995b; Eiter and Veith, 1999] for overviews and several complexity results. The stable model semantics for logic programs, and the disjunctive stable model semantics for disjunctive logic programs is defined as follows. Definition 2.5.26 Given a DLP P and an interpretation I , the Gelfond Lifschitz transformation P I of P ....

....54 TECHNICAL REPORT DBAI TR 2000 40 Remark. If we allow the oracle space to be unrestricted, then also classes like PSPACE P create higher classes this class then coincides with EXPTIME. However, with restricted oracle space the class for instance coincides with PSPACE. Compare for instance to [Eiter and Veith, 1999] for use of such concepts. 3.6 Search and Function Problems Sometimes you are not happy with closed questions and want to formulate questions like Tell me the shortest way from A to B or, given a number of SAT instances, you simply want to know the number of satisfiable formulae. These ....

[Article contains additional citation context not shown here]

T. Eiter and H. Veith. On the Complexity of Data Disjunctions. Technical Report DBAI-TR-99-29 (1999).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC