T. Eiter, G. Gottlob, and H. Veith. Modular logic programming and generalized quantifiers. In J. Dix, U. Furbach, and A. Nerode, editors, Logic Programming and Nonmonotonic Reasoning, pages 289--308, Dagstuhl Castle, Germany, July 1997. Springer-Verlag. LNAI 1265. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Generalized Quantifiers in Logic Programs - Eiter, Gottlob, Veith (1997) Self-citation (Eiter Gottlob Veith) (Correct)
....of all stable models. 4 Application: Modular Logic Programming In this section, we describe how the formalism of logic programs with generalized quantifiers can be fruitfully applied for defining the semantics of logic programs which refer to program modules. This approach can be found in [16, 17], and we recall the definitions from there. 10 A program module is syntactically described by its interface in terms of input and output parameters. Adapted to the logic programming paradigm, a logic programming module has an interface LP [I; O] where the I = I 1 ; I m are predicates ....
....of Theorem 5.7 is actually also from this class. Corollary 5.9 SCI(LP) Strat(LP) and RF(LP) obey the Stewart Normal Form. Monotone Program Modules. Let us now turn to monotone modules, i.e. programs which define a monotone generalized quantifier. Here, we have the following. Theorem 5. 10 ([17]) Pos(Mon) Mon, i.e. Pos(Mon) captures the class of all monotone coNP queries. The intuitive reason for this result is that any program in Pos(Mon) is monotone, and its evaluation can be defined in terms of a monotone operator [17] Let us now proceed to richer fragments of main programs than ....
[Article contains additional citation context not shown here]
T. Eiter, G. Gottlob, and H. Veith. Modular Logic Programming and Generalized Quantifiers. Technical Report CD-TR 97/111, Christian Doppler Laboratory for Expert Systems, TU Vienna, January 1997. Preliminary Report.
Generalized Quantifiers in Logic Programs - Eiter, Gottlob, Veith (1997) Self-citation (Eiter Gottlob Veith) (Correct)
....quantifiers have also been investigated in the context of fuzzy logic [26] which has become popular in computer science more recently. In this paper, we address another application of generalized quantifiers in computer science; namely, in the field of logic programming. As pointed out in [16], enhancing logic programming by generalized quantifiers provides an elegant and appealing method for handling the following two problems. Firstly, the problem of interfacing external (non logical) functions in a logic program, of which no other information than a semantical description is ....
....of all stable models. 4 Application: Modular Logic Programming In this section, we describe how the formalism of logic programs with generalized quantifiers can be fruitfully applied for defining the semantics of logic programs which refer to program modules. This approach can be found in [16, 17], and we recall the definitions from there. 10 A program module is syntactically described by its interface in terms of input and output parameters. Adapted to the logic programming paradigm, a logic programming module has an interface LP [I; O] where the I = I 1 ; I m are predicates ....
[Article contains additional citation context not shown here]
T. Eiter, G. Gottlob, and H. Veith. Modular Logic Programming and Generalized Quantifiers. In J. Dix, U. Furbach, and A. Nerode, editors, Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-97), number 1265 in LNCS, pages 290--309. Springer, 1997.
Complexity of Nested Circumscription and Nested.. - Cardoli, Eiter, Gottlob (2002) Self-citation (Eiter Gottlob) (Correct)
....other hand, unless PH = PSPACE, a datalog L CIRC formula resp. NAT similar to T I does not exist: due to fixed nesting depth, it can only express a problem in PH. 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 , which is a propositional language that allows the nested use of circumscription, and of the propositional fragment of nested abnormality theories (NATs) that were ....
T. Eiter, G. Gottlob, and H. Veith. Modular logic programming and generalized quantifiers. In J. Dix, U. Furbach, and A. Nerode, editors, Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-97), number 1265 in LNCS, pages 290--309. Springer, 1997.
Complexity and Expressive Power of Logic Programming - Dantsin, Eiter, Gottlob.. (1997) (42 citations) Self-citation (Eiter Gottlob) (Correct)
....LP under SMS, and full DLP under SMS all express Pi 1 1 . For further expressiveness results, see e.g. 119, 114, 115, 57] In particular, further classes of 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 problem leads us to the problem of solving equations over terms, known as the unification problem. Unification lies in the very heart of implementations of LP ....
T. Eiter, G. Gottlob, and H. Veith. Modular Logic Programming and Generalized Quantifiers. In Proc. LPNMR-97, 1997. To appear. Extended paper CD-TR 97/111, Information Systems Department, TU Vienna, 1997.
Linear Time Datalog for Branching Time Logic - Gottlob, Grädel, Veith Self-citation (Gottlob Veith) (Correct)
....logic There are several interesting questions related to Datalog LITE we are currently studying. One is to find suitable extension of this language to express CTL and LTL. It seems that this can be done by adding very few new primitives along the lines of a general approach to extending Datalog [Eiter et al. 1997]. Another interesting issue currently under investigation is the relationship between Datalog LITE and automata, and more general, Datalog and tree automata. ....
Eiter, T., Gottlob, G., and Veith, H. (1997). Modular logic programming and generalized quantifiers. In LPNMR'97, volume 1265 of LNCS, pages 290--309. Springer.
Datalog LITE: Temporal versus deductive reasoning in.. - Gottlob, Grädel, Veith (1998) (6 citations) Self-citation (Gottlob Veith) (Correct)
....There are several interesting questions related to Datalog LITE we are currently studying. One is to find suitable extension of this language to express CTL and LTL. It seems that this can be done by adding very few new primitives along the lines of a general approach to extending Datalog [17]. Another interesting issue currently under investigation is the relationship between Datalog LITE and automata, and more general, Datalog and tree automata. Related work It is not new that CTL, the modal calculus and related formalisms can be translated into logic programming. Such translations ....
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.
Capturing Parallel Circumscription with Disjunctive Logic.. - Janhunen, Oikarinen (2004) (Correct)
No context found.
T. Eiter, G. Gottlob, and H. Veith. Modular logic programming and generalized quantifiers. In J. Dix, U. Furbach, and A. Nerode, editors, Logic Programming and Nonmonotonic Reasoning, pages 289--308, Dagstuhl Castle, Germany, July 1997. Springer-Verlag. LNAI 1265.
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