{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T10:53:35Z","timestamp":1758279215364},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642006746"},{"type":"electronic","value":"9783642006753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00675-3_16","type":"book-chapter","created":{"date-parts":[[2009,4,20]],"date-time":"2009-04-20T07:02:24Z","timestamp":1240210944000},"page":"241-246","source":"Crossref","is-referenced-by-count":4,"title":["Testing Relativised Uniform Equivalence under Answer-Set Projection in the System cc\u2009\u22a4"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Oetsch","sequence":"first","affiliation":[]},{"given":"Martina","family":"Seidl","sequence":"additional","affiliation":[]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/CIC.2006.29","volume-title":"Proc. of the 15th International Conference on Computing (CIC 2006)","author":"J. Oetsch","year":"2006","unstructured":"Oetsch, J., Seidl, M., Tompits, H., Woltran, S.: ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming. In: Proc. of the 15th International Conference on Computing (CIC 2006), pp. 3\u201310. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"16_CR2","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 Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"issue":"4","key":"16_CR3","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 TOCL\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM TOCL"},{"key":"16_CR4","unstructured":"Eiter, T., Tompits, H., Woltran, S.: On Solution Correspondences in Answer Set Programming. In: Proc. of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 97\u2013102 (2005)"},{"key":"16_CR5","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.\u00a02916, pp. 224\u2013238. Springer, Heidelberg (2003)"},{"key":"16_CR6","first-page":"458","volume-title":"Proc. of the 22nd National Conference on Artificial Intelligence (AAAI 2007)","author":"J. Oetsch","year":"2007","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: Proc. of the 22nd National Conference on Artificial Intelligence (AAAI 2007), pp. 458\u2013464. AAAI Press, Menlo Park (2007)"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","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, vol.\u00a02923, pp. 87\u201399. Springer, Heidelberg (2003)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-27775-0_15","volume-title":"Logic Programming","author":"D. Pearce","year":"2004","unstructured":"Pearce, D.: Simplifying Logic Programs under Answer Set Semantics. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 210\u2013224. Springer, Heidelberg (2004)"},{"key":"16_CR9","unstructured":"Lin, F., Chen, Y.: Discovering Classes of Strongly Equivalent Logic Programs. In: Proc. of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 516\u2013521 (2005)"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/11527695_28","volume-title":"Theory and Applications of Satisfiability Testing","author":"D. Berre Le","year":"2005","unstructured":"Le Berre, D., Narizzano, M., Simon, L., Tacchella, A.: The second QBF solvers comparative evaluation. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 376\u2013392. Springer, Heidelberg (2005)"},{"key":"16_CR11","unstructured":"Oetsch, J., Seidl, M., Tompits, H., Woltran, S.: An Extension of the System cc\u2009\u22a4\u2009 for Testing Relativised Uniform Equivalence under Answer-Set Projection. In: Proc. of the 16th International Conference on Computing (CIC 2007) (to appear, 2007)"},{"key":"16_CR12","unstructured":"Zolda, M.: Comparing Different Prenexing Strategies for Quantified Boolean Formulas, Master\u2019s Thesis, Vienna University of Technology (2004)"},{"key":"16_CR13","unstructured":"Egly, U., Seidl, M., Woltran, S.: A Solver for QBFs in Nonprenex Form. In: Proc. of the 17th European Conference on Artificial Intelligence (ECAI 2006), pp. 477\u2013481 (2006)"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-24609-1_17","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"E. Oikarinen","year":"2003","unstructured":"Oikarinen, E., Janhunen, T.: Verifying the Equivalence of Logic Programs in the Disjunctive Case. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS, vol.\u00a02923, pp. 180\u2013193. Springer, Heidelberg (2003)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/11546207_43","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Y. Chen","year":"2005","unstructured":"Chen, Y., Lin, F., Li, L.: SELP - A system for studying strong equivalence between logic programs. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS, vol.\u00a03662, pp. 442\u2013446. Springer, Heidelberg (2005)"}],"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-00675-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T16:07:28Z","timestamp":1551974848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00675-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642006746","9783642006753"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00675-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}