{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:42:02Z","timestamp":1725486122036},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429357"},{"type":"electronic","value":"9783540456353"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45635-x_23","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T21:27:34Z","timestamp":1181165254000},"page":"227-241","source":"Crossref","is-referenced-by-count":1,"title":["Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models"],"prefix":"10.1007","author":[{"given":"K.","family":"Narayan Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. R.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. A.","family":"Smolka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,13]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"G. Brewka and T. Eiter. Preferredansw er sets for extendedlogic programs. Arti-ficial Intelligence, 109(1\u20132)297\u2013356.","DOI":"10.1016\/S0004-3702(99)00015-6"},{"key":"23_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Proceedings of the Workshop on Logic of Programs","author":"E. M. Clarke","year":"1981","unstructured":"E. M. Clarke and E. A. Emerson. Design andsyn thesis of synchronization skeletons using branching-time temporal logic. In D. Kozen, editor, Proceedings of the Workshop on Logic of Programs, Yorktown Heights, volume 131 of Lecture Notes in Computer Science, pages 52\u201371. Springer Verlag, 1981."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. ACM TOPLAS, 8(2), 1986.","DOI":"10.1145\/5397.5399"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"E. M. Clarke and J. M. Wing. Formal methods: State of the art andfuture directions. ACM Computing Surveys, 28(4), December 1996.","DOI":"10.1145\/242223.242257"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF01383878","volume":"2","author":"R. Cleavelandand","year":"1993","unstructured":"R. Cleavelandand B. U. Steffen. A linear-time model checking algorithm for the alternation-free modal mu-calculus. Formal Methods in System Design, 2:121\u2013147, 1993.","journal-title":"Formal Methods in System Design"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"G. Delzanno and A. Podelski. Model checking in CLP. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 223\u2013239, 1999.","DOI":"10.1007\/3-540-49059-0_16"},{"key":"23_CR7","unstructured":"M. Gelfondand V. Lifschitz. The stable model semantics for logic programming. In International Conference on Logic Programming, pages 1070\u20131080, 1988."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen. Results on the propositional \u03bc-calculus. Theoretical Computer Science, 27:333\u2013354, 1983.","journal-title":"Theoretical Computer Science"},{"key":"23_CR9","series-title":"Technical report","volume-title":"Alternating fixed points in boolean equation systems as preferredstable models","author":"K. Narayan Kumar","year":"2001","unstructured":"K. Narayan Kumar, C.R. Ramakrishnan, and S. A. Smolka. Alternating fixed points in boolean equation systems as preferredstable models. Technical report, Department of Computer Science, SUNY at Stony Brook, Stony Brook, New York, 2001. Available from: http:\/\/www.cs.sunysb.edu\/~cram\/papers ."},{"key":"23_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/BFb0054161","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"X. Liu","year":"1998","unstructured":"Xinxin Liu, C. R. Ramakrishnan, and Scott A. Smolka. Fully local andeficien t model checking of alternating fixed points. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1384 of Lecture Notes in Computer Science, pages 56\u201370. Springer Verlag, 1998."},{"key":"23_CR11","unstructured":"A. Mader. Verification of Modal Properties using Boolean Equations. PhD thesis, Technical University of Munich, 1997."},{"key":"23_CR12","unstructured":"I. Niemela and P. Simons. Efficient implementation of the well-foundedandstable model semantics. In Joint International Conference and Symposium on Logic Programming, pages 289\u2013303, 1996."},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"V. R. Pratt. A decidable mu-calculus. In Proceedings of the 22nd IEEE Ann. Symp. on Foundations of Computer Science, Nashville, Tennessee, pages 421\u2013427, 1981.","DOI":"10.1109\/SFCS.1981.4"},{"key":"23_CR14","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the International Symposium in Programming","author":"J. P. Queille","year":"1982","unstructured":"J. P. Queille and J. Sifakis. Specification andv erification of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, volume 137 of Lecture Notes in Computer Science, Berlin, 1982. Springer-Verlag."},{"key":"23_CR15","volume-title":"Proceedings of the 9th International Conference on Computer-Aided Verification (CAV\u2019 97)","author":"Y. S. Ramakrishna","year":"1997","unstructured":"Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. L. Swift, andD. S. Warren. Efficient model checking using tabledresolution. In Proceedings of the 9th International Conference on Computer-Aided Verification (CAV\u2019 97), Haifa, Israel, July 1997. Springer-Verlag."},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, Y. Dong, X. Du, A. Roychoudhury, and V.N. Venkatakrishnan. XMC: A logic-programming-basedv eri.-cation toolset. In Computer Aided Verification (CAV), 2000.","DOI":"10.1007\/10722167_48"},{"key":"23_CR17","unstructured":"C. Sakama and K. Inoue. Representing priorities in logic programs. In Joint International Conference\/Symposium on Logic Programming, pages 82\u201396, 1996."},{"key":"23_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/3-540-58201-0_77","volume-title":"Proceedings of ICALP\u201994","author":"B. Vergauwen","year":"1994","unstructured":"B. Vergauwen and J. Lewi. Efficient local correctness checking for single and alternating boolean equation systems. In Proceedings of ICALP\u201994, pages 304\u2013315. LNCS 820, 1994."}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45635-X_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:41:28Z","timestamp":1556466088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45635-X_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429357","9783540456353"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45635-x_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}