Articles in Journals and Periodicals
There are currently 71 articles in the database:2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1991 | 1990 | 1989 | 1988 | 1987 | 1986 | 1985 |
2005
Marco Cadoli, Thomas Eiter, Georg Gottlob. Complexity of propositional nested circumscription and nested abnormality theories. ACM Transactions on Computational Logic (TOCL), Volume 6(2): 232-2722004
G. Gottlob, Ph.G. Kolaitis, Th. Schwentick. Existential Second-Order Logic over Graphs: Charting the Tractability Frontier. Journal of the ACM 51(2): 312-362, 2004G. Gottlob and C. Koch. Monadic Datalog and the Expressive Power of Languages for Web Information Extraction. Journal of the ACM 51(1): 74-113, 2004
2003
G. Gottlob, Ch. Koch, and R. Pichler. XPath Processing in a Nutshell. ACM SIGMOD Record 32(1): pp. 12-19, 2003G. Gottlob, N. Leone, and F. Scarcello. Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. Journal of Computer and System Sciences 66(4): 775-808, 2003
G. Gottlob, Ch. Papadimitriou. On the Complexity of Single-Rule Datalog Queries. Information and Computation 183:1, pp104-122, 2003
Th. Eiter, G. Gottlob, and K. Makino. New Results on Monotone Dualization and Generating Hypergraph Transversals. SIAM Journal on Computing 32(2):514-537, 2003
2002
G. Gottlob, N. Leone, and F. Scarcello. Computing LOGCFL Certificates. Theoretical Computer Science, 270(1-2), pp. 761-777, 2002G. Gottlob, F. Scarcello, M. Sideri. Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. Artificial Intelligence 138:(1-2):55-86 2002
G. Gottlob, N. Leone, and F. Scarcello. Hypertree Decompositions and Tractable queries. Journal of Computer and System Sciences 64(3): 579-627 (2002)
G. Gottlob, E. Grädel, H. Veith. Datalog Lite: A Deductive Query Language with Linear Time Model Checking. ACM Transactions on Computational Logic 3:1 pp42-79, 2002
R. Baumgartner, G. Gottlob. Propositional Default Logics Made Easier: Computational Complexity of Model Checking. Theoretical Computer Science 289(1): 591-627, 2002
M. Cadoli, Th. Eiter, and G. Gottlob. Complexity of Nested Circumscription and Nested Abnormality Theories. ACM Transactions on Computational Logic, to appear
2001
E. Dantsin, Th. Eiter, G. Gottlob, and A. Voronkov. Complexity and Expressive Power of Logic Programming. ACM Computing Surveys 33(3):374-425 (2001)F. Buccafurri, Th. Eiter, G. Gottlob, and N. Leone. On ACTL Formulas Having Linear Counterexamples. Journal of Computer and System Sciences 62(3), pp. 463-515 2001
G. Gottlob, R. Pichler. Working with Arms: Complexity Results on Atomic Representations of Herbrand Models. Information and Computation, 165:2 pp. 183-207, 2001
G. Gottlob, N. Leone, F. Scarcello. The Complexity of Acyclic Conjunctive Queries. Journal of the ACM, 48:3, pp431-498, 2001
G. Gottlob, R. Pichler. Hypergraphs in Model Checking: Acyclicity in Hypertree-Width versus Clique-Width. SIAM Journal on Computing, to appear
2000
Thomas Eiter, Georg Gottlob. Complexity Results for some Eigenvector Problems. International Journal of Computer Mathematics, Vol 76, pp. 59-74, 2000Th. Eiter, G. Gottlob, and Y. Gurevich. Existential Second Order Logic Over strings. Journal of the ACM 47:1, pp. 77-131, 2000
G. Gottlob, N. Leone, and F. Scarcello. A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence 124:2, pp. 243-282, 2000
1999
G. Gottlob, N. Leone, and H. Veith. Succinctness as a Source of Complexity in Logical Formalisms. Annals of Pure and Applied Logic 97(1- 3): 231-260 1999F. Buccafurri, Th. Eiter, G. Gottlob, and N. Leone. Enhancing Model Checking and Verification by AI Techniques. Artificial Intelligence 112(1-2), pp. 57-104, 1999
1998
Th. Eiter, G. Gottlob. On the Expressiveness of Frame Satisfiability and Fragments of Second Order Logic. Journal of Symbolic Logic, vol 63, nr. 1, 1998, pp. 73-821997
G. Brewka and G. Gottlob. Well-Founded Semantics for Default Logic. Fundamenta Informaticae vol 31, nrs. 3/4, 1997, pp 221-236M. Cadoli, Th. Eiter, and G. Gottlob. Using Default Logic as a Query Language. IEEE Transactions on Knowledge and Data Engineering, 9(3), pp. 448-463, 1997
G. Gottlob. Relativized Logspace and Generalized Quantifiers over Ordered Finite Structures. Journal of Symbolic Logic Vol. 62:2, June 1997, pp. 545-574
Thomas Eiter, Georg Gottlob, and Heikki Mannila. Disjunctive Datalog. ACM Transactions on Database Systems, 22(3), Sept. 1997, pp. 364-418
Th. Eiter, G. Gottlob, and N. Leone. Abduction From Logic Programs: Semantics and Complexity. Theoretical Computer Science 189(1-2) December 1997, pp129-177
Thomas Eiter, Georg Gottlob, and Nicola Leone. Semantics and Complexity for Abduction from Default Theories. Artificial Intelligence, Vol. 90(1-2), pp177-222, 1997
Th. Eiter, G. Gottlob. Expressiveness of Stable Model semantics for Disjunctive Logic Programs with Functions. The Journal of Logic Programming, 33(2), 1997, pp. 167-178
Thomas Eiter, Georg Gottlob, and Nicola Leone. On the Indiscernibility of Individuals in Logic Programming. The Journal of Logic and Computation 7:6, December 1997, pp. 805-824
1996
G. Gottlob and M. Truszcynski. Approximating Stable Models is Hard. Fundamenta Informaticae. Vol. 28(1,2), 1996, pp. 123-128Thomas Eiter, Georg Gottlob, and Yuri Gurevich. Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems. Annals of Pure and Applied Logic, vol. 78, pp. 111-125, 1996
G. Gottlob, M. Schre, and B. Röck. Extending Object-Oriented Systems with Roles. ACM Transactions on Information Systems, vol. 14, No. 3, July 1996
G. Gottlob, Sh. Marcus, A. Nerode, G. Salzer, and V.S. Subrahmanian. Non-Ground Realization of the Stable and Well-Founded Semantics. Theoretical Computer Science,vol166 nr. 1&2, pp. 221-262, 1996
J. Dix, G. Gottlob, and V. Marek. Reducing Disjunctive to Nondisjunctive Semantics by Shift Operations. Fundamenta Informaticae. Vol. 28(1,2), pp. 87-100, 1996
Th. Eiter, G. Gottlob. Mächtigkeit von Logikprogrammierung über Datenbanken. Künstliche Intelligenz 3/96, pp. 32-39
1995
Th. Eiter and G. Gottlob. On the Computational Cost of Disjunctive Logic Programming: Propositional Case. Annals of Mathematics and Artificial Intelligence 15:289-323, 1995G. Gottlob. The Complexity of Default Reasoning under the Stationary Fixed Point Semantics. Information and Computation, 121(1):81-92, August 1995
Thomas Eiter and Georg Gottlob. The Complexity of Logic-Based Abduction. Journal of the ACM, 42(1):3-42, January 1995
Thomas Eiter and Georg Gottlob. Identifying the Minimal Transversals of a Hypergraph and Related Problems. SIAM Journal on Computing, 24(6), Dec. 1995, pp. 1278-1304
Georg Gottlob. Translating default Logic into Standard Autoepistemic Logic. Journal of the ACM, 42(4):711-740, July 1995
Georg Gottlob. NP Trees and Carnap's Modal Logic. Journal of the ACM, 42(2):421-457, March 1995
1994
G. Gottlob and Zhang Mingyi. Cumulative Default Logic: Finite Characterization, Algorithms, and Complexity. Artificial Intelligence, 69:329-345, 1994G. Friedrich, G. Gottlob, and W. Nejdl. Formalizing the repair process - extended report. Annals of Mathematics and Artificial Intelligence, 11(1-4):187-201, 1994
1993
G. Gottlob and Ch. Fermueller. Removing redundancy from a clause. Artificial Intelligence, 61:263-289, 1993Th. Eiter and G. Gottlob. Propositional circumscription and extended closed world reasoning are ?(P, 2)-complete. Theoretical Computer Science, 114(2):231-245, 1993. Addendum 118:315
Thomas Eiter and Georg Gottlob. The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions. Journal of Computer and System Sciences, 53:3, pp. 497-512
1992
Th. Eiter and G. Gottlob. Reasoning with Parsimonious and Moderately Grounded Expansions. Fundamenta Informaticae, 17:31-53, 1992G. Gottlob, M. Schre, and M. Stumptner. On selective inheritance of attribute values in relational databases. Discrete Applied Mathematics, 40:187-216, 1992
Th. Eiter and G. Gottlob. On the complexity of propositional knowledge base revision, updates and counterfactuals. Artificial Intelligence, 57:227-270, 1992. Extended version of [118]
M. Cadoli, Th. Eiter, and G. Gottlob. An efficient method for eliminating varying predicates from a circumscription. Artificial Intelligence, 54:397-410, 1992
G. Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2(3):397-425, june 1992
1991
S. Ceri, G. Gottlob, and L. Tanca. DATALOG: un Tutorial. Rivista di Informatica 21(3):215-252, 19911990
G. Friedrich, G. Gottlob, and W. Nejdl. Generating efficient diagnostic procedures from model based knowledge using logic programming techniques. Computers and Mathematics with Applications, 20(9/10):57-72, 1990G. Gottlob and L.Libkin. Investigations on Armstrong relations, dependency inference, and excluded functional dependencies. Acta Cybernetica, 9(4):385-402, 1990
1989
S. Ceri, G. Gottlob, and G. Wiederhold. Efficient database access from Prolog. IEEE Transactions on Software Engineering, 15(2):153-164, February 1989S. Ceri, G. Gottlob, and L Tanca. What you always wanted to know about datalog (and never dared to ask). IEEE Transactions on Knowledge and Data Engineering, 1(1), March 1989
S. Ceri, G. Gottlob, L. Tanca, and G. Wiederhold. Magic semi-joins. Information Processing Letters, 33(2):97-108, 1989
1988
G. Gottlob, P. Paolini, and R. Zicari. Properties and update semantics of consistent views. ACM Transactions on Database Systems, 13(4):486-524, December 1988Anuj Dawar, Georg Gottlob, and Lauri Hella. Capturing Relativized Complexity Classes without Order. Mathematical Logic Quarterly, 44(1998), pp109-122, 1988
E. Albino, G. Gottlob, and G. Dettori. A multiple answer Prolog system for decomposing a data base into Boyce Codd normal form. International Journal on Policy and Information, 12:53-74, 1988
1987
G. Gottlob. On the size of nonredundant FD-covers. Information Processing Letters, 24:355-360, April 1987G. Gottlob. Subsumption and implication. Subsumption and implication. Information Processing Letters, 24:109-111, January 1987
1986
S. Ceri and G. Gottlob. Optimizing joins between two partitioned relations in distributed databases. The Journal of Parallel and Distributed Computing, 3:183-205, 1986S. Ceri, G. Gottlob, and G. Pelagatti. Taxonomy and formal properies of distributed joins. Information Systems, 11(1):25-40, March 1986
S. Ceri and G. Gottlob. Normalization of relations and Prolog. Communications of the ACM, 29(6):524-544, June 1986
G. Gottlob, A. Leitsch, and W. Schimanovich. Automatisches Beweisen: Methoden und Implementation. Österreichische Zeitschrift für Statistik und Informatik, 16:35-55, 1986
1985
S. Ceri and G. Gottlob. Translating SQL into relational algebra: Optimization, semantics and equivalence of SQL queries. IEEE Transactions on Software Engineering, 11(4):324-345, April 1985G. Gottlob and A. Leitsch. On the efficiency of subsumption algorithms. Journal of the ACM, 32(2):280-295, April 1985