World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Mon, Jun 21st, 2021 at 1am (EDT)

During this period, the E-commerce and registration of new users may not be available for up to 6 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.
Special Issue on Selected Papers from the 2002 IEEE International Conference on Tools with Artificial Intelligence; Guest Editor: Ing-Ray ChenNo Access

Actions with Duration and Constraints: The Ramification Problem in Temporal Databases

    The ramification problem is a hard and ever present problem in systems exhibiting a dynamic behavior. The area of temporal databases in particular is still lacking satisfactory solutions to the ramification problem. In this paper, we address the ramification problem based on causal relationships that take time into account. We study the problem for both instantaneous actions and actions with duration. The proposed solution advances previous work by considering actions with effects occurring in any of the possible future situations resulting from an action's execution.

    References

    • A. Borgida, J. Mylopoulos and R. Reiter, IEEE Transactions on Software Engineering 21(10), 785 (1995), DOI: 10.1109/32.469460. Crossref, ISIGoogle Scholar
    • C. Elkan, Reasoning about action in first order logic, Proceedings of the Conference of the Canadian Society for Computational Studies in Intelligence (CSCSI) (Vancouver, 1992) pp. 221–227. Google Scholar
    • M. Ginsberg and D. Smith, Artificial Intelligence 35, 165195 (1988). Google Scholar
    • J. Gustafon. Extending Temporal Action Logic for Ramification and Concurency, Thesis No. 719 of Linkoping Studies in Science and Technology, 1998 . Google Scholar
    • A. Fusaoka, Situation Calculus on a Dense Flow of Time, Proceedings of AAAI-96 (1996) pp. 633–638. Google Scholar
    • A. C. Kakas, R. S. Miller and F. Toni, E-RES: Reasoning about Actions, Events and Observations, Proceedings of LPNMR2001 (Springer Verlag, 2001) pp. 254–266. Google Scholar
    • Antonis Kakas and Rob Miller, The Journal of Logic Programming 31(1–3), 157 (1997), DOI: 10.1016/S0743-1066(96)00138-0. Crossref, ISIGoogle Scholar
    • V. Lifshitz, Towards a metatheory of action, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning, eds. J. F. Allen, R. Fikes and E. Sandewall (Cambridge, MA, 1991) pp. 376–386. Google Scholar
    • V. Lifshitz, Artificial Intelligence 46, 365 (1990). Crossref, ISIGoogle Scholar
    • V. Lifshitz, Restricted monotonicity, Proceedings of the AAAI National Conference on Artifical Intelligence (Washington DC, 1993) pp. 432–437. Google Scholar
    • N. McCain and H. Turner, A causal theory of ramifications and qualifications, Proceedings of IJCAI-95 (Montreal, Canada, 1995) pp. 1978–1984. Google Scholar
    • J. McCarthy and P. J. Hayes, Machine Intelligence, Some philophical problem from the standpoint of artificial intelligence 4, eds. B. Meltzer and D. Mitchie (American Elsevier, 1969) pp. 463–502. Google Scholar
    • Nikos Papadakis and Dimitris Plexousakis, Action Theories in Temporal Databases, Proceedings of the 8th Panhellenic Conference on Informatics (Cyprus, 2001) pp. 254–264. Google Scholar
    • Nikos Papadakis and Dimitris Plexousakis, The Ramification and Qualification Problems in Temporal Databases, Proceedings of the 2th hellenic Conference on AI2308, Lecture Notes on Artificial Intelligent (>Thessaloniki, Greece, 2002) pp. 18–30. Google Scholar
    • Nikos   Papadakis and Dimitris   Plexousakis , Action with Duration and Constraints: The Ramification problem in Temporal Databases , 14th IEEE International Conference on Tools with Artificial Intelligent . Google Scholar
    • Dimitris Plexousakis. Maintenance of Integrity Constraints in Temporal Deductive Knowledge Bases. Phd Thesis, Dept. of Computer Science, Univ. of Toronto, Jan. 1996 . Google Scholar
    • Dimitris Plexousakis and John Mylopoulos, Accomodating Integrity Constraints During Database Design, Proceedings of EDBT (Avignon, France, 1996) pp. 497–513. Google Scholar
    • J. Pinto. Temporal Reasoning in the Situation Calculus. Ph.D. Thesis, Dept. of Computer Science, Univ. of Toronto, Jan. 1994 . Google Scholar
    • J.   Pinto and R.   Reiter , Temporal Reasoning in Logic Programming: A Case for the Situation Calculus , Proceedings of 10th Int. Conf. on Logic Programming . Google Scholar
    • R. Reiter, Natural Actions, Concurrency and Continuous Time in the Situation Calculus, KR 96 (1996) pp. 2–13. Google Scholar
    • R.   Reiter , Khowledge in Action: Logical Foundation for specifying and implemending Dynamical Systems ( MIT Press , 2001 ) . CrossrefGoogle Scholar
    • M. Thielscher, Artifical Intelligence 89(1-2), 317 (1997), DOI: 10.1016/S0004-3702(96)00033-1. Crossref, ISIGoogle Scholar
    • M. Thielscher, Artifical Intelligence 104, 339 (1988), DOI: 10.1016/S0004-3702(98)00084-8. Crossref, ISIGoogle Scholar
    • M. Winslett, Reasoning about action using a possible models approach, Proceedings of AAAI-88 (Saint Paul, MN, 1988) pp. 89–93. Google Scholar