{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:48:25Z","timestamp":1725536905316},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042379"},{"type":"electronic","value":"9783642042386"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04238-6_21","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T08:23:01Z","timestamp":1251706981000},"page":"236-249","source":"Crossref","is-referenced-by-count":3,"title":["Max-ASP: Maximum Satisfiability of Answer Set Programs"],"prefix":"10.1007","author":[{"given":"Emilia","family":"Oikarinen","sequence":"first","affiliation":[]},{"given":"Matti","family":"J\u00e4rvisalo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","first-page":"448","volume-title":"Proc. AAAI 2008","author":"M. Gebser","year":"2008","unstructured":"Gebser, M., P\u00fchrer, J., Schaub, T., Tompits, H.: A meta-programming technique for debugging answer-set programs. In: Proc. AAAI 2008, pp. 448\u2013453. AAAI Press, Menlo Park (2008)"},{"key":"21_CR2","volume-title":"Handbook of Satisfiability","author":"C. Li","year":"2009","unstructured":"Li, C., Many\u00e1, F.: MaxSAT, hard and soft constraints. In: Handbook of Satisfiability. IOS Press, Amsterdam (2009)"},{"issue":"2-3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.artint.2007.05.006","volume":"172","author":"J. Larrosa","year":"2008","unstructured":"Larrosa, J., Heras, F., de Givry, S.: A logical approach to efficient Max-SAT solving. Artificial Intelligence\u00a0172(2-3), 204\u2013233 (2008)","journal-title":"Artificial Intelligence"},{"issue":"8-9","key":"21_CR4","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1016\/j.artint.2007.03.001","volume":"171","author":"M. Bonet","year":"2007","unstructured":"Bonet, M., Levy, J., Many\u00e0, F.: Resolution for Max-SAT. Artificial Intelligence\u00a0171(8-9), 606\u2013618 (2007)","journal-title":"Artificial Intelligence"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/11799573_4","volume-title":"Logic Programming","author":"M. Gebser","year":"2006","unstructured":"Gebser, M., Schaub, T.: Tableau calculi for answer set programming. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 11\u201325. Springer, Heidelberg (2006)"},{"issue":"5","key":"21_CR6","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/69.877512","volume":"12","author":"F. Buccafurri","year":"2000","unstructured":"Buccafurri, F., Leone, N., Rullo, P.: Enhancing disjunctive datalog by constraints. IEEE Transactions on Knowledge and Data Engineering\u00a012(5), 845\u2013860 (2000)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1-2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence\u00a0138(1-2), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"21_CR8","first-page":"867","volume-title":"Proc. IJCAI 2003","author":"G. Brewka","year":"2003","unstructured":"Brewka, G., Niemel\u00e4, I., Truszczynski, M.: Answer set optimization. In: Proc. IJCAI 2003, pp. 867\u2013872. Morgan Kaufmann, San Francisco (2003)"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Gebser, M., Gharib, M., Mercer, R., Schaub, T.: Monotonic answer set programming. Journal of Logic and Computation (in press, 2009), doi:10.1093\/logcom\/exn040","DOI":"10.1093\/logcom\/exn040"},{"key":"21_CR10","first-page":"1070","volume-title":"Proc. ICLP\/SLP 1988","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. ICLP\/SLP 1988, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"21_CR11","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1995","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1995)"},{"key":"21_CR12","first-page":"311","volume-title":"Readings in nonmonotonic reasoning","author":"K. Clark","year":"1987","unstructured":"Clark, K.: Negation as failure. In: Readings in nonmonotonic reasoning, pp. 311\u2013325. Morgan Kaufmann, San Francisco (1987)"},{"key":"21_CR13","first-page":"51","volume":"1","author":"F. Fages","year":"1994","unstructured":"Fages, F.: Consistency of Clark\u2019s completion and existence of stable models. Journal of Methods of Logic in Computer Science\u00a01, 51\u201360 (1994)","journal-title":"Journal of Methods of Logic in Computer Science"},{"issue":"1-2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F. Lin","year":"2004","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence\u00a0157(1-2), 115\u2013137 (2004)","journal-title":"Artificial Intelligence"},{"issue":"3-4","key":"21_CR15","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"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04238-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T16:27:24Z","timestamp":1552148844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04238-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042379","9783642042386"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04238-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}