{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:26:40Z","timestamp":1725514000977},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540721994"},{"type":"electronic","value":"9783540722007"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72200-7_12","type":"book-chapter","created":{"date-parts":[[2007,6,5]],"date-time":"2007-06-05T12:54:47Z","timestamp":1181048087000},"page":"123-135","source":"Crossref","is-referenced-by-count":3,"title":["Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains"],"prefix":"10.1007","author":[{"given":"Michael","family":"Fink","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinhard","family":"Pichler","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":"12_CR1","first-page":"695","volume-title":"Proc. AAAI\u201905","author":"T. Eiter","year":"2005","unstructured":"Eiter, T., et al.: Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. In: Proc. AAAI\u201905, pp. 695\u2013700. AAAI Press, Menlo Park (2005)"},{"issue":"4","key":"12_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"},{"issue":"3","key":"12_CR3","first-page":"167","volume":"38","author":"S. Brass","year":"1999","unstructured":"Brass, S., Dix, J.: Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming\u00a038(3), 167\u2013213 (1999)","journal-title":"Journal of Logic Programming"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45607-4_4","volume-title":"Logic Based Program Synthesis and Transformation","author":"M. Osorio","year":"2002","unstructured":"Osorio, M., Navarro, J.A., Arrazola, J.: Equivalence in Answer Set Programming. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol.\u00a02372, pp. 57\u201375. Springer, Heidelberg (2002)"},{"key":"12_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-540-30227-8_17","volume-title":"Logics in Artificial Intelligence","author":"K. Inoue","year":"2004","unstructured":"Inoue, K., Sakama, C.: Equivalence of Logic Programs Under Updates. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 174\u2013186. Springer, Heidelberg (2004)"},{"key":"12_CR6","unstructured":"Lin, F., Chen, Y.: Discovering Classes of Strongly Equivalent Logic Programs. In: Proc. IJCAI\u201905, pp. 516\u2013521 (2005)"},{"key":"12_CR7","first-page":"340","volume-title":"Proc. KR\u201906","author":"T. Eiter","year":"2006","unstructured":"Eiter, T., et al.: Replacements in Non-Ground Answer-Set Programming. In: Proc. KR\u201906, pp. 340\u2013351. AAAI Press, Menlo Park (2006)"},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF00243794","volume":"3","author":"J.L. Lassez","year":"1987","unstructured":"Lassez, J.L., Marriott, K.: Explicit Representation of Terms Defined by Counter Examples. Journal of Automated Reasoning\u00a03(3), 301\u2013317 (1987)","journal-title":"Journal of Automated Reasoning"},{"key":"12_CR9","first-page":"219","volume-title":"Proc. ICLP\u201987","author":"K. Kunen","year":"1987","unstructured":"Kunen, K.: Answer Sets and Negation as Failure. In: Proc. ICLP\u201987, pp. 219\u2013228. MIT Press, Cambridge (1987)"},{"issue":"4","key":"12_CR10","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BF01893885","volume":"28","author":"D. Kapur","year":"1991","unstructured":"Kapur, D., et al.: Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Informatica\u00a028(4), 311\u2013350 (1991)","journal-title":"Acta Informatica"},{"key":"12_CR11","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":"12_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/1055686.1055690","volume":"6","author":"K. Wang","year":"2005","unstructured":"Wang, K., Zhou, L.: Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs. ACM Transactions on Computational Logic\u00a06(2), 295\u2013327 (2005)","journal-title":"ACM Transactions on Computational Logic"},{"key":"12_CR14","unstructured":"Traxler, P.: Techniques for Simplifying Disjunctive Datalog Programs with Negation. Master\u2019s thesis, Technische Universit\u00e4t Wien, Institut f\u00fcr Informationssysteme (2006)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/10703163_24","volume-title":"Computer Science Logic","author":"R. Pichler","year":"1999","unstructured":"Pichler, R.: On the Complexity of H-Subsumption. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol.\u00a01584, pp. 355\u2013371. Springer, Heidelberg (1999)"},{"key":"12_CR16","first-page":"377","volume-title":"Proc. KR\u201904","author":"T. Eiter","year":"2004","unstructured":"Eiter, T., et al.: Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. In: Proc. KR\u201904, pp. 377\u2013387. AAAI Press, Menlo Park (2004)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Vardi, M.: On the Complexity of Bounded-Variable Queries. In: Proc. PODS\u201995, pp. 266\u2013276 (1995)","DOI":"10.1145\/212433.212474"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72200-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:44:33Z","timestamp":1558259073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72200-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540721994","9783540722007"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72200-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}