Modular Logic Programming and Generalized Quantifiers

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.

[1]  Georg Gottlob,et al.  Expressiveness of Stable Model Semantics for Disjuncitve Logic Programs with Functions , 1997, J. Log. Program..

[2]  A. Mostowski.  On a generalization of quantifiers , 1957 .

[3]  Anuj Dawar.  Generalized Quantifiers and Logical Reducibilities , 1995, J. Log. Comput..

[4]  Antonio Badia,et al.  Querying with Generalized Quantifiers , 1993, Workshop on Programming with Logic Databases , ILPS.

[5]  Georg Gottlob,et al.  Capturing Relativized Complexity Classes without Order , 1998, Math. Log. Q..

[6]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[7]  Georg Gottlob,et al.  Abduction from Logic Programs: Semantics and Complexity , 1997, Theor. Comput. Sci..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Victor W. Marek,et al.  Revision Programming, Database Updates and Integrity Constraints , 1995, ICDT.

[10]  Ping-Yu Hsu,et al.  Improving SQL with generalized quantifiers , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[11]  Evelina Lamma,et al.  Modularity in Logic Programming , 1994, J. Log. Program..

[12]  Iain A. Stewart,et al.  Logical Characterizations of Bounded Query Classes II: Polynomial-Time Oracle Machines , 1992, Fundam. Informaticae.

[13]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties , 1995, Fundam. Informaticae.

[14]  Georg Gottlob,et al.  Adding disjunction to datalog (extended abstract) , 1994, PODS.

[15]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[16]  Antonio Badia,et al.  Query languages with generalized quantifiers , 1995 .

[17]  Teodor C. Przymusinski,et al.  Update by Means of Inference Rules , 1997, J. Log. Program..

[18]  Perlindström.  First Order Predicate Logic with Generalized Quantifiers , 1966 .

[19]  Haim Gaifman,et al.  Fully abstract compositional semantics for logic programs , 1989, POPL '89.

[20]  Domenico Saccà.  Deterministic and Non-Deterministic Stable Model Semantics for Unbound DATALOG Queries , 1995, ICDT.

[21]  Laura Giordano,et al.  Structuring Logic Programs: A Modal Approach , 1994, J. Log. Program..

[22]  Dale Miller,et al.  A Theory of Modules for Logic Programming , 1986, SLP.

[23]  Michael J. Maher,et al.  Foundations of Deductive Databases and Logic Programming , 1988 .

[24]  Teodor C. Przymusinski,et al.  Update by Means of Inference Rules , 1995, The Journal of Logic Programming.

[25]  Georg Gottlob.  Relativized logspace and generalized quantifiers over finite structures , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[26]  Jürgen Dix,et al.  Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview , 1996, Logic, Action, and Information.

[27]  J. Barwise,et al.  Generalized quantifiers and natural language , 1981 .

[28]  Richard A. O'Keefe,et al.  Towards an Algebra for Constructing Logic Programs , 1985, International Conference on Spoken Language Processing.

[29]  Paolo Mancarella,et al.  An Algebra of Logic Programs , 1988, ICLP/SLP.

[30]  Iain A. Stewart,et al.  Logical Characterizations of Bounded Query Classes I: Logspace Oracle Machines , 1992, Fundam. Informaticae.

[31]  J. Davenport.  Editor , 1960 .

[32]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[33]  John S. Schlipf,et al.  The Expressive Powers of the Logic Programming Semantics , 1995, J. Comput. Syst. Sci..