Thomas Eiter, Georg Gottlob, Helmut Veith  Home/Search
Context Related
| kr.tuwien.ac.at/sta...lpnmr97mlp.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: kr.tuwien.ac.at/staff/eiter/et... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The research on systems of logic programming with modules has followed two mainstreams, programming-in-the-large, where compositional operators are provided for combining separate and independent modules, and programming-in-the-small, which aims at enhancing logic programming with new logical connectives. (Update)
Context of citations to this paper: More
.... the polynomial hierarchy can be captured by variants of stable models [115, 114, 57, 23] as well as through modular logic programming [56]. 7. Unification and its complexity What is the complexity of query answering for very simple logic programs consisting of one fact This...
...Further relationships between L CIRC resp. NATs and curbing, as well as other expressive knowledge representation formalisms (e.g. [4, 21, 41]) remain to be explored. 8 Conclusion In this paper, we have studied the computational complexity of the logical language L CIRC ,...
Cited by: More
Capturing Parallel Circumscription with Disjunctive Logic.. - Janhunen, Oikarinen (2004) (Correct)
Generalized Quantifiers in Logic Programs - Eiter, Gottlob, Veith (1997) (Correct)
Complexity of Nested Circumscription and Nested.. - Cardoli, Eiter, Gottlob (2002) (Correct)
Similar documents (at the sentence level):
29.1%: Modular Logic Programming and Generalized Quantifiers - Eiter, Gottlob, Veith (1997) (Correct)
Active bibliography (related documents): More All
0.4: Logical Characterizations of Complexity Classes - Stewart (1997) (Correct)
0.4: Oracles and Quantifiers - Makowsky, Pnueli (1994) (Correct)
0.3: Capturing Complexity Classes with Lindström Quantifiers - Makowsky (1994) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
0.5: Le Mont-Saint-Michel, France, 1997. Also appeared in.. - Design Stanford Markus (Correct)
0.5: Complexity and Expressive Power of Logic Programming - Dantsin, Eiter, Gottlob.. (1997) (Correct)
0.5: Publication List 1998 - Informationssysteme, Wien (1998) (Correct)
Related documents from co-citation: More All
4: Perspectives in Mathematical Logic (context) - Ebbinghaus, Flum et al. - 1995
4: Logical characterizations of bounded query classes I: Logspace oracle machines (context) - Stewart - 1993
3: The Expressive Powers of Logic Programming Semantics (context) - Schlipf - 1995
BibTeX entry: (Update)
T. Eiter, G. Gottlob, and H. Veith, Modular logic programming and generalized quantifiers, in LPNMR'97, vol. 1265 of LNCS, Springer, 1997, pp. 290--309. http://citeseer.ist.psu.edu/article/eiter97modular.html More
@inproceedings{ eiter97modular,
author = "Thomas Eiter and Georg Gottlob and Helmut Veith",
title = "Modular Logic Programming and Generalized Quantifiers",
booktitle = "Logic Programming and Non-monotonic Reasoning",
pages = "290-309",
year = "1997",
url = "citeseer.ist.psu.edu/article/eiter97modular.html" }
Citations (may not include all citations):4212 Computers and Intractability -- A Guide to the Theory of NP-.. (context) - Garey, Johnson - 1979
1838 Foundations of Logic Programming (context) - Lloyd - 1984
951 Computational Complexity (context) - Papadimitriou - 1994
858 The Stable Model Semantics for Logic Programming - Gelfond, Lifschitz - 1988
435 Towards a Theory of Declarative Knowledge (context) - Apt, Blair et al.
99 A Classification Theory of Semantics of Normal Logic Program.. - Dix - 1995
99 A Classification Theory of Semantics of Normal Logic Program.. - Dix - 1995
82 Semantics of Logic Programs: Their Intuitions and Formal Pro.. - Dix - 1995
67 Foundations of Deductive Databases and Logic Programming (context) - Minker - 1988
61 The Expressive Powers of Logic Programming Semantics (context) - Schlipf - 1995
56 Modularity in Logic Programming - Bugliesi, Lamma et al. - 1994
50 Update by Means of Inference Rules - Przymusi'nski, Turner - 1995
42 Fully Abstract Compositional Semantics for Logic Programs (context) - Gaifman, Shapiro - 1989
39 An Algebra of Logic Programs (context) - Mancarella, Pedreschi - 1988
38 Abduction From Logic Programs: Semantics and Complexity - Eiter, Gottlob et al.
36 A Theory of Modules in Logic Programming (context) - Miller - 1986
34 Adding Disjunction to Datalog (context) - Eiter, Gottlob et al. - 1994
33 Linguistic and Philosophy (context) - Barwise, Cooper et al. - 1981
32 First Order Predicate Logic with Generalized Quantifiers (context) - Lindstrom - 1966
28 Logical Characterizations of Bounded Query Classes II: Logsp.. (context) - Stewart - 1993
28 Logical Characterizations of Bounded Query Classes I: Logspa.. (context) - Stewart - 1993
25 database updates and integrity constraints (context) - Marek, Truszczy'nski - 1995
25 a Generalization of Quantifiers (context) - Mostowski - 1957
21 the Declarative and Procedural Semantics of Stratified Deduc.. (context) - Przymusinski
21 Relativized Logspace and Generalized Quantifiers over Finite.. - Gottlob - 1995
17 Some Remarks on Infinitely Long Formulas (context) - Henkin - 1961
14 Revision specifications by means of revision programs (context) - Marek, Truszczy'nski - 1994
13 Structuring Logic Programs: A Modal Approach (context) - Giordano, Martelli - 1994
12 Improving SQL with Generalized Quantifiers (context) - Hsu, Parker - 1995
9 Towards an Algebra for Constructing Logic Programs (context) - O'Keefe - 1985
8 This article was processed using the L A T E X macro package.. (context) - Wagner, Classes et al. - 1990
7 Deterministic and Nondeterministic Stable Model Semantics fo.. - Sacc'a - 1995
7 Expressiveness of Stable Model Semantics for Disjunctive Log.. (context) - Eiter, Gottlob
6 Query languages with generalized quantifiers (context) - Badia, Gyssens et al. - 1995
5 Capturing Relativized Complexity Classes without Order - Dawar, Gottlob et al. - 1996
4 Logic and Computation (context) - Dawar, Logical - 1995
2 Logic Programming: Modularity and Revision (context) - Eiter, Gottlob et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.kr.tuwien.ac.at/staff/eiter/et-archive/): More
On the Difference of Horn Theories (Extended Abstract) - Eiter, Ibaraki, Makino (Correct)
Complexity of Nested Circumscription and Abnormality Theories - Cadoli (2001) (Correct)
Complexity and Expressive Power of Logic Programming - Dantsin, Eiter, Gottlob.. (1997) (Correct)
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