{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T22:40:10Z","timestamp":1710283210498},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1007\/bf03037535","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T03:19:08Z","timestamp":1240543148000},"page":"87-100","source":"Crossref","is-referenced-by-count":4,"title":["Temporal disjunctive logic programming"],"prefix":"10.1007","volume":"19","author":[{"given":"Manolis","family":"Gergatsoulis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos","family":"Rondogiannis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Themis","family":"Panayiotopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1\u20133","key":"BF03037535_CR1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0743-1066(96)00141-0","volume":"31","author":"C. Baral","year":"1997","unstructured":"Baral, C., Gelfond, M. and Provetti, A., \u201cRepresenting Actions: Laws, Observations and Hypotheses,\u201dThe Journal Of Logic Programming, 31, 1\u20133, pp. 201\u2013244, 1997.","journal-title":"The Journal Of Logic Programming"},{"key":"BF03037535_CR2","doi-asserted-by":"crossref","unstructured":"Baudinet, M., \u201cA Simple Proof of the Completeness of Temporal Logic Programming,\u201d inIntensional Logics for Programming (Del Cerro, L. F. and Penttonen, M. eds.), pp. 51\u201383. Oxford University Press, 1993.","DOI":"10.1093\/oso\/9780198537755.003.0003"},{"issue":"1","key":"BF03037535_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(94)00030-A","volume":"25","author":"J. Chomicki","year":"1995","unstructured":"Chomicki, J., \u201cDepth-bounded Bottom-up Evaluation of Logic Programs,\u201dThe Journal of Logic Programming, 25 1, pp. 1\u201331, 1995.","journal-title":"The Journal of Logic Programming"},{"issue":"3","key":"BF03037535_CR4","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/261124.261126","volume":"22","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G. and Mannila, H., \u201cDisjunctive Datalog,\u201dACM Transactions on Database Systems, 22, 3, pp. 364\u2013418, September 1997.","journal-title":"ACM Transactions on Database Systems"},{"issue":"2","key":"BF03037535_CR5","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0743-1066(93)90035-F","volume":"17","author":"M. Gelfond","year":"1993","unstructured":"Gelfond, M. and Lifschitz, V., \u201cRepresenting Action and Change by Logic Programs,\u201dThe Journal of Logic Programming, 17, 2, 3 and 4, pp. 301\u2013323, 1993.","journal-title":"The Journal of Logic Programming"},{"key":"BF03037535_CR6","unstructured":"Gergatsoulis, M., Rondogiannis, P. and Panayiotopoulos, T., \u201cDisjunctive Chronolog,\u201d inProc. of the JICSLP\u201996 Post-Conference Workshop \u201cMulti-Paradigm Logic Programming\u201d (M. Chacravarty, Y. Guo, and T. Ida, eds.), pp. 129\u2013136, Bonn, 5\u20136 Sept. 1996."},{"key":"BF03037535_CR7","unstructured":"Gergatsoulis, M., Rondogiannis, P. and Panayiotopoulos, T., \u201cProof Procedures for Branching-time Logic Programs,\u201d inProc. of the Tenth International Symposium on Languages for Intensional Programming (ISLIP\u201997) (W. W. Wadge, ed.), May 15\u201317, Victoria BC, Canada, pp. 12\u201326, 1997."},{"key":"BF03037535_CR8","series-title":"Technical Report 15-97","volume-title":"Temporal Disjunctive Logic Programming","author":"M. Gergatsoulis","year":"1997","unstructured":"Gergatsoulis, M., Rondogiannis, P. and Panayiotopoulos, T., \u201cTemporal Disjunctive Logic Programming,\u201d Technical Report 15-97, Dept. of Computer Science, University of Ioannina, Greece, 1997."},{"key":"BF03037535_CR9","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF03037383","volume":"4","author":"R. Kowalski","year":"1986","unstructured":"Kowalski, R. and Sergot, M., \u201cA Logic-based Calculus of Events,\u201dNew Generation Computing, 4, pp. 67\u201395, 1986.","journal-title":"New Generation Computing"},{"key":"BF03037535_CR10","doi-asserted-by":"crossref","unstructured":"Lausen, G., Lud\u00e4scher, B. and May, W., \u201cOn Active Deductive Databases: the Statelog Approach,\u201d inTansactions and Change in Logic Databases (B. Freitag, H. Decker, M. Kifer, and A. Voronkov, eds.), Lecture Notes in Computer Science (LNCS) 1472, pp. 69\u2013106. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0055496"},{"key":"BF03037535_CR11","unstructured":"Levesque, H., Pirri, F. and Reiter, R., \u201cFoundations for the Situation Calculus,\u201dLink\u00f6ping Electronic Articles in Computer and Information Science,3,18, 1998."},{"issue":"1\u20133","key":"BF03037535_CR12","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0743-1066(96)00121-5","volume":"31","author":"H. Levesque","year":"1997","unstructured":"Levesque, H., Reiter, R., Lesp\u00e9rance, Y., Lin, F. and Scherl, R., \u201cGOLOG: A Logic Programming Language for Dymanic Domains,\u201dThe Journal of Logic Programming, 31, 1\u20133, pp 59\u201383, 1997.","journal-title":"The Journal of Logic Programming"},{"key":"BF03037535_CR13","doi-asserted-by":"crossref","unstructured":"Lifschitz, V., \u201cAction Languages, Answer Sets and Planning,\u201d inThe Logic Programming Paradigm: A 25-Year Perspective, (K. R. Apt, V. W. Marek, M. Truszczynski, and D. S. Warren, eds.), pp. 357\u2013373, Springer-Verlag, 1999.","DOI":"10.1007\/978-3-642-60085-2_16"},{"key":"BF03037535_CR14","doi-asserted-by":"crossref","unstructured":"Lloyd, J. W.,Foundations of Logic Programming. Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"BF03037535_CR15","unstructured":"Lobo, J., Minker, J. and Rajasekar, A., \u201cExtending the Semantics of Logic Programs to Disjunctive Logic Programs,\u201d inProc. of the Sixth International Conference on Logic Programming (G. Levi and M. Martelli, eds.), pp. 255\u2013267. MIT Press, 1989."},{"key":"BF03037535_CR16","doi-asserted-by":"crossref","unstructured":"Lobo, J., Minker, J. and Rajasekar, A.,Foundations of Disjunctive Logic Programming. MIT Press, 1992.","DOI":"10.1016\/B978-0-12-450010-5.50022-0"},{"issue":"1","key":"BF03037535_CR17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(91)90006-N","volume":"86","author":"J. Lobo","year":"1991","unstructured":"Lobo, J. and Rajasekar, A., \u201cSemantics of Horn and Disjunctive Logic Programs,\u201dTheoretical Computer Science, 86, 1, pp. 93\u2013106, 1991.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"BF03037535_CR18","first-page":"319","volume":"9","author":"C. Marinagi","year":"1997","unstructured":"Marinagi, C., Panayiotopoulos, T., Vouros, G. and Spyropoulos, C., \u201cAdvisor: A knowledge-based Planning System,\u201dInternational Journal of Expert Systems, 9, 3, pp. 319\u2013355, 1997.","journal-title":"International Journal of Expert Systems"},{"key":"BF03037535_CR19","unstructured":"McCain N. and Turner, H., \u201cA Causal Theory of Ramifications and Qualifications,\u201d inProc. of the Fourteenth International Conference on Artificial Intelligence (IJCAI \u201995), pp. 1978\u20131984, 1995."},{"key":"BF03037535_CR20","first-page":"463","volume":"4","author":"J. McCarthy","year":"1969","unstructured":"McCarthy J. and Hayes, P., \u201cSome Philosophical Problems from the Standpoint of Artificial Intelligence,\u201dMachine Intelligence, 4, pp. 463\u2013502, 1969.","journal-title":"Machine Intelligence"},{"issue":"1","key":"BF03037535_CR21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","volume":"9","author":"J. Minker","year":"1990","unstructured":"Minker, J. and Rajasekar, A., \u201cA Fixpoint Semantics for Disjunctive Logic Programs,\u201dThe Journal of Logic Programming, 9, 1, pp. 45\u201374, July 1990.","journal-title":"The Journal of Logic Programming"},{"key":"BF03037535_CR22","unstructured":"Minker, J. and Rajasekar, A. and Lobo, J., \u201cTheory of Disjunctive Logic Programs,\u201d inComputational Logic. Essays in the Honor of Alan Robinson, (J. L. Lasser and G. Plotkin, eds.), pp. 613\u2013639. MIT Press, 1991."},{"key":"BF03037535_CR23","volume-title":"Intensional logic programming","author":"M. A. Orgun","year":"1991","unstructured":"Orgun, M. A.,Intensional logic programming. PhD thesis, Dept. of Computer Science, University of Victoria, Canada, December 1991."},{"issue":"2","key":"BF03037535_CR24","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1111\/j.1467-8640.1996.tb00261.x","volume":"12","author":"M. A. Orgun","year":"1996","unstructured":"Orgun, M. A., \u201cOn Temporal Deductive Databases,\u201dComputational Intelligence, 12, 2, pp. 235\u2013259, 1996.","journal-title":"Computational Intelligence"},{"key":"BF03037535_CR25","doi-asserted-by":"crossref","unstructured":"Orgun, M. A. and Ma, W., \u201cAn Overview of Temporal and Modal Logic Programming,\u201d inProc. of the First International Conference on Temporal Logics (ICTL\u201994) (D. M. Gabbay and H. J. Ohlbach, eds.), Lecture Notes in Computer Science (LNCS) 827, pp. 445\u2013479. Springer-Verlag, 1994.","DOI":"10.1007\/BFb0014004"},{"issue":"4","key":"BF03037535_CR26","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0743-1066(92)90055-8","volume":"13","author":"M. A. Orgun","year":"1992","unstructured":"Orgun, M. A. and Wadge, W. W., \u201cTowards a Unified Theory of Intensional Logic Programming,\u201dThe Journal of Logic Programming, 13, 4, pp. 413\u2013440, August 1992.","journal-title":"The Journal of Logic Programming"},{"key":"BF03037535_CR27","unstructured":"Orgun, M. A. and Wadge, W. W., \u201cChronolog Admits a Complete Proof Procedure,\u201d inProc. of the Sixth International Symposium on Lucid and Intensional Programming (ISLIP\u201993) pp. 120\u2013135, 1993."},{"key":"BF03037535_CR28","doi-asserted-by":"crossref","unstructured":"Orgun, M. A., Wadge, W. W. and Du, W., \u201cChronolog (Z): Linear-time Logic Programming,\u201d inProc. of the Fifth International Conference on Computing and Information (O. Abou-Rabia, C. K. Chang, and W. W. Koczkodaj, eds.), pp. 545\u2013549. IEEE Computer Society Press, 1993.","DOI":"10.1109\/ICCI.1993.315313"},{"key":"BF03037535_CR29","unstructured":"Panayiotopoulos, T. and Gergatsoulis, M., \u201cIntelligent Information Processing Using TRLi,\u201d in6th International Conference and Workshop on Data Base and Expert Systems Applications (DEXA\u2019 95), (Workshop Proceedings) (A. Min Tjoa, and N. Revell, ed.), London, UK, 4\u20138 September, pp. 494\u2013501, 1995."},{"key":"BF03037535_CR30","unstructured":"Panayiotopoulos, T. and Gergatsoulis, M., \u201cA Prolog like Temporal Reasoning System,\u201d inProc. of 13th IASTED International Conference on APPLIED INFORMATICS, (M. H. Hamza, ed.), ICLS(Innsbruck), Austria 21\u201323 Ferbuary, pp. 123\u2013126, 1995."},{"key":"BF03037535_CR31","unstructured":"Pinto, J. and Reiter, R., \u201cTemporal Reasoning in Logic Programming: A Case for the Situation Calculus,\u201d inProc. of the Tenth International Conference on Logic Programming, (D. S. Warren, ed.), pp. 203\u2013221. MIT Press, 1993."},{"issue":"2\u20135","key":"BF03037535_CR32","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01530822","volume":"14","author":"J. Pinto","year":"1995","unstructured":"Pinto, J. and Reiter, R., \u201cReasoning about Time in the Situation Calculus,\u201dAnnals of Mathematics and Artificial Intelligence, 14, 2\u20135, pp. 251\u2013268, 1995.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3","key":"BF03037535_CR33","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0096-0551(98)00009-5","volume":"24","author":"P. Rondogiannis","year":"1998","unstructured":"Rondogiannis, P., Gergatsoulis, M. and Panayiotopoulos, T., \u201cBranching-time Logic Programming: The language Cactus and Its Applications,\u201dComputer Languages, 24, 3, pp. 155\u2013178, October 1998.","journal-title":"Computer Languages"},{"key":"BF03037535_CR34","unstructured":"Wadge, W. W., \u201cTense Logic Programming: A Respectable Alternative,\u201d inProc. of the 1988 International Symposium on Lucid and Intensional Programming, pp. 26\u201332, 1988."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037535.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037535\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037535","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T22:03:11Z","timestamp":1710280991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037535"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["BF03037535"],"URL":"https:\/\/doi.org\/10.1007\/bf03037535","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}