{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:49:17Z","timestamp":1725572957485},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255604"},{"type":"electronic","value":"9783540321248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11415763_9","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T19:42:42Z","timestamp":1292874162000},"page":"134-148","source":"Crossref","is-referenced-by-count":0,"title":["Solving Alternating Boolean Equation Systems in Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Misa","family":"Kein\u00e4nen","sequence":"first","affiliation":[]},{"given":"Ilkka","family":"Niemel\u00e4","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(94)90266-6","volume":"126","author":"H.R. Andersen","year":"1994","unstructured":"Andersen, H.R.: Model checking and Boolean graphs. Theoretical Computer Science\u00a0126, 3\u201330 (1994)","journal-title":"Theoretical Computer Science"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0020-0190(88)90029-4","volume":"29","author":"A. Arnold","year":"1988","unstructured":"Arnold, A., Crubille, P.: A linear algorithm to solve fixed-point equations on transition systems. Information Processing Letters\u00a029, 57\u201366 (1988)","journal-title":"Information Processing Letters"},{"key":"9_CR3","series-title":"Studies in Logic and the foundations of mathematics","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(01)80001-X","volume-title":"Rudiments of \u03bc-calculus","author":"A. Arnold","year":"2001","unstructured":"Arnold, A., Niwinski, D.: Rudiments of \u03bc-calculus. Studies in Logic and the foundations of mathematics, vol.\u00a0146. Elsevier, Amsterdam (2001)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-61042-1_41","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Bhat","year":"1996","unstructured":"Bhat, G., Cleaveland, R.: Efficient local model-checking for fragments of the modal \u03bc-calculus. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 107\u2013126. Springer, Heidelberg (1996)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-49059-0_16","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"G. Delzanno","year":"1999","unstructured":"Delzanno, G., Podelski, A.: Model checking in CLP. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 223\u2013239. Springer, Heidelberg (1999)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-56922-7_32","volume-title":"Computer Aided Verification","author":"E.A. Emerson","year":"1993","unstructured":"Emerson, E.A., Jutla, C., Sistla, A.P.: On model checking for fragments of the \u03bc-calculus. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 385\u2013396. Springer, Heidelberg (1993)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"E.A. Emerson","year":"2001","unstructured":"Emerson, E.A., Jutla, C., Sistla, A.P.: On model checking for the \u03bc-calculus and its fragments. Theoretical Computer Science\u00a0258, 491\u2013522 (2001)","journal-title":"Theoretical Computer Science"},{"key":"9_CR8","first-page":"1070","volume-title":"Proceedings of the 5th International Conference on Logic Programming","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the 5th International Conference on Logic Programming, Seattle, USA, August 1988, pp. 1070\u20131080. The MIT Press, Cambridge (1988)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-540-24730-2_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.F. Groote","year":"2004","unstructured":"Groote, J.F., Kein\u00e4nen, M.: Solving Disjunctive\/Conjunctive Boolean Equation Systems with Alternating Fixed Points. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 436\u2013450. Springer, Heidelberg (2004)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1017\/S1471068403001790","volume":"3","author":"K. Heljanko","year":"2003","unstructured":"Heljanko, K., Niemel\u00e4, I.: Bounded LTL model checking with stable models. Theory and Practice of Logic Programming\u00a03, 519\u2013550 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M. Jurdzinski","year":"1998","unstructured":"Jurdzinski, M.: Deciding the winner in parity games is in UP\u2009\u2229\u2009co\u2009\u2212\u2009UP. Information Processing Letters\u00a068, 119\u2013124 (1998)","journal-title":"Information Processing Letters"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. Theoretical Computer Science\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/3-540-45635-X_23","volume-title":"Logic Programming","author":"K.N. Kumar","year":"2001","unstructured":"Kumar, K.N., Ramakrishnan, C.R., Smolka, S.A.: Alternating fixed points in Boolean equation systems as preferred stable models. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 227\u2013241. Springer, Heidelberg (2001)"},{"key":"9_CR14","first-page":"25","volume-title":"Proceedings of the 16th International Conference on Logic Programming","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V.: Answer Set Planning. In: Proceedings of the 16th International Conference on Logic Programming, pp. 25\u201337. The MIT Press, Cambridge (1999)"},{"key":"9_CR15","first-page":"23","volume-title":"Proceedings of the Eleventh International Conference on Logic Programming","author":"V. Lifschitz","year":"1994","unstructured":"Lifschitz, V., Turner, H.: Splitting a Logic Program. In: Proceedings of the Eleventh International Conference on Logic Programming, pp. 23\u201337. The MIT Press, Cambridge (1994)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BFb0054161","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"X. Liu","year":"1998","unstructured":"Liu, X., Ramakrishnan, C.R., Smolka, S.A.: Fully Local and Efficient Evaluation of Alternating Fixed Points. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol.\u00a01384, pp. 5\u201319. Springer, Heidelberg (1998)"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BFb0055040","volume-title":"Automata, Languages and Programming","author":"X. Liu","year":"1998","unstructured":"Liu, X., Smolka, S.A.: Simple Linear-Time Algorithms for Minimal Fixed Points. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 53\u201366. Springer, Heidelberg (1998)"},{"key":"9_CR18","unstructured":"Mader, A.: Verification of Modal Properties using Boolean Equation Systems. PhD thesis, Technical University of Munich (1997)"},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-642-60085-2_17","volume-title":"The Logic Programming Paradigm: a 25-Year Perspective","author":"W. Marek","year":"1999","unstructured":"Marek, W., Truszczy\u0144ski, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375\u2013398. Springer, Heidelberg (1999)"},{"issue":"3,4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and Artificial Intelligence\u00a025(3,4), 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9_CR21","volume-title":"Computational Complexity","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"issue":"1\u20132","key":"9_CR22","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(1\u20132), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","first-page":"302","volume-title":"Automata, Languages, and Programming","author":"B. Vergauwen","year":"1994","unstructured":"Vergauwen, B., Lewi, J.: Efficient local correctness checking for single and alternating Boolean equation systems. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 302\u2013315. Springer, Heidelberg (1994)"}],"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\/11415763_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:37Z","timestamp":1619507017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11415763_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255604","9783540321248"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11415763_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}