{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:31:20Z","timestamp":1725582680853},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208942"},{"type":"electronic","value":"9783642208959"}],"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-20895-9_15","type":"book-chapter","created":{"date-parts":[[2011,4,25]],"date-time":"2011-04-25T00:40:34Z","timestamp":1303692034000},"page":"161-173","source":"Crossref","is-referenced-by-count":4,"title":["Strong Equivalence of Logic Programs with Abstract Constraint Atoms"],"prefix":"10.1007","author":[{"given":"Guohua","family":"Liu","sequence":"first","affiliation":[]},{"given":"Randy","family":"Goebel","sequence":"additional","affiliation":[]},{"given":"Tomi","family":"Janhunen","sequence":"additional","affiliation":[]},{"given":"Ilkka","family":"Niemel\u00e4","sequence":"additional","affiliation":[]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. ICLP, pp. 1070\u20131080 (1988)"},{"issue":"3-4","key":"15_CR2","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 Math. and Artificial Intelligence\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Math. and Artificial Intelligence"},{"issue":"2","key":"15_CR3","first-page":"167","volume":"8","author":"V. Marek","year":"2008","unstructured":"Marek, V., Niemel\u00e4, I., Truszczy\u0144ski, M.: Logic programs with monotone abstract constraint atoms. TPLP\u00a08(2), 167\u2013199 (2008)","journal-title":"TPLP"},{"key":"15_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-540-24609-1_16","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"V.W. Marek","year":"2003","unstructured":"Marek, V.W., Remmel, J.B.: Set constraints in logic programming. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 167\u2013179. Springer, Heidelberg (2003)"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.2171","volume":"29","author":"T.C. Son","year":"2007","unstructured":"Son, T.C., Pontelli, E., Tu, P.H.: Answer sets for logic programs with arbitrary abstract constraint atoms. JAIR\u00a029, 353\u2013389 (2007)","journal-title":"JAIR"},{"issue":"1-2","key":"15_CR6","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":"15_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-30227-8_19","volume-title":"Logics in Artificial Intelligence","author":"W. Faber","year":"2004","unstructured":"Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 200\u2013212. Springer, Heidelberg (2004)"},{"key":"15_CR8","first-page":"355","volume":"7","author":"T.C. Son","year":"2006","unstructured":"Son, T.C., Pontelli, E.: A constructive semantic characterization of aggregates in answer set programming. TPLP\u00a07, 355\u2013375 (2006)","journal-title":"TPLP"},{"key":"15_CR9","volume-title":"Handbook of Constraint Programming","author":"W.J. Hoeve van","year":"2006","unstructured":"van Hoeve, W.J., Katriel, I.: Global constraints. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier, Amsterdam (2006)"},{"issue":"4","key":"15_CR10","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1613\/jair.2009","volume":"7","author":"L. Liu","year":"2006","unstructured":"Liu, L., Truszczy\u0144ski, M.: Properties and applications of programs with monotone and convex constraints. JAIR\u00a07, 299\u2013334 (2006)","journal-title":"JAIR"},{"key":"15_CR12","unstructured":"Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Proc. KR 2002, pp. 170\u2013176 (2002)"},{"key":"15_CR13","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1017\/S1471068403001819","volume":"3","author":"H. Turner","year":"2003","unstructured":"Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming\u00a03, 609\u2013622 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-04238-6_49","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2009","unstructured":"Gebser, M., Kaminski, R., Ostrowski, M., Schaub, T., Thiele, S.: On the input language of ASP grounder gringo. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 502\u2013508. Springer, Heidelberg (2009)"},{"issue":"3","key":"15_CR15","first-page":"301","volume":"7","author":"N. Pelov","year":"2007","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Well-founded and stable semantics of logic programs with aggregates. TPLP\u00a07(3), 301\u2013353 (2007)","journal-title":"TPLP"},{"key":"15_CR16","unstructured":"Janhunen, T.: Sampler programs: The stable model semantics of abstract constraint programs revisited. In: Proc. ICLP, pp. 94\u2013103 (2010)"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Eiter, T., Fink, M., Woltran, S.: Semantical characterizations and complexity of equivalences in answer set programming. ACM Transactions on Computational Logic 8(3) (2007)","DOI":"10.1145\/1243996.1244000"},{"key":"15_CR18","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1613\/jair.2810","volume":"35","author":"T. Janhunen","year":"2009","unstructured":"Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. J. Artif. Intell. Res. (JAIR)\u00a035, 813\u2013857 (2009)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"15_CR19","unstructured":"Pelov, N.: Semantics of Logic Programs with Aggregates. PhD thesis, Ketholieke Universiteit Leuven (2004)"},{"key":"15_CR20","unstructured":"Pelov, N., Denecker, M., Bruynooghe, M.: Translation of aggregate programs to normal logic programs. In: Proc. ASP 2003, pp. 29\u201342 (2003)"},{"issue":"4","key":"15_CR21","first-page":"529","volume":"9","author":"Y. Shen","year":"2009","unstructured":"Shen, Y., You, J., Yuan, L.: Characterizations of stable model semantics for logic programs with arbitrary constraint atoms. TPLP\u00a09(4), 529\u2013564 (2009)","journal-title":"TPLP"},{"key":"15_CR22","unstructured":"You, J., Liu, G.: Loop formulas for logic programs with arbitrary constraint atoms. In: Proc. AAAI 2008, pp. 584\u2013589 (2008)"},{"key":"15_CR23","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-72200-7_20","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J. You","year":"2007","unstructured":"You, J., Yuan, L.Y., Liu, G., Shen, Y.: Logic programs with abstract constraints: Representation, disjunction and complexities. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 228\u2013240. Springer, Heidelberg (2007)"},{"key":"15_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-24609-1_10","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 87\u201399. Springer, Heidelberg (2003)"},{"key":"15_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11546207_10","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P. Ferraris","year":"2005","unstructured":"Ferraris, P.: Answer sets for propositional theories. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 119\u2013131. Springer, Heidelberg (2005)"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11562931_7","volume-title":"Logic Programming","author":"S. Baselice","year":"2005","unstructured":"Baselice, S., Bonatti, P.A., Gelfond, M.: Towards an integration of answer set and constraint solving. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 52\u201366. Springer, Heidelberg (2005)"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-02846-5_22","volume-title":"Logic Programming","author":"M. Gebser","year":"2009","unstructured":"Gebser, M., Ostrowski, M., Schaub, T.: Constraint answer set solving. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol.\u00a05649, pp. 235\u2013249. Springer, Heidelberg (2009)"},{"issue":"1-4","key":"15_CR28","first-page":"251","volume":"53","author":"V.S. Mellarkod","year":"2008","unstructured":"Mellarkod, V.S., Gelfond, M., Zhang, Y.: Integrating answer set programming and constraint logic programming. Annals of Math. and AI\u00a053(1-4), 251\u2013287 (2008)","journal-title":"Annals of Math. and AI"},{"issue":"12-13","key":"15_CR29","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1016\/j.artint.2008.04.002","volume":"172","author":"T. Eiter","year":"2008","unstructured":"Eiter, T., Ianni, G., Lukasiewicz, T., Schindlauer, R., Tompits, H.: Combining answer set programming with description logics for the semantic web. Artificial. Intelligence.\u00a0172(12-13), 1495\u20131539 (2008)","journal-title":"Artificial. Intelligence."},{"key":"15_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-04238-6_3","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"I. Niemel\u00e4","year":"2009","unstructured":"Niemel\u00e4, I.: Integrating answer set programming and satisfiability modulo theories. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 3\u20133. Springer, Heidelberg (2009)"}],"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-20895-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:13:22Z","timestamp":1558574002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20895-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208942","9783642208959"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20895-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}