{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:04:04Z","timestamp":1756382644042},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322105"},{"type":"electronic","value":"9783642322112"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-32211-2_5","type":"book-chapter","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T00:27:23Z","timestamp":1342830443000},"page":"57-72","source":"Crossref","is-referenced-by-count":9,"title":["Automata-Based Computation of Temporal Equilibrium Models"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Cabalar","sequence":"first","affiliation":[]},{"given":"St\u00e9phane","family":"Demri","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-540-87803-2_3","volume-title":"Logics in Artificial Intelligence","author":"F. Aguado","year":"2008","unstructured":"Aguado, F., Cabalar, P., P\u00e9rez, G., Vidal, C.: Strongly Equivalent Temporal Logic Programs. In: H\u00f6lldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol.\u00a05293, pp. 8\u201320. Springer, Heidelberg (2008)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-20895-9_9","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"F. Aguado","year":"2011","unstructured":"Aguado, F., Cabalar, P., P\u00e9rez, G., Vidal, C.: Loop Formulas for Splitable Temporal Logic Programs. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol.\u00a06645, pp. 80\u201392. Springer, Heidelberg (2011)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-642-04238-6_55","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"G. Boenn","year":"2009","unstructured":"Boenn, G., Brain, M., De Vos, M., Ffitch, J.: ANTON: Composing Logic and Logic Composing. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 542\u2013547. Springer, Heidelberg (2009)"},{"key":"5_CR4","unstructured":"B\u00fcchi, R.: On a decision method in restricted second-order arithmetic. In: Intl. Congress on Logic, Method and Philosophical Science 1960, pp. 1\u201311 (1962)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-642-15675-5_8","volume-title":"Logics in Artificial Intelligence","author":"P. Cabalar","year":"2010","unstructured":"Cabalar, P.: A Normal Form for Linear Temporal Equilibrium Logic. In: Janhunen, T., Niemel\u00e4, I. (eds.) JELIA 2010. LNCS, vol.\u00a06341, pp. 64\u201376. Springer, Heidelberg (2010)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-20895-9_43","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P. Cabalar","year":"2011","unstructured":"Cabalar, P., Di\u00e9guez, M.: STeLP \u2013 A Tool for Temporal Answer Set Programming. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol.\u00a06645, pp. 370\u2013375. Springer, Heidelberg (2011)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Demri, S., Gastin, P.: Specification and verification using temporal logics. In: Modern Applications of Automata Theory. IIsc Research Monographs, vol.\u00a02. World Scientific (2011) (to appear)","DOI":"10.1142\/9789814271059_0015"},{"key":"5_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11546207_10","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"P. Ferraris","year":"2005","unstructured":"Ferraris, P.: Answer Sets for Propositional Theories. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS (LNAI), vol.\u00a03662, pp. 119\u2013131. Springer, Heidelberg (2005)"},{"key":"5_CR9","first-page":"1070","volume-title":"ICLP 1988","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP 1988, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-11503-5_5","volume-title":"Practical Aspects of Declarative Languages","author":"G. Grasso","year":"2010","unstructured":"Grasso, G., Iiritano, S., Leone, N., Lio, V., Ricca, F., Scalise, F.: An ASP-Based System for Team-Building in the Gioia-Tauro Seaport. In: Carro, M., Pe\u00f1a, R. (eds.) PADL 2010. LNCS, vol.\u00a05937, pp. 40\u201342. Springer, Heidelberg (2010)"},{"key":"5_CR11","unstructured":"Heyting, A.: Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie der Wissenschaften, Physikalisch-mathematische Klasse, 42\u201356 (1930)"},{"key":"5_CR12","unstructured":"Kautz, H.: The logic of persistence. In: AAAI 1986, pp. 401\u2013405 (1986)"},{"key":"5_CR13","unstructured":"Leone, N., Eiter, T., Faber, W., Fink, M., Gottlob, G., Greco, G.: Boosting information integration: The INFOMIX system. In: Proc. of the 13th Italian Symposium on Advanced Database Systems, SEBD 2005, pp. 55\u201366 (2005)"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: A hierarchy of temporal properties. In: PODC 1990, pp. 377\u2013408. ACM Press (1990)","DOI":"10.1145\/93385.93442"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Marek, V., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm, pp. 169\u2013181. Springer (1999)","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"5_CR16","unstructured":"McCarthy, J.: Elaboration tolerance. In: Proc. of the 4th Symposium on Logical Formalizations of Commonsense Reasoning (Common Sense 1998), London, UK, pp. 198\u2013217 (1998)"},{"key":"5_CR17","first-page":"463","volume":"4","author":"J. McCarthy","year":"1969","unstructured":"McCarthy, J., Hayes, P.: Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence Journal\u00a04, 463\u2013512 (1969)","journal-title":"Machine Intelligence Journal"},{"key":"5_CR18","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, 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-45241-9_12","volume-title":"Practical Aspects of Declarative Languages","author":"M. Nogueira","year":"2001","unstructured":"Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-Prolog Decision Support System for the Space Shuttle. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol.\u00a01990, pp. 169\u2013183. Springer, Heidelberg (2001)"},{"key":"5_CR20","series-title":"LNCS(LNAI)","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BFb0023801","volume-title":"Non-Monotonic Extensions of Logic Programming","author":"D. Pearce","year":"1997","unstructured":"Pearce, D.: A New Logical Characterisation of Stable Models and Answer Sets. In: Dix, J., Przymusinski, T.C., Moniz Pereira, L. (eds.) NMELP 1996. LNCS(LNAI), vol.\u00a01216, pp. 57\u201370. Springer, Heidelberg (1997)"},{"key":"5_CR21","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words: Automata, Semigroups, Logic and Games. Elsevier (2004)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: FOCS 1977, pp. 46\u201357. IEEE (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"5_CR23","unstructured":"Safra, S.: Complexity of Automata on Infinite Objects. PhD thesis, The Weizmann Institute of Science, Rehovot (1989)"},{"issue":"2","key":"5_CR24","first-page":"177","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. JCSS\u00a04(2), 177\u2013192 (1970)","journal-title":"JCSS"},{"issue":"3","key":"5_CR25","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"A. Sistla","year":"1985","unstructured":"Sistla, A., Clarke, E.: The complexity of propositional linear temporal logic. JACM\u00a032(3), 733\u2013749 (1985)","journal-title":"JACM"},{"key":"5_CR26","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","volume":"49","author":"A. Sistla","year":"1987","unstructured":"Sistla, A., Vardi, M., Wolper, P.: The complementation problem for B\u00fcchi automata with applications to temporal logic. TCS\u00a049, 217\u2013237 (1987)","journal-title":"TCS"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/3-540-63104-6_19","volume-title":"Automated Deduction - CADE-14","author":"M. Vardi","year":"1997","unstructured":"Vardi, M.: Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics. In: McCune, W. (ed.) CADE 1997. LNCS, vol.\u00a01249, pp. 191\u2013206. Springer, Heidelberg (1997)"},{"key":"5_CR28","first-page":"183","volume":"32","author":"M. Vardi","year":"1986","unstructured":"Vardi, M., Wolper, P.: Automata-theoretic techniques for modal logics of programs. JCSS\u00a032, 183\u2013221 (1986)","journal-title":"JCSS"},{"key":"5_CR29","first-page":"1","volume":"115","author":"M. Vardi","year":"1994","unstructured":"Vardi, M., Wolper, P.: Reasoning about infinite computations. I & C\u00a0115, 1\u201337 (1994)","journal-title":"I & C"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-540-45138-9_26","volume-title":"Mathematical Foundations of Computer Science 2003","author":"I. \u010cern\u00e1","year":"2003","unstructured":"\u010cern\u00e1, I., Pel\u00e1nek, R.: Relating Hierarchy of Temporal Properties to Model Checking. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 318\u2013327. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32211-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:01:28Z","timestamp":1558314088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32211-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322105","9783642322112"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32211-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}