{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:29:02Z","timestamp":1725550142875},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292081"},{"type":"electronic","value":"9783540319474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11562931_16","type":"book-chapter","created":{"date-parts":[[2005,10,8]],"date-time":"2005-10-08T13:28:42Z","timestamp":1128778122000},"page":"189-203","source":"Crossref","is-referenced-by-count":6,"title":["Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming"],"prefix":"10.1007","author":[{"given":"Hans","family":"Tompits","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","first-page":"773","volume-title":"Proc. ECAI 2004","author":"O. Arieli","year":"2004","unstructured":"Arieli, O.: Paraconsistent Preferential Reasoning by Signed Quantified Boolean Formulae. In: Proc. ECAI 2004, pp. 773\u2013777. IOS Press, Amsterdam (2004)"},{"issue":"4","key":"16_CR2","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1093\/logcom\/13.4.557","volume":"13","author":"O. Arieli","year":"2003","unstructured":"Arieli, O., Denecker, M.: Reducing Preferential Paraconsistent Reasoning to Classical Entailment. Journal of Logic and Computation\u00a013(4), 557\u2013580 (2003)","journal-title":"Journal of Logic and Computation"},{"key":"16_CR3","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":"16_CR4","unstructured":"Coste-Marquis, S., Fargier, H., Lang, J., Le Berre, D., Marquis, P.: Function Problems for Quantified Boolean Formulas. Technical Report 2003-15-R, Institut de Recherche en Informatique de Toulouse, IRIT (2003), Available at http:\/\/www.cril.univ-artois.fr\/asqbf\/pub\/files\/qbfeng7.pdf"},{"issue":"6","key":"16_CR5","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1093\/logcom\/14.6.801","volume":"14","author":"J. Delgrande","year":"2004","unstructured":"Delgrande, J., Schaub, T., Tompits, H., Woltran, S.: On Computing Solutions to Belief Change Scenarios. Journal of Logic and Computation\u00a014(6), 801\u2013826 (2004)","journal-title":"Journal of Logic and Computation"},{"key":"16_CR6","unstructured":"Egly, U., Eiter, T., Tompits, H., Woltran, S.: Solving Advanced Reasoning Tasks using Quantified Boolean Formulas. In: Proc. AAAI 2000, pp. 417\u2013422. AAAI Press\/MIT Press (2000)"},{"issue":"1\u20134","key":"16_CR7","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10472-005-0434-4","volume":"43","author":"U. Egly","year":"2005","unstructured":"Egly, U., Pichler, R., Woltran, S.: On Deciding Subsumption Problems. Annals of Mathematics and Artificial Intelligence\u00a043(1\u20134), 255\u2013294 (2005)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-24605-3_17","volume-title":"Theory and Applications of Satisfiability Testing","author":"U. Egly","year":"2004","unstructured":"Egly, U., Seidl, M., Tompits, H., Woltran, S., Zolda, M.: Comparing Different Prenexing Strategies for Quantified Boolean Formulas. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 214\u2013228. Springer, Heidelberg (2004)"},{"key":"16_CR9","first-page":"377","volume-title":"Proc. KR 2004","author":"T. Eiter","year":"2004","unstructured":"Eiter, T., Faber, W., Fink, M., Pfeifer, G., Woltran, S.: Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. In: Proc. KR 2004, pp. 377\u2013387. AAAI Press, Menlo Park (2004)"},{"key":"16_CR10","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_CR11","unstructured":"Eiter, T., Fink, M., Woltran, S.: Semantical Characterizations and Complexity of Equivalences in Answer Set Programming. Technical Report INFSYS RR-1843-05-01, Institut f\u00fcr Informationssysteme, Technische Universit\u00e4t Wien, Austria, To appear in ACM Transactions on Computational Logic (2005)"},{"key":"16_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-45616-3_8","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"T. Eiter","year":"2002","unstructured":"Eiter, T., Klotz, V., Tompits, H., Woltran, S.: Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. In: Egly, U., Ferm\u00fcller, C. (eds.) TABLEAUX 2002. LNCS (LNAI), vol.\u00a02381, pp. 100\u2013114. Springer, Heidelberg (2002)"},{"key":"16_CR13","unstructured":"Eiter, T., Tompits, H., Woltran, S.: On Solution Correspondences in Answer Set Programming. In: Proc. IJCAI 2005 (2005)"},{"key":"16_CR14","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":"16_CR15","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":"16_CR16","doi-asserted-by":"crossref","unstructured":"Le Berre, D., Narizzano, M., Simon, L., Tacchella, A.: The Second QBF Solvers Comparative Evaluation (2004), Available at http:\/\/www.qbflib.org\/","DOI":"10.1007\/11527695_28"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-540-24605-3_35","volume-title":"Theory and Applications of Satisfiability Testing","author":"D. Berre Le","year":"2004","unstructured":"Le Berre, D., Simon, L., Tacchella, A.: Challenges in the QBF Arena: the SAT 2003 Evaluation of QBF Solvers. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 468\u2013485. Springer, Heidelberg (2004)"},{"key":"16_CR18","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. Technical Report cs.AI\/0211004, arXiv.org. To appear in ACM Transactions on Computational Logic"},{"key":"16_CR19","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)"},{"issue":"4","key":"16_CR20","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":"16_CR21","first-page":"170","volume-title":"Proc. KR 2002","author":"F. Lin","year":"2002","unstructured":"Lin, F.: Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. In: Proc. KR 2002, pp. 170\u2013176. Morgan Kaufmann, San Francisco (2002)"},{"key":"16_CR22","unstructured":"Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. In: Proc. AAAI 2002, pp. 112\u2013117. AAAI Press \/ MIT Press (2002)"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","first-page":"180","volume-title":"Proc. LPNMR 2004","author":"E. Oikarinen","year":"2004","unstructured":"Oikarinen, E., Janhunen, T.: Verifying the Equivalence of Logic Programs in the Disjunctive Case. In: Proc. LPNMR 2004. LNCS, vol.\u00a02923, pp. 180\u2013193. Springer, Heidelberg (2004)"},{"key":"16_CR24","series-title":"Lecture Notes in Artificial Intelligence","first-page":"306","volume-title":"Progress in Artificial Intelligence. Knowledge Extraction, Multi-agent Systems, Logic Programming, and Constraint Solving","author":"D. Pearce","year":"2001","unstructured":"Pearce, D., Tompits, H., Woltran, S.: Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS (LNAI), vol.\u00a02258, pp. 306\u2013320. Springer, Heidelberg (2001)"},{"key":"16_CR25","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1613\/jair.591","volume":"10","author":"J. Rintanen","year":"1999","unstructured":"Rintanen, J.: Constructing Conditional Plans by a Theorem Prover. Journal of Artificial Intelligence Research\u00a010, 323\u2013352 (1999)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"16_CR26","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, 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"issue":"4-5","key":"16_CR27","first-page":"602","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(4-5), 602\u2013622 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"16_CR28","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)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11562931_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:52:06Z","timestamp":1605642726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11562931_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292081","9783540319474"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11562931_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}