{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:17:52Z","timestamp":1743149872953,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030195694"},{"type":"electronic","value":"9783030195700"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19570-0_36","type":"book-chapter","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T12:27:54Z","timestamp":1557145674000},"page":"542-558","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0856-7162","authenticated-orcid":false,"given":"Tobias","family":"Geibinger","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5673-2460","authenticated-orcid":false,"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,6]]},"reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science (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. 2923, pp. 87\u201399. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24609-1_10"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-24599-5_16","volume-title":"Logic Programming","author":"T Eiter","year":"2003","unstructured":"Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 224\u2013238. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-24599-5_16"},{"key":"36_CR3","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Strong and uniform equivalence in answer-set programming: Characterizations and complexity results for the non-ground case. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI 2005), pp. 695\u2013700. AAAI Press (2005)"},{"key":"36_CR4","unstructured":"Eiter, T., Tompits, H., Woltran, S.: On solution correspondences in answer set programming. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 97\u2013102. Professional Book (2005)"},{"issue":"1","key":"36_CR5","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.artint.2010.04.011","volume":"175","author":"P Ferraris","year":"2011","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: Stable models and circumscription. Artif. Intel. 175(1), 236\u2013263 (2011)","journal-title":"Artif. Intel."},{"key":"36_CR6","unstructured":"Geibinger, T.: Characterising relativised strong equivalence with projection for non-ground logic programs. Bachelor\u2019s thesis, Technische Universit\u00e4t Wien, Institute of Logic and Computation, E193\u201303 (2018)"},{"key":"36_CR7","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the 5th International Conference and Symposium on Logic Programming (ICLP\/SLP 1988), pp. 1070\u20131080. MIT Press (1988)"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9, 365\u2013385 (1991)","journal-title":"New Gener. Comput."},{"key":"36_CR9","unstructured":"G\u00f6del, K.: Zum intuitionistischen Aussagenkalk\u00fcl. Anzeiger der Akademie der Wissenschaften in Wien, pp. 65\u201366 (1932)"},{"key":"36_CR10","unstructured":"Heyting, A.: Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preu\u00dfischen Akademie der Wissenschaften. Physikalisch-mathematische Klasse, pp. 42\u201356 (1930)"},{"key":"36_CR11","doi-asserted-by":"publisher","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. Intel. Res. 35, 813\u2013857 (2009)","journal-title":"J. Artif. Intel. Res."},{"key":"36_CR12","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 Trans. Comput. Logic 2, 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Logic"},{"key":"36_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-540-89982-2_49","volume-title":"Logic Programming","author":"J Oetsch","year":"2008","unstructured":"Oetsch, J., Tompits, H.: Program correspondence under the answer-set semantics: the non-ground case. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 591\u2013605. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-89982-2_49"},{"key":"36_CR14","unstructured":"Oetsch, J., Tompits, H., Woltran, S.: Facts do not cease to exist because they are ignored: relativised uniform equivalence with answer-set projection. In: Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI 2007), pp. 458\u2013464. AAAI Press (2007)"},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-540-89982-2_46","volume-title":"Logic Programming","author":"D Pearce","year":"2008","unstructured":"Pearce, D., Valverde, A.: Quantified equilibrium logic and foundations for answer set programs. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 546\u2013560. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-89982-2_46"},{"key":"36_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-04238-6_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J P\u00fchrer","year":"2009","unstructured":"P\u00fchrer, J., Tompits, H.: Casting away disjunction and negation under a generalisation of strong equivalence with projection. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol. 5753, pp. 264\u2013276. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-04238-6_23"},{"key":"36_CR17","first-page":"602","volume":"3","author":"H Turner","year":"2003","unstructured":"Turner, H.: Strong equivalence made easy: Nested expressions and weight constraints. Theory Pract. Logic Prog. 3, 602\u2013622 (2003)","journal-title":"Theory Pract. Logic Prog."},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-30227-8_16","volume-title":"Logics in Artificial Intelligence","author":"S Woltran","year":"2004","unstructured":"Woltran, S.: Characterizations for relativized notions of equivalence in answer set programming. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 161\u2013173. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-30227-8_16"},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1017\/S1471068407003250","volume":"8","author":"S Woltran","year":"2008","unstructured":"Woltran, S.: A common view on strong, uniform, and other notions of equivalence in answer-set programming. Theory Pract. Logic Prog. 8, 217\u2013234 (2008)","journal-title":"Theory Pract. Logic Prog."}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19570-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:38:56Z","timestamp":1558348736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19570-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030195694","9783030195700"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19570-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jelia2019.mat.unical.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}