Eiter, T., Gottlob, G., and Mannila, H. 1997. Disjunctive datalog. ACM Transactions on Database Systems (TODS) 22, 364-418. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
Stable Model Checking Made Easy - Koch, Leone (1999) (1 citation) (Correct)
....and benchmarks have been run. 1 Introduction Disjunctive logic programming (DLP) with stable model semantics is a powerful nonmonotonic formalism for knowledge representation and commonsense reasoning [ Baral and Gelfond, 1994; Lobo et al. 1992 ] DLP has a very high expressive power [ Eiter et al. 1997a ] and it allows to represent complex problems in a simple and easy to understand fashion [ Eiter et al. 1998 ] As for the other main nonmonotonic formalisms, reasoning with DLP (under stable model semantics) is very hard. The high complexity of DLP reasoning depends also on the hardness of ....
....of at a time, without storing any intermediate data apart from a (fixed) number of indices. # 5 Implementation and Benchmarks In order to check the concrete usability of our results, we have implemented our approach to stable model checking in the disjunctive logic programming system dlv [ Eiter et al. 1997b; 1998 ] dlv is a knowledge representation system which has been developed at Technische Universitat Wien. Recent comparisons [ Eiter et al. 1998 ] have shown that dlv is nowadays a state of the art implementation of disjunctive logic programming. To our knowledge, dlv is the only publicly ....
[Article contains additional citation context not shown here]
T. Eiter, G. Gottlob, H. Mannila. (1997) Disjunctive Datalog. ACM-TODS, 22(3):315-- 363.
Aspects of Rewriting Queries on Semistructured Data - Lausen, Wei, Marrón (Correct)
....expanding a query using disjunctive referential constraints, we get a union of subqueries. If a set of DRC is considered, then each of the expanded subqueries needs to be minimal in the size of body of the query which in essence reflects the semantics of minimal models in logic programming [EGM97]. In the presence of both kind of constraints, containment checking is performed in two steps: i) First, we expand the query to an equivalent set of subqueries using minimal disjunctive expansion; ii) Second, the containment checking under implication constraints of each subquery is executed. ....
T. Eiter, G. Gottlob, H. Mannila. Disjunctive Datalog. ACM TODS, 1997.
Complexity of Answer Set Checking and Bounded.. - Eiter, Faber.. Self-citation (Eiter) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, 22(3):364--418, 1997.
Eliminating Disjunction from Propositional Logic.. - Eiter, Fink, Tompits, .. (2003) Self-citation (Eiter) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, 22(3):364-417, 1997.
Towards Automated Integration of Guess and Check Programs in.. - Eiter, Polleres (2004) Self-citation (Eiter) (Correct)
No context found.
T. Eiter, G. Gottlob, H. Mannila. Disjunctive datalog. ACM TODS, 22(3):364--418, 1997.
Complexity of Answer Set Checking and Bounded.. - Eiter, Faber.. Self-citation (Eiter) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, 22(3):364--418, 1997.
On the Indiscernibility of Individuals in Logic Programming - Eiter, Gottlob, Leone (1997) Self-citation (Eiter Gottlob) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM Trans. on Database Syst., September 1997.
Efficient Evaluation of Logic Programs for Querying Data .. - Eiter, Fink, Greco.. (2003) Self-citation (Eiter) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive datalog. ACM Trans. on Database Systems, 22(3):364--417, 1997.
On Eliminating Disjunctions in Stable Logic Programming - Eiter (2003) Self-citation (Eiter) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive datalog. ACM TODS, 22(3):364-417, 1997.
Uniform Equivalence of Logic Programs under the Stable Model.. - Eiter, Fink (2003) (2 citations) Self-citation (Eiter) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive datalog. ACM TODS, 22(3):364--417, 1997.
Complexity of Answer Set Checking and Bounded.. - Eiter, Faber.. (2003) Self-citation (Eiter) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, 22(3):364--418, 1997.
A Deductive System for - Non-Monotonic Reasoning Thomas Self-citation (Eiter) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, September 1997. To appear.
Declarative Update Policies for Nonmonotonic Knowledge Bases - Eiter, al. (2002) Self-citation (Eiter) (Correct)
.... We remark that the logic program i , resulting at each step from policy U , consists of a hierarchy of three modules as well, thus its semantics can be obtained by combining the semantics of the modules in a bottom up way (cf. the modularity properties of logic programs as discussed in [25, 17]) The semantics of knowledge states is defined in the usual way, applying tr to the executable command sets U n resulting from U , as U is a usual policy over an extended language; no special semantics is needed. Let us analyze in detail the content of U . The extended alphabet of ....
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive datalog. ACM Trans. on Database Systems, 22(3):364--418, 1997.
Complexity and Expressive Power of Logic Programming - Dantsin, Eiter, Gottlob.. (1997) (42 citations) Self-citation (Eiter Gottlob) (Correct)
....C i and the rules of the meta interpreter PMI (k) which are adapted for a binary encoding of the domain UD(P ) of the database D(P ) by using binary tuples of arity dlog jU D(P ) je. This construction is feasible in logspace, from which DEXPTIME hard program complexity of datalog follows. See [54, 55, 66] for details. 3.4. Complexity of LP with functions Let us see what happens if we allow function symbols in logic programs. In this case, entailment of an atom is no longer decidable. To prove it, we can, for example, reduce Hilbert s Tenth Problem to the query answering in full LP. Natural ....
....by adopting that I is a stable model of a disjunctive logic program P iff I 2 MM(P I ) 111] it subsumes disjunctive stratified semantics. For well founded semantics, no such natural extension is known. Clearly, P I is easily computed, and P I = P if P is negation free. Thus, Theorem 5. 2 ([49, 54, 55]) DLP under SMS is Pi p 2 complete. Disjunctive datalog under SMS is data complete in Pi p 2 and program complete in co NEXPTIME NP . The latter result was derived by utilizing complexity upgrading techniques as described above in Section 3.3. In the case with functions, we have: ....
[Article contains additional citation context not shown here]
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM Trans. on Database Syst., September 1997. To appear.
DLV - A System for Declarative Problem Solving - Eiter, Faber, Koch, Leone.. (2000) Self-citation (Eiter) (Correct)
....1996) where you can also download DLV. This work was supported by FWF (Austrian Science Funds) under the projects P11580 MAT and Z29 INF. Description of the System Kernel Language The kernel language of DLV is disjunctive datalog extended with strong negation under the answer set semantics (Eiter, Gottlob, Mannila 1997; Gelfond Lifschitz 1991) Syntax Strings starting with uppercase letters denote variables, while those starting with lower case letters denote constants. A term is either a variable or a constant. An atom is an expression p(t 1 ; t n ) where p is a predicate of arity n and t 1 , t ....
....while in (Lifschitz 1996) also the inconsistent set of all possible literals is a valid answer set. The Diagnoses Frontend implements both abductive diagnosis (Poole 1989; Console, Theseider Dupr e, Torasso 1991) adapted to the semantics of logic programming (Kakas, Kowalski, Toni 1993; Eiter, Gottlob, Leone 1997), and consistency based diagnosis (Reiter 1987; de Kleer, Mackworth, Reiter 1992) and supports general diagnosis as well as singlefailure and subset minimal diagnosis. The SQL3 Frontend is a prototype implementation of the query interface of the SQL3 standard that has been approved by ISO ....
[Article contains additional citation context not shown here]
Eiter, T.; Gottlob, G.; and Mannila, H. 1997. Disjunctive Datalog. ACM Transactions on Database Systems 22(3):315-363.
Splitting an Operator: Algebraic modularity results for .. - Vennekens, Gilis.. (2005) (2 citations) (Correct)
No context found.
Eiter, T., Gottlob, G., and Mannila, H. 1997. Disjunctive datalog. ACM Transactions on Database Systems (TODS) 22, 364-418.
Solving Hard Disjunctive Logic Programs Faster - Sometimes Gerald Pfeifer (2003) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, 22(3):364-- 418, September 1997.
Aggregate Functions in DLV - Dell'Armi, Faber, Ielpa, Leone.. (2003) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, 22(3):364--418, September 1997.
Improving the Model Generation/Checking Interplay to - Enhance The Evaluation (2004) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, 22(3):364-- 418, September 1997.
Optimal Models of Disjunctive Logic Programs: Semantics.. - Nicola Leone Francesco (2004) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila, "Disjunctive Datalog," ACM Trans. Database Systems, vol. 22, no. 3, pp. 364-418, 1997.
Solving Hard Disjunctive Logic Programs Faster - Sometimes Gerald Pfeifer (2003) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, 22(3):364-- 418, September 1997.
Aggregate Functions in Disjunctive Logic Programming.. - Dell'Armi, al. (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, 22(3):364-418, September 1997.
Aggregate Functions in DLV - Dell'Armi, Faber, Ielpa, Leone.. (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, 22(3):364--418, September 1997.
Aggregate Functions in DLV - Dell'Armi, Faber, Ielpa, Leone.. (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Mannila. Disjunctive Datalog. ACM TODS, 22(3):364--418, September 1997.
Temporal Disjunctive Logic Programming - Gergatsoulis, RONDOGIANNIS (1997) (Correct)
No context found.
) Eiter, T., Gottlob, G. and Mannila, H., "Disjunctive datalog," ACM Transactions on Database Systems, 22(3):364--418, September 1997.
First 50 documents
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