{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:35:12Z","timestamp":1725748512247},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642405631"},{"type":"electronic","value":"9783642405648"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40564-8_3","type":"book-chapter","created":{"date-parts":[[2013,9,12]],"date-time":"2013-09-12T11:21:30Z","timestamp":1378984890000},"page":"23-35","source":"Crossref","is-referenced-by-count":5,"title":["Integrating Temporal Extensions of Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Felicidad","family":"Aguado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilberto","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Concepci\u00f3n","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G. Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczynski, M.: Answer set programming at a glance. Communications of the ACM\u00a054, 92\u2013103 (2011)","journal-title":"Communications of the ACM"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF03037381","volume":"4","author":"L.F. Cerro del","year":"1986","unstructured":"del Cerro, L.F.: MOLOG: A system that extends Prolog with modal logic. New Generation Computing\u00a04, 35\u201350 (1986)","journal-title":"New Generation Computing"},{"key":"3_CR3","unstructured":"Gabbay, D.: Modal and temporal logic programming. In: Galton, A. (ed.) Temporal Logics and their Applications, pp. 197\u2013237. Academic Press (1987)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0747-7171(89)80070-7","volume":"8","author":"M. Abadi","year":"1989","unstructured":"Abadi, M., Manna, Z.: Temporal logic programming. Journal of Symbolic Computation\u00a08, 277\u2013295 (1989)","journal-title":"Journal of Symbolic Computation"},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1093\/oso\/9780198537755.003.0003","volume-title":"Intensional Logics for Programming","author":"M. Baudinet","year":"1992","unstructured":"Baudinet, M.: A simple proof of the completeness of temporal logic programming. In: del Cerro, L.F., Penttonen, M. (eds.) Intensional Logics for Programming, pp. 51\u201383. Clarendon Press, Oxford (1992)"},{"key":"3_CR6","unstructured":"Baldoni, M., Giordano, L., Martelli, A.: A framework for a modal logic programming. In: Porc. of the Joint International Conference and Symposium on Logic Programming, pp. 52\u201366 (1996)"},{"key":"3_CR7","unstructured":"Cabalar, P.: Temporal answer sets. In: Proc. of the 1999 Joint Conference on Declarative Programming, APPIA-GULP-PRODE 1999, pp. 351\u2013366 (1999)"},{"key":"3_CR8","first-page":"1070","volume-title":"Logic Programming: Proc. of the Fifth International Conference and Symposium","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K.A. (eds.) Logic Programming: Proc. of the Fifth International Conference and Symposium, vol.\u00a02, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-75867-9_31","volume-title":"Computer Aided Systems Theory \u2013 EUROCAST 2007","author":"P. Cabalar","year":"2007","unstructured":"Cabalar, P., P\u00e9rez Vega, G.: Temporal equilibrium logic: A first approach. In: Moreno D\u00edaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2007. LNCS, vol.\u00a04739, pp. 241\u2013248. Springer, Heidelberg (2007)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Aguado, F., Cabalar, P., Di\u00e9guez, M., P\u00e9rez, G., Vidal, C.: Temporal equilibrium logic: a survey. Journal of Applied Non-Classical Logics (to appear, 2013)","DOI":"10.1080\/11663081.2013.798985"},{"key":"3_CR11","first-page":"201","volume":"13","author":"L. Giordano","year":"2013","unstructured":"Giordano, L., Martelli, A., Dupr\u00e9, D.T.: Reasoning about actions with temporal answer sets. TPLP\u00a013, 201\u2013225 (2013)","journal-title":"TPLP"},{"key":"3_CR12","unstructured":"Giordano, L., Martelli, A., Dupr\u00e9, D.T.: Verification of action theories in ASP: A complete bounded model checking approach. In: Lisi, F.A. (ed.) Proceedings of the 9th Italian Convention on Computational Logic, CILC 2012. CEUR Workshop Proceedings, vol.\u00a0857, pp. 176\u2013190. CEUR-WS.org (2012)"},{"key":"3_CR13","series-title":"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":"3_CR14","unstructured":"Kamp, J.A.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California at Los Angeles (1968)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer (1991)","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0168-0072(98)00039-6","volume":"96","author":"J.G. Henriksen","year":"1999","unstructured":"Henriksen, J.G., Thiagarajan, P.S.: Dynamic linear time temporal logic. Annals of Pure and Applied Logic\u00a096, 187\u2013207 (1999)","journal-title":"Annals of Pure and Applied Logic"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-32211-2_5","volume-title":"Logic-Based Program Synthesis and Transformation","author":"P. Cabalar","year":"2012","unstructured":"Cabalar, P., Demri, S.: Automata-based computation of temporal equilibrium models. In: Vidal, G. (ed.) LOPSTR 2011. LNCS, vol.\u00a07225, pp. 57\u201372. Springer, Heidelberg (2012)"},{"key":"3_CR18","unstructured":"Heyting, A.: Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte der Preussischen Akademie der Wissenschaften, Physikalisch-mathematische Klasse, 42\u201356 (1930)"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0004-3702(87)90043-9","volume":"33","author":"S. Hanks","year":"1987","unstructured":"Hanks, S., McDermott, D.: Nonmonotonic logic and temporal projection. Artificial Intelligence\u00a033, 379\u2013412 (1987)","journal-title":"Artificial Intelligence"},{"key":"3_CR20","first-page":"465","volume":"85","author":"N.N. Vorob\u2019ev","year":"1952","unstructured":"Vorob\u2019ev, N.N.: A constructive propositional calculus with strong negation. Doklady Akademii Nauk SSR\u00a085, 465\u2013468 (1952) (in Russian)","journal-title":"Doklady Akademii Nauk SSR"},{"key":"3_CR21","first-page":"689","volume":"85","author":"N.N. Vorob\u2019ev","year":"1952","unstructured":"Vorob\u2019ev, N.N.: The problem of deducibility in constructive propositional calculus with strong negation. Doklady Akademii Nauk SSR\u00a085, 689\u2013692 (1952) (in Russian)","journal-title":"Doklady Akademii Nauk SSR"},{"key":"3_CR22","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":"3_CR23","unstructured":"Cabalar, P., Di\u00e9guez, M.: ABSTEM \u2013 an automata-based solver for temporal equilibrium models (unpublished draft, 2013)"},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1994.1092","volume":"115","author":"M. Vardi","year":"1994","unstructured":"Vardi, M., Wolper, P.: Reasoning about infinite computations. Information and Computation\u00a0115, 1\u201337 (1994)","journal-title":"Information and Computation"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10472-006-9020-7","volume":"46","author":"L. Giordano","year":"2006","unstructured":"Giordano, L., Martelli, A.: Tableau-based automata construction for dynamic linear time temporal logic. Annals of Mathematics and Artificial Intelligence\u00a046, 289\u2013315 (2006)","journal-title":"Annals of Mathematics and Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40564-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T21:08:08Z","timestamp":1715980088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40564-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642405631","9783642405648"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40564-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}