{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T05:08:14Z","timestamp":1740632894060,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162411"},{"type":"electronic","value":"9783642162428"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16242-8_43","type":"book-chapter","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T12:51:59Z","timestamp":1286196719000},"page":"610-624","source":"Crossref","is-referenced-by-count":2,"title":["PBINT, A Logic for Modelling Search Problems Involving Arithmetic"],"prefix":"10.1007","author":[{"given":"Shahab","family":"Tasharrofi","sequence":"first","affiliation":[]},{"given":"Eugenia","family":"Ternovska","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions (extended abstract). In: STOC 1992: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pp. 283\u2013293 (1992)","DOI":"10.1145\/129712.129740"},{"key":"43_CR2","unstructured":"Buss, S.R.: Bounded arithmetic. PhD thesis, Princeton University (1985)"},{"key":"43_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-49201-1_2","volume-title":"Practical Aspects of Declarative Languages","author":"M. Cadoli","year":"1999","unstructured":"Cadoli, M., Palopoli, L., Schaerf, A., Vasile, D.: Np-spec: An executable specification language for solving all problems in np. In: Gupta, G. (ed.) PADL 1999. LNCS, vol.\u00a01551, pp. 16\u201330. Springer, Heidelberg (1999)"},{"key":"43_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","volume":"21","author":"A. Chandra","year":"1980","unstructured":"Chandra, A., Harel, D.: Computable queries for relational databases. Journal of Computer and System Sciences\u00a021, 156\u2013178 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR5","unstructured":"Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) Proc. of the 1964 International Congress for Logic, Methodology, and the Philosophy of Science, pp. 24\u201330 (1964)"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Cook, S., Kolokolova, A.: A second-order system for polytime reasoning based on gr\u00e4del\u2019s theorem. In: Proceedings of Sixteenth Annual IEEE Symposium on Logic in Computer Science (LICS 2001), pp. 177\u2013186 (2001)","DOI":"10.1109\/LICS.2001.932495"},{"issue":"2","key":"43_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1342991.1342998","volume":"9","author":"M. Denecker","year":"2008","unstructured":"Denecker, M., Ternovska, E.: A logic of non-monotone inductive definitions. TOCL\u00a09(2), 1\u201351 (2008)","journal-title":"TOCL"},{"key":"43_CR8","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Complexity of computation, SIAM-AMC proceedings, vol.\u00a07, pp. 43\u201373 (1974)"},{"key":"43_CR9","unstructured":"Frisch, A.M., Grum, M., Jefferson, C., Hernandez, B.M., Miguel, I.: The essence of essence: A constraint language for specifying combinatorial problems. In: Proc. of the Fourth International Workshop on Modelling and Reformulating Constraint Satisfaction Problems, pp. 73\u201388 (2005)"},{"key":"43_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-540-72200-7_24","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Schaub, T., Thiele, S.: Gringo: A new grounder for answer set programming. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 266\u2013271. Springer, Heidelberg (2007)"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. In: PODS 2001 (2001)","DOI":"10.1145\/375551.375579"},{"key":"43_CR12","first-page":"125","volume-title":"Finite Model Theory and Descriptive Complexity","author":"E. Gr\u00e4del","year":"2007","unstructured":"Gr\u00e4del, E.: Finite Model Theory and Descriptive Complexity, pp. 125\u2013230. Springer, Heidelberg (2007)"},{"issue":"1","key":"43_CR13","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1006\/inco.1997.2675","volume":"140","author":"E. Gr\u00e4del","year":"1998","unstructured":"Gr\u00e4del, E., Gurevich, Y.: Metafinite model theory. Inf. Comput.\u00a0140(1), 26\u201381 (1998)","journal-title":"Inf. Comput."},{"key":"43_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-48168-0_6","volume-title":"Computer Science Logic","author":"E. Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E., Kreutzer, S.: Descriptive complexity theory for constraint databases. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 67\u201381. Springer, Heidelberg (1999)"},{"key":"43_CR15","first-page":"381","volume":"32","author":"E. Gr\u00e4del","year":"1996","unstructured":"Gr\u00e4del, E., Meer, K.: Descriptive complexity theory over the real numbers. Mathematics of Numerical Analysis: Real Number Algorithms\u00a032, 381\u2013403 (1996)","journal-title":"Mathematics of Numerical Analysis: Real Number Algorithms"},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Immerman, N.: Relational queries computable in polynomial time. In: STOC 1982: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, pp. 147\u2013152 (1982)","DOI":"10.1145\/800070.802187"},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"Immerman, N.: Descriptive complexity (1999)","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"43_CR18","doi-asserted-by":"crossref","unstructured":"Leivant, D.: A foundational delineation of computational feasibility. In: LICS 1991: Proceedings of the sixth Annual IEEE Symposium on Logic in Computer Science, pp. 2\u201311 (1991)","DOI":"10.1109\/LICS.1991.151625"},{"key":"43_CR19","doi-asserted-by":"crossref","unstructured":"Libkin, L.: Elements of Finite Model Theory (2004)","DOI":"10.1007\/978-3-662-07003-1"},{"key":"43_CR20","first-page":"257","volume-title":"Embedded Finite Models and Constraint Databases","author":"L. Libkin","year":"2007","unstructured":"Libkin, L.: Embedded Finite Models and Constraint Databases, pp. 257\u2013338. Springer, Heidelberg (2007)"},{"key":"43_CR21","unstructured":"Mitchell, D.G., Ternovska, E.: A framework for representing and solving NP search problems. In: Proc. AAAI 2005 (2005)"},{"issue":"2","key":"43_CR22","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10601-008-9050-3","volume":"13","author":"D.G. Mitchell","year":"2008","unstructured":"Mitchell, D.G., Ternovska, E.: Expressiveness and abstraction in essence. Constraints\u00a013(2), 343\u2013384 (2008)","journal-title":"Constraints"},{"key":"43_CR23","unstructured":"Skelley, A.: Theories and Proof Systems for PSPACE and the EXP-Time Hierarchy. PhD thesis, University of Toronto (2005)"},{"issue":"2","key":"43_CR24","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0304-3975(97)00093-5","volume":"190","author":"D. Suciu","year":"1998","unstructured":"Suciu, D.: Domain-independent queries on databases with external functions. Theor. Comput. Sci.\u00a0190(2), 279\u2013315 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR25","unstructured":"Syrj\u00e4nen, T.: Lparse 1.0 User\u2019s Manual (2000), http:\/\/www.tcs.hut.fi\/Software\/smodels\/lparse.ps.gz"},{"key":"43_CR26","unstructured":"Tasharrofi, S., Ternovska, E.: Built-in arithmetic in knowledge representation languages. In: Proc. of Logic and Search, LaSh 2010 (2010)"},{"key":"43_CR27","unstructured":"Ternovska, E., Mitchell, D.G.: Declarative programming of search problems with built-in arithmetic. In: Proc. of 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 942\u2013947 (2009)"},{"key":"43_CR28","unstructured":"Topor, R.: Safe database queries with arithmetic relations. In: Proc. 14th Australian Computer Science Conf., pp. 1\u201313 (1991)"},{"key":"43_CR29","unstructured":"Wittocx, J., Marien, M.: The IDP System, KU Leuven (June 2008), www.cs.kuleuven.be\/~dtai\/krr\/software\/idpmanual.pdf"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16242-8_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:33:22Z","timestamp":1740548002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16242-8_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162411","9783642162428"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16242-8_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}