{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:27:06Z","timestamp":1762100826042},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,6,21]],"date-time":"2008-06-21T00:00:00Z","timestamp":1214006400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s10601-008-9050-3","type":"journal-article","created":{"date-parts":[[2008,6,20]],"date-time":"2008-06-20T00:50:40Z","timestamp":1213923040000},"page":"343-384","source":"Crossref","is-referenced-by-count":5,"title":["Expressive power and abstraction in Essence"],"prefix":"10.1007","volume":"13","author":[{"given":"David G.","family":"Mitchell","sequence":"first","affiliation":[]},{"given":"Eugenia","family":"Ternovska","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,6,21]]},"reference":[{"key":"9050_CR1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0096-0551(01)00010-8","volume":"26","author":"M. Cadoli","year":"2000","unstructured":"Cadoli, M., Ianni, G., Palopoli, L., Schaerf, A., & Vasile, D. (2000). NP-SPEC: An executable specification language for solving all problems in NP. Computer Languages, 26, 165\u2013195.","journal-title":"Computer Languages"},{"issue":"8\u20139","key":"9050_CR2","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1016\/j.artint.2006.01.008","volume":"170","author":"M. Cadoli","year":"2006","unstructured":"Cadoli, M., & Mancini, T. (2006). Automated reformulation of specifications by safe delay of constraints. Artificial Intelligence, 170(8\u20139), 779\u2013801.","journal-title":"Artificial Intelligence"},{"key":"9050_CR3","doi-asserted-by":"crossref","unstructured":"Denecker, M., & Ternovska, E. (2008). A logic of non-monotone inductive definitions. ACM Transactions on Computational Logic, 9(2).","DOI":"10.1145\/1342991.1342998"},{"issue":"1","key":"9050_CR4","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/1119439.1119441","volume":"7","author":"D. East","year":"2006","unstructured":"East, D., & Truszczynski, M. (2006). Predicate-calculus based logics for modeling and solving search problems. ACM Transactions on Computational Logic, 7(1), 38\u201383.","journal-title":"ACM Transactions on Computational Logic"},{"key":"9050_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03182-7","volume-title":"Finite model theory","author":"H.-D. Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.-D., & Flum, J. (1995). Finite model theory. Heidelberg: Springer."},{"key":"9050_CR6","volume-title":"A mathematical introduction to logic","author":"H. B. Enderton","year":"2001","unstructured":"Enderton, H. B. (2001). A mathematical introduction to logic. New York: Harcourt\/Academic."},{"key":"9050_CR7","first-page":"43","volume-title":"Complexity and computation, SIAM-AMS Proc. Vol. 7","author":"R. Fagin","year":"1974","unstructured":"Fagin, R. (1974). Generalized first-order spectra and polynomial-time recognizable sets. In R. Karp (Ed.), Complexity and computation, SIAM-AMS Proc. (Vol. 7, pp. 43\u201373). Providence: AMS.","edition":"7"},{"key":"9050_CR8","series-title":"revised selected papers, lecture notes in computer science","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/978-3-540-25938-1_18","volume-title":"Logic based program synthesis and transformation: 13th international symposium (LOPSTR \u201903)","author":"P. Flener","year":"2004","unstructured":"Flener, P., Pearson, J., & Agren, M. (2004). Introducing ESRA, a relational language for modelling combinatorial problems. In M. Bruynooghe (Ed.), Logic based program synthesis and transformation: 13th international symposium (LOPSTR \u201903), revised selected papers, lecture notes in computer science (Vol. 3018, pp. 214\u2013232). Heidelberg: Springer."},{"key":"9050_CR9","doi-asserted-by":"crossref","unstructured":"Friedman, H. M. (1999). Some decision problems of enormous complexity. In Proceedings, 14th symposium on logic in computer science (LICS \u201999) (pp. 2\u201312).","DOI":"10.1109\/LICS.1999.782577"},{"key":"9050_CR10","unstructured":"Frisch, A. M., Grum, M., Jefferson, C., Martinez Hernandez, B., & Miguel, I. (2005). The essence of Essence: A constraint language for specifying combinatorial problems. In Proc., fourth international workshop on modelling and reformulating constraint satisfaction problems (pp. 73\u201388) (October)."},{"key":"9050_CR11","unstructured":"Frisch, A. M., Grum, M., Jefferson, C., Martinez Hernandez, B., & Miguel, I. (2007). The design of Essence: A constraint language for specifying combinatorial problems. In Proc., twentieth international joint conference on artificial intelligence (IJCAI \u201907) (pp. 80\u201387)."},{"key":"9050_CR12","doi-asserted-by":"crossref","unstructured":"Frisch, A. M., Harvey, W., Jefferson, C., Mart\u00ednez Hern\u00e1ndez, B., & Miguel, I. (2008). Essence: A constraint language for specifying combinatorial problems. Constraints, 13(3).","DOI":"10.1007\/s10601-008-9047-y"},{"key":"9050_CR13","unstructured":"Frisch, A. M., Jefferson, C., Mart\u00ednez Hern\u00e1ndez, B., & Miguel, I. (2005). The rules of constraint modelling. In Proc., 19th international joint conference on artificial intelligence (pp. 109\u2013116)."},{"key":"9050_CR14","unstructured":"Frisch, A. M., Jefferson, C., Mart\u00ednez Hern\u00e1ndez, B., & Miguel, I. (2007). Symmetry in the generation of constraint models. In Proceedings of the international symmetry conference."},{"key":"9050_CR15","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP -completeness. San Francisco: W. H. Freeman."},{"key":"9050_CR16","series-title":"lecture notes in computer science","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/978-3-540-72200-7_24","volume-title":"Proc., 9th international conference on logic programming and nonmonotonic reasoning (LPNMR \u201907)","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Schaub, T., & Thiele, S. (2007). Gringo: A new grounder for answer set programming. In C. Baral, G. Brewka, & J. S. Schlipf (Eds.), Proc., 9th international conference on logic programming and nonmonotonic reasoning (LPNMR \u201907), lecture notes in computer science (Vol. 4483, pp. 266\u2013271). Heidelberg: Springer."},{"key":"9050_CR17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(92)90149-A","volume":"101","author":"E. Gr\u00e4del","year":"1992","unstructured":"Gr\u00e4del, E., (1992). Capturing complexity classes by fragments of second order logic. Theoretical Computer Science, 101, 35\u201357.","journal-title":"Theoretical Computer Science"},{"key":"9050_CR18","unstructured":"Gr\u00e4del, E., (2007). Finite model theory and descriptive complexity, chapter 3. E. Gr\u00e4del, P. G. Kolaitis, L. Libkin, M. Marx, J. Spencer, M. Y. Vardi, et al. (Eds.), Finite model theory and its applications (pp. 125\u2013230). Heidelberg: Springer."},{"issue":"1","key":"9050_CR19","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/inco.1997.2675","volume":"140","author":"E. Gr\u00e4del","year":"1998","unstructured":"Gr\u00e4del, E., & Gurevich, Y. (1998). Metafinite model theory. Information and Computation, 140(1), 26\u201381.","journal-title":"Information and Computation"},{"key":"9050_CR20","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N. Immerman","year":"1986","unstructured":"Immerman, N. (1986). Relational queries computable in polytime. Information and Control, 68, 86\u2013104.","journal-title":"Information and Control"},{"key":"9050_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N. (1999). Descriptive complexity. New York: Springer."},{"key":"9050_CR22","doi-asserted-by":"crossref","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., et al. (2006). The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 7(3).","DOI":"10.1145\/1149114.1149117"},{"key":"9050_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of finite model theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L. (2004). Elements of finite model theory. Heidelberg: Springer."},{"key":"9050_CR24","series-title":"lecture notes in computer science","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/11527862_12","volume-title":"Proc., 6th international symposium on abstraction, reformulation and approximation (SARA 2005)","author":"T. Mancini","year":"2005","unstructured":"Mancini, T., & Cadoli, M. (2005). Detecting and breaking symmetries by reasoning on problem specifications. In Proc., 6th international symposium on abstraction, reformulation and approximation (SARA 2005), lecture notes in computer science (Vol. 3607, pp. 165\u2013181). Heidelberg: Springer."},{"key":"9050_CR25","unstructured":"Mari\u00ebn, M., Wittocx, J., & Denecker, M. (2006). The IDP framework for declarative problem solving. In E. Giunchiglia, V. Marek, D. Mitchell, & E. Ternovska (Eds.), Proc., search and logic: Answer set programming and SAT (LaSh \u201906) (pp. 19\u201334)."},{"key":"9050_CR26","doi-asserted-by":"crossref","unstructured":"Marriott, K., Nethercote, N., Rafeh, R., Stuckey, P. J., de la Banda, M. G., & Wallace, M. (2008). The design of the zinc modelling language. Constraints, 13(3).","DOI":"10.1007\/s10601-008-9041-4"},{"key":"9050_CR27","unstructured":"Mills, P., Tsang, E. P. K., Williams, R., Ford, J., & Borrett, J. (1998). EaCL 1.0: An easy abstract constraint programming language. Technical report CSM-321, University of Essex (December)."},{"key":"9050_CR28","unstructured":"Mitchell, D. G., & Ternovska, E. (2005). A framework for representing and solving NP search problems. In Proc. of the 20th national conf. on artificial intelligence (AAAI \u201905) (pp. 430\u2013435)."},{"key":"9050_CR29","unstructured":"Mitchell, D., Ternovska, E., Hach, F., & Mohebali, R. (2006). Model expansion as a framework for modelling and solving search problems. Technical report TR 2006-24, School of Computing Science, Simon Fraser University."},{"key":"9050_CR30","volume-title":"Computational complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. (1994). Computational complexity. Reading: Addison-Wesley."},{"key":"9050_CR31","unstructured":"Syrj\u00e4nen, T. (2000). Lparse 1.0 user\u2019s manual. Available from: http:\/\/www.tcs.hut.fi\/Software\/smodels\/ ."},{"key":"9050_CR32","volume-title":"The OPL optimization programming language","author":"P. Hentenryck Van","year":"1999","unstructured":"Van Hentenryck, P. (1999). The OPL optimization programming language. Cambridge: MIT."},{"key":"9050_CR33","volume-title":"14th ACM symp","author":"M. Y. Vardi","year":"1982","unstructured":"Vardi, M. Y. (1982). The complexity of relational query languages. In 14th ACM symp. on theory of computing. Heidelberg: Springer."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9050-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-008-9050-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-008-9050-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:14:14Z","timestamp":1559229254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-008-9050-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,21]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["9050"],"URL":"https:\/\/doi.org\/10.1007\/s10601-008-9050-3","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6,21]]}}}