{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:15:02Z","timestamp":1725664502428},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540632559"},{"type":"electronic","value":"9783540692492"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63255-7_22","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:22:55Z","timestamp":1330298575000},"page":"289-308","source":"Crossref","is-referenced-by-count":10,"title":["Modular logic programming and generalized quantifiers"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Eiter","sequence":"first","affiliation":[]},{"given":"Georg","family":"Gottlob","sequence":"additional","affiliation":[]},{"given":"Helmut","family":"Veith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"K. Apt, H. Blair, and A. Walker. Towards a Theory of Declarative Knowledge. In Minker [27], pp. 89\u2013148.","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"A. Badia, M. Gyssens, and D. V. Gucht. Query languages with generalized quantifiers. In R.Ramakrishnan, editor, Applications of Logic Databases, pp. 235\u2013258. Kluwer Academic Publishers, 1995.","DOI":"10.1007\/978-1-4615-2207-2_11"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00350139","volume":"4","author":"J. Barwise","year":"1981","unstructured":"J. Barwise and R. Cooper. Generalized Quantifiers and Natural Language. Linguistic and Philosophy, 4:159\u2013219, 1981.","journal-title":"Linguistic and Philosophy"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0743-1066(94)90032-9","volume":"19\/20","author":"M. Bugliesi","year":"1994","unstructured":"M. Bugliesi, E. Lamma, and P. Mello. Modularity in Logic Programming. J. Logic Programming, 19\/20:443\u2013502, 1994.","journal-title":"J. Logic Programming"},{"issue":"2","key":"22_CR5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1093\/logcom\/5.2.213","volume":"5","author":"A. Dawar","year":"1995","unstructured":"A. Dawar. Generalized Quantifiers and Logical Reducibilities. J. Logic and Computation, 5(2):213\u2013226, 1995.","journal-title":"J. Logic and Computation"},{"key":"22_CR6","unstructured":"A. Dawar, G. Gottlob, and L. Hella. Capturing Relativized Complexity Classes without Order. Mathematical Logic Quarterly, to appear. Technical Report CD-TR 96\/105, CD Lab for Expert Systems, TU Vienna, 1996."},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/FI-1995-2233","volume":"22","author":"J. Dix","year":"1995","unstructured":"J. Dix. A Classification Theory of Semantics of Normal Logic Programs: Strong Properties. Fundamenta Informaticae, 22:227\u2013255, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-1995-2234","volume":"22","author":"J. Dix","year":"1995","unstructured":"J. Dix. A Classification Theory of Semantics of Normal Logic Programs: Weak Properties. Fundamenta Informaticae, 22:257\u2013288, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"22_CR9","unstructured":"J. Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview. In Logic, Action and Information. Proc. Konstanz Colloquium in Logic and Information (LogIn'92), pp. 241\u2013329. DeGmyter, 1995."},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"T. Eiter, G. Gottlob, and N. Leone. Abduction From Logic Programs: Semantics and Complexity. Theoretical Computer Science, to appear.","DOI":"10.1016\/S0304-3975(96)00179-X"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"T. Eiter, G. Gottlob, and H. Mannila. Adding Disjunction to Datalog. In Proc. PODS '94, pp. 267\u2013278, 1994.","DOI":"10.1145\/182591.182639"},{"key":"22_CR12","unstructured":"T. Eiter and G. Gottlob. Expressiveness of Stable Model Semantics for Disjunctive Logic Programs with Functions. J. Logic Programming, to appear. CD-TR 96\/103, CD Lab for Expert Systems, TU Vienna."},{"key":"22_CR13","unstructured":"T. Eiter, G. Gottlob, and H. Veith. Logic Programming: Modularity and Revision. In Abstract presented at the Workshop Logic Databases: The Meaning of Change, Dagstuhl, September 1996."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"H. Gaifman and E. Shapiro. Fully Abstract Compositional Semantics for Logic Programs. In Proc. 16th ACM Symp. POPL, pp. 134\u2013142. 1989","DOI":"10.1145\/75277.75289"},{"key":"22_CR15","volume-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-Gompleteness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. S. Johnson. Computers and Intractability \u2014 A Guide to the Theory of NP-Gompleteness. W. H. Freeman, New York, 1979."},{"key":"22_CR16","unstructured":"M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In Proc. Fifth Intl CSLP, pp. 1070\u20131080, 1988."},{"key":"22_CR17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0743-1066(94)90001-9","volume":"21","author":"L. Giordano","year":"1994","unstructured":"L. Giordano and A. Martelli. Structuring Logic Programs: A Modal Approach. J.Logic Programming, 21:59\u201394, 1994.","journal-title":"J.Logic Programming"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"G. Gottlob. Relativized Logspace and Generalized Quantifiers over Finite Structures. In Proc. IEEE LICS '95, pages 65\u201378, 1995. Extended version Journal of Symbolic Logic, to appear.","DOI":"10.1109\/LICS.1995.523245"},{"key":"22_CR19","first-page":"167","volume-title":"Infinitistic Methods, Proc. Symp. on Foundations of Mathematics","author":"L. Henkin","year":"1961","unstructured":"L. Henkin. Some Remarks on Infinitely Long Formulas. In Infinitistic Methods, Proc. Symp. on Foundations of Mathematics, pp. 167\u2013183. Warsaw, Panstwowe Wydawnictwo Naukowe and Pergamon Press, 1961."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"P. Hsu and D. Parker. Improving SQL with Generalized Quantifiers. In Proc. 11th Intl Conference on Data Engineering, 1995.","DOI":"10.1109\/ICDE.1995.380381"},{"key":"22_CR21","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1111\/j.1755-2567.1966.tb00600.x","volume":"32","author":"P. Lindstr\u00f6m","year":"1966","unstructured":"P. Lindstr\u00f6m. First Order Predicate Logic with Generalized Quantifiers. Theoria, 32:186\u2013195, 1966.","journal-title":"Theoria"},{"key":"22_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of Logic Programming","author":"J. Lloyd","year":"1984","unstructured":"J. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1984."},{"key":"22_CR23","unstructured":"P. Mancarella and D. Pedreschi. An Algebra of Logic Programs. In Proc. ICLP'88, pp. 1006\u20131023. MIT-Press, 1988."},{"key":"22_CR24","unstructured":"W. Marek and M. Truszczy\u0144ski. Revision specifications by means of revision programs. In Logics in AI. Proc. JELIA '94, LNAI, 1994."},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"W. Marek and M. Truszczy\u0144ski. Revision Programming, database updates and integrity constraints. In Proc. ICDT '95, LNCS 893, pp. 368\u2013382, 1995.","DOI":"10.1007\/3-540-58907-4_28"},{"key":"22_CR26","unstructured":"D. Miller. A Theory of Modules in Logic Programming. In Proc. ILPS '86, pp.106\u2013114. 1986."},{"key":"22_CR27","unstructured":"J. Minker, editor. Foundations of Deductive Databases and Logic Programming. Morgan Kaufman, 1988."},{"key":"22_CR28","doi-asserted-by":"crossref","first-page":"12","DOI":"10.4064\/fm-44-1-12-36","volume":"44","author":"A. Mostowski","year":"1957","unstructured":"A. Mostowski. On a Generalization of Quantifiers. Fundamenta Mathematicae, 44:12\u201336, 1957.","journal-title":"Fundamenta Mathematicae"},{"key":"22_CR29","unstructured":"R. O'Keefe. Towards an Algebra for Constructing Logic Programs. In Proc. IEEE Symposium on Logic Programming, pp. 152\u2013160. IEEE CS Press, 1985."},{"key":"22_CR30","unstructured":"C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994."},{"key":"22_CR31","unstructured":"T. Przymusinski. On the Declarative and Procedural Semantics of Stratified Deductive Databases. In Minker [27], pp. 193\u2013216."},{"key":"22_CR32","first-page":"156","volume":"928","author":"T. Przymusi\u0144ski","year":"1995","unstructured":"T. Przymusi\u0144ski and H. Turner. Update by Means of Inference Rules. In Proc. LPNMR '95, LNCS 928, pp. 156\u2013174, 1995.","journal-title":"Proc. LPNMR '95, LNCS"},{"key":"22_CR33","first-page":"353","volume":"893","author":"D. Sacc\u00e1","year":"1995","unstructured":"D. Sacc\u00e1. Deterministic and Nondeterministic Stable Model Semantics for Unbound DATALOG Queries. In Proc. ICDT-95, LNCS 893, pp. 353\u2013367, 1995.","journal-title":"Proc. ICDT-95, LNCS"},{"issue":"1","key":"22_CR34","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1006\/jcss.1995.1053","volume":"51","author":"J. Schlipf","year":"1995","unstructured":"J. Schlipf. The Expressive Powers of Logic Programming Semantics. J. Computer and System Sciences, 51(1):64\u201386, 1995. Abstract in Proc. PODS 90, pp. 196\u2013204.","journal-title":"J. Computer and System Sciences"},{"key":"22_CR35","doi-asserted-by":"crossref","first-page":"65","DOI":"10.3233\/FI-1993-18105","volume":"18","author":"I. Stewart","year":"1993","unstructured":"I. Stewart. Logical Characterizations of Bounded Query Classes I: Logspace oracle machines. Fundamenta Informaticae, 18:65\u201392, 1993.","journal-title":"Fundamenta Informaticae"},{"key":"22_CR36","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-1993-18106","volume":"18","author":"I. Stewart","year":"1993","unstructured":"I. Stewart. Logical Characterizations of Bounded Query Classes II: Logspace oracle machines. Fundamenta Informaticae, 18:93\u2013105, 1993.","journal-title":"Fundamenta Informaticae"},{"issue":"5","key":"22_CR37","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1137\/0219058","volume":"19","author":"K. Wagner","year":"1990","unstructured":"K. Wagner. Bounded Query Classes. SIAM J. Comp., 19(5):833\u2013846, 1990.","journal-title":"SIAM J. Comp."}],"container-title":["Lecture Notes in Computer Science","Logic Programming And Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63255-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T18:12:41Z","timestamp":1713636761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63255-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540632559","9783540692492"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/3-540-63255-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}