Citation: T. Eiter et al., EXPRESSIVE POWER AND COMPLEXITY OF PARTIAL MODELS FOR DISJUNCTIVE DEDUCTIVE DATABASES, Theoretical computer science, 206(1-2), 1998, pp. 181-218
Citation: T. Eiter et G. Gottlob, ON THE EXPRESSIVENESS OF FRAME SATISFIABILITY AND FRAGMENTS OF 2ND-ORDER LOGIC, The Journal of symbolic logic, 63(1), 1998, pp. 73-82
Citation: T. Eiter et al., ON THE PARTIAL SEMANTICS FOR DISJUNCTIVE DEDUCTIVE DATABASES, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 59-96
Citation: T. Eiter et G. Gottlob, EXPRESSIVENESS OF STABLE MODEL SEMANTICS FOR DISJUNCTIVE LOGIC PROGRAMS WITH FUNCTIONS, The journal of logic programming, 33(2), 1997, pp. 167-178
Citation: Pa. Bonatti et T. Eiter, QUERYING DISJUNCTIVE DATABASES THROUGH NONMONOTONIC LOGICS, Theoretical computer science, 160(1-2), 1996, pp. 321-363
Citation: T. Eiter et al., NORMAL FORMS FOR 2ND-ORDER LOGIC OVER FINITE STRUCTURES, AND CLASSIFICATION OF NP OPTIMIZATION PROBLEMS, Annals of pure and applied Logic, 78(1-3), 1996, pp. 111-125
Citation: T. Eiter et G. Gottlob, THE COMPLEXITY OF NESTED COUNTERFACTUALS AND ITERATED KNOWLEDGE-BASE REVISIONS, Journal of computer and system sciences, 53(3), 1996, pp. 497-512
Citation: T. Eiter et al., RECOGNIZING RENAMABLE GENERALIZED PROPOSITIONAL HORN FORMULAS IS NP-COMPLETE, Discrete applied mathematics, 59(1), 1995, pp. 23-31
Citation: T. Eiter et G. Gottlob, ON THE COMPUTATIONAL COST OF DISJUNCTIVE LOGIC PROGRAMMING - PROPOSITIONAL CASE, Annals of mathematics and artificial intelligence, 15(3-4), 1995, pp. 289-323
Citation: T. Eiter et G. Gottlob, IDENTIFYING THE MINIMAL TRANSVERSALS OF A HYPERGRAPH AND RELATED PROBLEMS, SIAM journal on computing, 24(6), 1995, pp. 1278-1304
Citation: T. Eiter et G. Gottlob, PROPOSITIONAL CIRCUMSCRIPTION AND EXTENDED CLOSED-WORLD REASONING AREPI(P)(2)-COMPLETE (VOL 114, PG 231, 1993), Theoretical computer science, 118(2), 1993, pp. 315-315
Citation: T. Eiter et G. Gottlob, PROPOSITIONAL CIRCUMSCRIPTION AND EXTENDED CLOSED-WORLD REASONING AREPI-P2-COMPLETE, Theoretical computer science, 114(2), 1993, pp. 231-245