{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:48:10Z","timestamp":1725536890616},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_32","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T04:23:01Z","timestamp":1251692581000},"page":"382-395","source":"Crossref","is-referenced-by-count":2,"title":["cc\u22a4 on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Oetsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martina","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","first-page":"3","volume-title":"Proc. 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. CIC 2006, pp. 3\u201310. IEEE, Los Alamitos (2006)"},{"issue":"4","key":"32_CR2","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":"32_CR3","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":"32_CR4","unstructured":"Eiter, T., Tompits, H., Woltran, S.: On Solution Correspondences in Answer Set Programming. In: Proc. IJCAI 2005, pp. 97\u2013102 (2005)"},{"key":"32_CR5","series-title":"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.\u00a03229, pp. 161\u2013173. Springer, Heidelberg (2004)"},{"key":"32_CR6","first-page":"458","volume-title":"Proc. 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. AAAI 2007, pp. 458\u2013464. AAAI Press, Menlo Park (2007)"},{"issue":"1-2","key":"32_CR7","first-page":"99","volume":"12","author":"T. Eiter","year":"1999","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G.: The Diagnosis Frontend of the DLV System. AI Communications\u00a012(1-2), 99\u2013111 (1999)","journal-title":"AI Communications"},{"key":"32_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 Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11562931_16","volume-title":"Logic Programming","author":"H. Tompits","year":"2005","unstructured":"Tompits, H., Woltran, S.: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 189\u2013203. Springer, Heidelberg (2005)"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-30597-2_4","volume-title":"Inconsistency Tolerance","author":"P. Besnard","year":"2005","unstructured":"Besnard, P., Schaub, T., Tompits, H., Woltran, S.: Representing Paraconsistent Reasoning via Quantified Propositional Logic. In: Bertossi, L., Hunter, A., Schaub, T. (eds.) Inconsistency Tolerance. LNCS, vol.\u00a03300, pp. 84\u2013118. Springer, Heidelberg (2005)"},{"key":"32_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-45616-3_12","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"R. Letz","year":"2002","unstructured":"Letz, R.: Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, pp. 160\u2013175. Springer, Heidelberg (2002)"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0004-3702(02)00373-9","volume":"145","author":"E. Giunchiglia","year":"2003","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: Backjumping for Quantified Boolean Logic Satisfiability. Artificial Intelligence\u00a0145, 99\u2013120 (2003)","journal-title":"Artificial Intelligence"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11527695_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"A. Biere","year":"2005","unstructured":"Biere, A.: Resolve and Expand. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol.\u00a03542, pp. 59\u201370. Springer, Heidelberg (2005)"},{"issue":"1","key":"32_CR14","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s10601-008-9055-y","volume":"14","author":"U. Egly","year":"2009","unstructured":"Egly, U., Seidl, M., Woltran, S.: A Solver for QBFs in Negation Normal Form. Constraints\u00a014(1), 38\u201379 (2009)","journal-title":"Constraints"},{"issue":"1","key":"32_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R. Reiter","year":"1987","unstructured":"Reiter, R.: A Theory of Diagnosis from First Principles. Artificial Intelligence\u00a032(1), 57\u201395 (1987)","journal-title":"Artificial Intelligence"},{"key":"32_CR16","series-title":"Lecture Notes in Artificial Intelligence","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":"2004","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 (LNAI), vol.\u00a02923, pp. 180\u2013193. Springer, Heidelberg (2004)"},{"key":"32_CR17","series-title":"Lecture Notes in Artificial Intelligence","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 (LNAI), vol.\u00a03662, pp. 442\u2013446. Springer, Heidelberg (2005)"},{"key":"32_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/11546207_42","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"2005","unstructured":"Eiter, T., Faber, W., Traxler, P.: Testing Strong Equivalence of Datalog Programs - Implementation and Examples. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 437\u2013441. Springer, Heidelberg (2005)"}],"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_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T11:23:23Z","timestamp":1552130603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04238-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042379","9783642042386"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04238-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}