{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:02:45Z","timestamp":1725580965340},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642205880"},{"type":"electronic","value":"9783642205897"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20589-7_6","type":"book-chapter","created":{"date-parts":[[2011,4,19]],"date-time":"2011-04-19T01:11:00Z","timestamp":1303175460000},"page":"85-101","source":"Crossref","is-referenced-by-count":0,"title":["Towards Computing Revised Models for FO Theories"],"prefix":"10.1007","author":[{"given":"Johan","family":"Wittocx","sequence":"first","affiliation":[]},{"given":"Broes","family":"De Cat","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Denecker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"Brain, M., Watson, R., De Vos, M.: An interactive approach to answer set programming. In: Answer Set Programming. CEUR Workshop Proceedings, vol.\u00a0142 (2005), \n                    \n                      CEUR-WS.org"},{"issue":"2-4","key":"6_CR2","doi-asserted-by":"publisher","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.: NP-SPEC: an executable specification language for solving all problems in NP. Computer Languages\u00a026(2-4), 165\u2013195 (2000)","journal-title":"Computer Languages"},{"key":"6_CR3","unstructured":"De Cat, B.: Ontwikkeling van algoritmes voor modelrevisie, met toepassingen in treinplanning en netwerkconfiguratie. Master\u2019s thesis, Katholieke Universiteit Leuven, Leuven, Belgium (June 2009) (in Dutch)"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"6_CR5","volume-title":"A Mathematical Introduction To Logic","author":"H.B. Enderton","year":"1972","unstructured":"Enderton, H.B.: A Mathematical Introduction To Logic. Academic Press, London (1972)"},{"key":"6_CR6","first-page":"212","volume-title":"ICAPS","author":"M. Fox","year":"2006","unstructured":"Fox, M., Gerevini, A., Long, D., Serina, I.: Plan stability: Replanning versus plan repair. In: Long, D., Smith, S.F., Borrajo, D., McCluskey, L. (eds.) ICAPS, pp. 212\u2013221. AAAI, Menlo Park (2006)"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1613\/jair.2215","volume":"30","author":"C.M. Li","year":"2007","unstructured":"Li, C.M., Many\u00e0, F., Planes, J.: New inference rules for max-sat. J. Artif. Intell. Res. (JAIR)\u00a030, 321\u2013359 (2007)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-60085-2_17","volume-title":"The Logic Programming Paradigm: a 25-Year Perspective","author":"V.W. Marek","year":"1999","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: Apt, K.R., Marek, V.W., Truszczy\u0144ski, M., Warren, D.S. (eds.) The Logic Programming Paradigm: a 25-Year Perspective, pp. 375\u2013398. Springer, Heidelberg (1999)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-79719-7_20","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2008","author":"M. Mari\u00ebn","year":"2008","unstructured":"Mari\u00ebn, M., Wittocx, J., Denecker, M., Bruynooghe, M.: SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions. In: Kleine B\u00fcning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol.\u00a04996, pp. 211\u2013224. Springer, Heidelberg (2008)"},{"key":"6_CR10","first-page":"112","volume":"85","author":"D.G. Mitchell","year":"2005","unstructured":"Mitchell, D.G.: A SAT solver primer. Bulletin of the European Association for Theoretical Computer Science\u00a085, 112\u2013132 (2005)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"6_CR11","unstructured":"Mitchell, D.G., Ternovska, E., Hach, F., Mohebali, R.: Model expansion as a framework for modelling and solving search problems. Technical Report TR 2006-24, Simon Fraser University, Canada (2006)"},{"issue":"3-4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"6_CR13","unstructured":"Patterson, M., Liu, Y., Ternovska, E., Gupta, A.: Grounding for model expansion in k-guarded formulas with inductive definitions. In: Veloso, M.M. (ed.) IJCAI, pp. 161\u2013166 (2007)"},{"issue":"2-4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10472-008-9090-9","volume":"51","author":"S. Perri","year":"2007","unstructured":"Perri, S., Scarcello, F., Catalano, G., Leone, N.: Enhancing DLV instantiator by backjumping techniques. Annals of Mathematics and Artificial Intelligence\u00a051(2-4), 195\u2013228 (2007)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"6_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-76928-6_24","volume-title":"AI 2007: Advances in Artificial Intelligence","author":"K. Pipatsrisawat","year":"2007","unstructured":"Pipatsrisawat, K., Darwiche, A.: Clone: Solving Weighted Max-SAT\u00a0in a Reduced Search Space. In: Orgun, M.A., Thornton, J. (eds.) AI 2007. LNCS (LNAI), vol.\u00a04830, pp. 223\u2013233. Springer, Heidelberg (2007)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 521\u2013532 (1995)","DOI":"10.1090\/dimacs\/026\/25"},{"key":"6_CR17","unstructured":"Wittocx, J., Mari\u00ebn, M., Denecker, M.: GidL: A grounder for FO\u2009+\u2009. In: Pagnucco, M., Thielscher, M. (eds.) NMR, pp. 189\u2013198. University of New South Wales (2008)"},{"key":"6_CR18","unstructured":"Wittocx, J., Mari\u00ebn, M., Denecker, M.: The idp system: a model expansion system for an extension of classical logic. In: Denecker, M. (ed.) LaSh, pp. 153\u2013165 (2008)"}],"container-title":["Lecture Notes in Computer Science","Applications of Declarative Programming and Knowledge Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20589-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T00:19:26Z","timestamp":1558570766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20589-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642205880","9783642205897"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20589-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}