## Modular Logic Programming and Generalized Quantifiers (1997)

Venue: | PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR-97), NUMBER 1265 IN LNCS |

Citations: | 37 - 13 self |

### BibTeX

@INPROCEEDINGS{Eiter97modularlogic,

author = {Thomas Eiter and Georg Gottlob and Helmut Veith},

title = {Modular Logic Programming and Generalized Quantifiers},

booktitle = {PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING AND NONMONOTONIC REASONING (LPNMR-97), NUMBER 1265 IN LNCS},

year = {1997},

pages = {290--309},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### 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. In this paper, we present

### Citations

11502 |
Computers and Intractability: A Guide to the Theory of NPCompleteness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ... work, apart from a brief comment to expressiveness over the integers. We assume some familiarity with the basic concepts of complexity theory, in particular of the polynomial hierarchy (PH). Consult =-=[15, 30]-=- for an introduction. Intertwined with the levels of PH are the classes \Theta p k = P \Sigma p k k [37], where \Sigma p k ` \Theta p k+1 ` \Sigma p k+1 . Let M be a semantics, let C be a complexity c... |

2429 | Computational complexity
- Papadimitriou
- 1994
(Show Context)
Citation Context ... work, apart from a brief comment to expressiveness over the integers. We assume some familiarity with the basic concepts of complexity theory, in particular of the polynomial hierarchy (PH). Consult =-=[15, 30]-=- for an introduction. Intertwined with the levels of PH are the classes \Theta p k = P \Sigma p k k [37], where \Sigma p k ` \Theta p k+1 ` \Sigma p k+1 . Let M be a semantics, let C be a complexity c... |

1922 |
Foundations of Logic Programming
- Lloyd
- 1988
(Show Context)
Citation Context ...e paper with a brief discussion of related approaches and an outlook to further work. 2 Preliminaries We assume that the reader is familiar with the concepts and terminology of logic programming; see =-=[22]-=- for background. P denotes a logic program, letters Q; R; : : : denote predicates, lower case letters x; y; z variables, a; b; c; : : : constants and f; g : : : functions. The bold face version R of a... |

1559 | The stable model semantics for logic programming
- Gelfond, Lifschitz
- 1988
(Show Context)
Citation Context ...ses of programs, in particular for stratified programs and for positive programs using monotone GQs, however, an intuitive extension seems possible. Starting from scratch, we propose in the spirit of =-=[16]-=- the concept of GQ stable model, which serves to select the preferred models among the models of a logic program with GQs. 3.1 Syntax The syntax of a logic program with GQs (GQLP) is like the syntax o... |

634 |
Towards a theory of declarative knowledge
- Apt, Blair, et al.
- 1988
(Show Context)
Citation Context ... following postulate: A semantics M must extend the semantics of stratified logic programs, i.e., for every stratified logic program P , MP = M str P , where M str P is the stratified model semantics =-=[1, 31]-=-. A number of other properties of semantics are desirable, e.g. relevance and modularity; see [9, 7, 8]. Generalized Quantifiers The extension of first-oder logic by generalized quantifiers (GQs) was ... |

272 |
Generalized quantifiers and natural language
- Barwise, Cooper
- 1981
(Show Context)
Citation Context ...s [19], which have been studied extensively in logic. Generalized quantifiers have applications in various areas including linguistics, finite model theory, Artificial Intelligence and databases, cf. =-=[3, 5, 2, 20]-=-. For this reason, we believe that this extension of logic programming has high potential for applications beyond modular logic programming, which originally has driven this research on generalized qu... |

213 | Disjunctive Datalog
- Eiter, Gottlob, et al.
- 1997
(Show Context)
Citation Context ...dered finite structures, which provide an enumeration of the domain A in a designated relation. The expressive power of ordinary logic programming over finite structures has been investigated e.g. in =-=[34, 11, 33]-=-; as shown in [34], LP captures coNP. Table 2 compactly lists the expressivity results that we derive in the full paper, based on the stable model semantics M st . Here, Mon are the programs defining ... |

133 |
Bounded Query Classes
- Wagner
- 1990
(Show Context)
Citation Context ...asic concepts of complexity theory, in particular of the polynomial hierarchy (PH). Consult [15, 30] for an introduction. Intertwined with the levels of PH are the classes \Theta p k = P \Sigma p k k =-=[37]-=-, where \Sigma p k ` \Theta p k+1 ` \Sigma p k+1 . Let M be a semantics, let C be a complexity class, and let K be a class of finite structures over a relational signatures. We say that M has expressi... |

87 |
First order predicate logic with generalized quantifiers, Theoria 32
- Lindström
- 1966
(Show Context)
Citation Context ... graph G 1 is not 3colorable and the graph G 2 is 3-colorable, then Diff TC is assigned the difference of the transitive closures of G 2 and G 1 ; otherwise, Diff TC is empty. Generalized quantifiers =-=[28, 21]-=- have been conceived as devices for expressing higher order properties which are not first-order definable. Enriching a firstorder language by such quantifiers allows to increase its expressive capabi... |

85 | Modularity in logic programming
- Bugliesi, Lamma, et al.
- 1994
(Show Context)
Citation Context ...ssibility to define subprograms along with scoping and abstraction mechanisms. This need has initiated a large number of investigations, which evolved into the area of modular logic programming, e.g. =-=[26, 29, 23, 14, 17, 4]-=-; see [4] for a comprehensive survey. The research on systems of logic program modules has followed two mainstreams [4]. The one is programming-in-the-large, where compositional operators are provided... |

85 | The expressive powers of the logic programming semantics
- Schlipf
- 1995
(Show Context)
Citation Context ...dered finite structures, which provide an enumeration of the domain A in a designated relation. The expressive power of ordinary logic programming over finite structures has been investigated e.g. in =-=[34, 11, 33]-=-; as shown in [34], LP captures coNP. Table 2 compactly lists the expressivity results that we derive in the full paper, based on the stable model semantics M st . Here, Mon are the programs defining ... |

75 |
On a generalization of quantifiers
- Mostowski
- 1957
(Show Context)
Citation Context ... graph G 1 is not 3colorable and the graph G 2 is 3-colorable, then Diff TC is assigned the difference of the transitive closures of G 2 and G 1 ; otherwise, Diff TC is empty. Generalized quantifiers =-=[28, 21]-=- have been conceived as devices for expressing higher order properties which are not first-order definable. Enriching a firstorder language by such quantifiers allows to increase its expressive capabi... |

73 | Semantics of Logic Programs: Their Intuitions and Formal Properties. An O.verview
- Dix
- 1995
(Show Context)
Citation Context ... every stratified logic program P , MP = M str P , where M str P is the stratified model semantics [1, 31]. A number of other properties of semantics are desirable, e.g. relevance and modularity; see =-=[9, 7, 8]-=-. Generalized Quantifiers The extension of first-oder logic by generalized quantifiers (GQs) was studied in depth in the seminal work by Lindstrom [21]; particular GQs, e.g. Henkin quantifiers [19], h... |

59 | A classification theory of semantics of normal logic programs: II. weak properties
- Dix
- 1995
(Show Context)
Citation Context ... every stratified logic program P , MP = M str P , where M str P is the stratified model semantics [1, 31]. A number of other properties of semantics are desirable, e.g. relevance and modularity; see =-=[9, 7, 8]-=-. Generalized Quantifiers The extension of first-oder logic by generalized quantifiers (GQs) was studied in depth in the seminal work by Lindstrom [21]; particular GQs, e.g. Henkin quantifiers [19], h... |

59 |
Some Remarks on Infinitely Long Formulas
- Henkin
- 1961
(Show Context)
Citation Context ...expressible, which suggests to enrich first-order logic by a generalized quantifier for transitive closure. Another well-known example of generalized quantifiers are Henkin (or branching) quantifiers =-=[19]-=-, which have been studied extensively in logic. Generalized quantifiers have applications in various areas including linguistics, finite model theory, Artificial Intelligence and databases, cf. [3, 5,... |

57 |
E.: Fully Abstract Compositional Semantics for Logic Programs
- Gaifman, Shapiro
- 1989
(Show Context)
Citation Context ...ssibility to define subprograms along with scoping and abstraction mechanisms. This need has initiated a large number of investigations, which evolved into the area of modular logic programming, e.g. =-=[26, 29, 23, 14, 17, 4]-=-; see [4] for a comprehensive survey. The research on systems of logic program modules has followed two mainstreams [4]. The one is programming-in-the-large, where compositional operators are provided... |

53 | Update by means of inference rules
- Przymusinski, Turner
- 1997
(Show Context)
Citation Context ...son to related work will be given in the full paper. A lot of interesting topics remains to be addressed; these issues are part of our current research. -- Revision logic programming as introduced in =-=[24, 25, 32]-=- can be easily incorporated in subprograms [13]; thus a logic program can do counterfactual reasoning about logic programs. -- Since disjunctive logic programming is as expressive as modular logic pro... |

46 |
Towards an Algebra for Constructing Logic Programs
- O'Keefe
- 1985
(Show Context)
Citation Context ...ssibility to define subprograms along with scoping and abstraction mechanisms. This need has initiated a large number of investigations, which evolved into the area of modular logic programming, e.g. =-=[26, 29, 23, 14, 17, 4]-=-; see [4] for a comprehensive survey. The research on systems of logic program modules has followed two mainstreams [4]. The one is programming-in-the-large, where compositional operators are provided... |

44 |
An Algebra of Logic Programs
- Mancarella, Pedreschi
- 1988
(Show Context)
Citation Context |

43 | A theory of modules for logic programming
- Miller
- 1986
(Show Context)
Citation Context |

30 |
Generalized quantifiers and logical reducibilities
- Dawar
- 1995
(Show Context)
Citation Context ...s [19], which have been studied extensively in logic. Generalized quantifiers have applications in various areas including linguistics, finite model theory, Artificial Intelligence and databases, cf. =-=[3, 5, 2, 20]-=-. For this reason, we believe that this extension of logic programming has high potential for applications beyond modular logic programming, which originally has driven this research on generalized qu... |

30 |
M.: Revision programming, database updates and integrity constraints
- Marek, Truszcińsky
- 1995
(Show Context)
Citation Context ...son to related work will be given in the full paper. A lot of interesting topics remains to be addressed; these issues are part of our current research. -- Revision logic programming as introduced in =-=[24, 25, 32]-=- can be easily incorporated in subprograms [13]; thus a logic program can do counterfactual reasoning about logic programs. -- Since disjunctive logic programming is as expressive as modular logic pro... |

26 | Deterministic and Non-Deterministic Stable Models
- Saccà, Zaniolo
- 1997
(Show Context)
Citation Context ...dered finite structures, which provide an enumeration of the domain A in a designated relation. The expressive power of ordinary logic programming over finite structures has been investigated e.g. in =-=[34, 11, 33]-=-; as shown in [34], LP captures coNP. Table 2 compactly lists the expressivity results that we derive in the full paper, based on the stable model semantics M st . Here, Mon are the programs defining ... |

25 | Relativized logspace and generalized quantifiers over finite ordered structures
- Gottlob
- 1997
(Show Context)
Citation Context ...time. Hence, it lies in P NP k . Since P NP k = \Theta p 2 , query evaluation is in \Theta p 2 . For expressiveness, we make use of the Stewart Normal Form, introduced in [35, 36], and generalized in =-=[18]-=-. It states that, on ordered finite structures, every \Theta p 2 relation is definable by an existential first order formula with generalized quantifiers of the following form: 9x:P 1 [Q](x; y)sP 2 [Q... |

22 |
On the declarative and procedural semantics of stratified deductive databases
- Przymusinski
- 1988
(Show Context)
Citation Context ... following postulate: A semantics M must extend the semantics of stratified logic programs, i.e., for every stratified logic program P , MP = M str P , where M str P is the stratified model semantics =-=[1, 31]-=-. A number of other properties of semantics are desirable, e.g. relevance and modularity; see [9, 7, 8]. Generalized Quantifiers The extension of first-oder logic by generalized quantifiers (GQs) was ... |

21 |
Improving SQL with Generalized Quantifiers
- Hsu, Parker
- 1997
(Show Context)
Citation Context ...s [19], which have been studied extensively in logic. Generalized quantifiers have applications in various areas including linguistics, finite model theory, Artificial Intelligence and databases, cf. =-=[3, 5, 2, 20]-=-. For this reason, we believe that this extension of logic programming has high potential for applications beyond modular logic programming, which originally has driven this research on generalized qu... |

16 |
Structuring logic programs: A modal approach
- Giordano, Martelli
- 1994
(Show Context)
Citation Context |

15 |
Expressiveness of stable model semantics for disjunctive logic programs with functions
- Eiter, Gottlob
- 1997
(Show Context)
Citation Context ...ular logic programming can be translated into disjunctive logic programming and vice versa. However, such translations are only available as long as finite structures are concerned. As shown recently =-=[12]-=-, over infinite Herbrand models resp. the integers, DLP under the stable semantics can express precisely all \Pi 1 1 definable relations, and has the same expressive power as normal logic programming ... |

14 |
Logical characterizations of bounded query classes II: polynomialtime oracle machines, Fundamenta Informaticae 18
- Stewart
- 1993
(Show Context)
Citation Context ... that possible in polynomial time. Hence, it lies in P NP k . Since P NP k = \Theta p 2 , query evaluation is in \Theta p 2 . For expressiveness, we make use of the Stewart Normal Form, introduced in =-=[35, 36]-=-, and generalized in [18]. It states that, on ordered finite structures, every \Theta p 2 relation is definable by an existential first order formula with generalized quantifiers of the following form... |

12 |
Logical Characterizations of Bounded Query Classes I: Logspace oracle machines
- Stewart
- 1993
(Show Context)
Citation Context ... that possible in polynomial time. Hence, it lies in P NP k . Since P NP k = \Theta p 2 , query evaluation is in \Theta p 2 . For expressiveness, we make use of the Stewart Normal Form, introduced in =-=[35, 36]-=-, and generalized in [18]. It states that, on ordered finite structures, every \Theta p 2 relation is definable by an existential first order formula with generalized quantifiers of the following form... |

10 |
Revision specifications by means of revision programs
- Marek, Truszczy'nski
- 1994
(Show Context)
Citation Context ...son to related work will be given in the full paper. A lot of interesting topics remains to be addressed; these issues are part of our current research. -- Revision logic programming as introduced in =-=[24, 25, 32]-=- can be easily incorporated in subprograms [13]; thus a logic program can do counterfactual reasoning about logic programs. -- Since disjunctive logic programming is as expressive as modular logic pro... |

8 |
An implementation of a query language with generalized quantifiers
- Badia, Debes, et al.
- 2008
(Show Context)
Citation Context |

6 | Capturing Relativized Complexity Classes without Order
- Dawar, Gottlob, et al.
- 1998
(Show Context)
Citation Context ...ablishes capturing over ordered finite structures. Note that capturing of \Theta p 2 over all finite structures is not possible unless some strongly believed hypotheses of complexity theory are false =-=[6]-=-. The results also indicate the possibility of intertranslations between different classes C 1 and C 2 of modular programs. If C 1 has a complexity C 1 and C 2 captures C 2 , then C 1 is translatable ... |

2 |
Logic Programming: Modularity and Revision
- Eiter, Gottlob, et al.
- 1996
(Show Context)
Citation Context ...lot of interesting topics remains to be addressed; these issues are part of our current research. -- Revision logic programming as introduced in [24, 25, 32] can be easily incorporated in subprograms =-=[13]-=-; thus a logic program can do counterfactual reasoning about logic programs. -- Since disjunctive logic programming is as expressive as modular logic programming over finite domains, the feasibility o... |