{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:02:43Z","timestamp":1725667363476},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287169"},{"type":"electronic","value":"9783642287176"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28717-6_4","type":"book-chapter","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T15:13:04Z","timestamp":1331046784000},"page":"15-22","source":"Crossref","is-referenced-by-count":7,"title":["Enfragmo: A System for Modelling and Solving Search Problems with Logic"],"prefix":"10.1007","author":[{"given":"Amir","family":"Aavani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiongnan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shahab","family":"Tasharrofi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugenia","family":"Ternovska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"http:\/\/www.cs.sfu.ca\/research\/groups\/mxp\/"},{"key":"4_CR2","unstructured":"Mitchell, D., Ternovska, E.: A framework for representing and solving NP search problems. In: Proc. AAAI, pp. 430\u2013435 (2005)"},{"key":"4_CR3","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. Complexity of Computation, 43\u201374 (1974)"},{"key":"4_CR4","unstructured":"Ternovska, E., Mitchell, D.: Declarative programming of search problems with built-in arithmetic. In: Proc. of IJCAI, pp. 942\u2013947 (2009)"},{"key":"4_CR5","unstructured":"Tasharrofi, S., Ternovska, E.: Built-in arithmetic in knowledge representation languages. In: NonMon at 30 (Thirty Years of Nonmonotonic Reasoning) (October 2010)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/978-3-642-16242-8_43","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. Tasharrofi","year":"2010","unstructured":"Tasharrofi, S., Ternovska, E.: PBINT, A Logic for Modelling Search Problems Involving Arithmetic. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 610\u2013624. Springer, Heidelberg (2010)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-21043-3_2","volume-title":"Advances in Artificial Intelligence","author":"A. Aavani","year":"2011","unstructured":"Aavani, A., Wu, X(N.), Ternovska, E., Mitchell, D.: Grounding Formulas with Complex Terms. In: Butz, C., Lingras, P. (eds.) Canadian AI 2011. LNCS, vol.\u00a06657, pp. 13\u201325. Springer, Heidelberg (2011)"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-17511-4_2","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. Aavani","year":"2010","unstructured":"Aavani, A., Tasharrofi, S., Unel, G., Ternovska, E., Mitchell, D.: Speed-Up Techniques for Negation in Grounding. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol.\u00a06355, pp. 13\u201326. Springer, Heidelberg (2010)"},{"key":"4_CR9","unstructured":"Mohebali, R.: A method for solving NP search problems based on model expansion and grounding. Master\u2019s thesis, Simon Fraser University (2006)"},{"key":"4_CR10","unstructured":"Aavani, A., Wu, X., Mitchell, D., Ternovska, E.: Grounding Cardinality Constraints. In: LPAR-16 Short Paper (2010)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Tseitin, G.S.: On the complexity of derivations in the propositional calculus. Studies in Mathematics and Mathematical Logic, 115\u2013125 (1968)","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-04238-6_75","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Denecker","year":"2009","unstructured":"Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczy\u0144ski, M.: The Second Answer Set Programming Competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 637\u2013654. Springer, Heidelberg (2009)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-21581-0_28","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2011","author":"A. Aavani","year":"2011","unstructured":"Aavani, A.: Translating Pseudo-Boolean Constraints into CNF. In: Sakallah, K.A., Simon, L. (eds.) SAT 2011. LNCS, vol.\u00a06695, pp. 357\u2013359. Springer, Heidelberg (2011)"},{"issue":"2","key":"4_CR14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.3233\/AIC-2011-0497","volume":"24","author":"M. Gebser","year":"2011","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: The Potsdam answer set solving collection. AI Commun.\u00a024(2), 105\u2013124 (2011)","journal-title":"AI Commun."},{"key":"4_CR15","series-title":"Lecture Notes in Artificial Intelligence","first-page":"424","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Dell\u2019Armi","year":"2001","unstructured":"Dell\u2019Armi, T., Faber, W., Ielpa, G., Koch, C., Leone, N., Perri, S., Pfeifer, G.: System Description: DLV. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 424\u2013428. Springer, Heidelberg (2001)"},{"key":"4_CR16","unstructured":"Wittocx, J., Mari\u00e9n, M., Denecker, M.: The IDP system: A model expansion system for an extension of classical logic. In: Proceedings of the 2nd Workshop on Logic and Search, pp. 153\u2013165 (2008)"}],"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-28717-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:07:19Z","timestamp":1620126439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28717-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287169","9783642287176"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28717-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}