Bernhard Nebel
Skip Abstract Section
Abstract
We introduce a new subclass of Allen's interval algebra we call “ORD-Horn subclass,” which is a strict superset of the “pointisable subclass.” We prove that reasoning in the ORD-Horn subclass is a polynomial-time problem and show that the path-consistency method is sufficient for deciding satisfiability. Further, using an extensive machine-generated case analysis, we show that the ORD-Horn subclass is a maximal tractable subclass of the full algebra (assuming P ≠ NP). In fact, it is the unique greatest tractable subclass amongst the subclasses that contain all basic relations.
- ~ALLEN, J.F. 1983.Maintaining knowledge about temporal intervals. Commun. ACM 26, 11 ~(Nov.), 832-843. Google Scholar
- ~ALLEN, J.F. 1984. Towards a general theory of action and time. Artif. Int. 23, 2, 123-154. Google Scholar
- ~ALLEN, J.F. 1991. Temporal rcasoning and planning. In Reasomng about Plans, chap. 1. J. F. ~Allen, H. A. Kautz, R. N. Pelavin, and J. D. Tenenberg, eds. Morgan-Kaufmann, San Mateo, ~Calif., pp. 1-67. Google Scholar
- ~ALLEN, J. F., AND HAYES, P.J. 1985. A common-sense theory of time. In Proceedings of the ~9th International Joint Conference on Artificial Intelligence (Los Angeles, Calif., Aug.). Morgan- ~Kaufmann, San Mateo, Calif, pp. 528-531.Google Scholar
- ~ALLEN, J. F., AND KOOMEN, J.A. 1983. Planning using a temporal world model. In Proceedings ~of the 8th International Joint Conference on Artificial Intelligence. (Karlsruhe, Germany, Aug.). ~Morgan-Kaufmann, San Mateo, Calif., pp. 741-747.Google Scholar
- ~ANDRe,, E., GRAF, W., HEINSOHN, J., NEBEL, B., PROFITLICH, H.-J., RIST, T., AND WAHLSTER, W. ~1993. ~: Personalized plan-based presenter--Project Proposal. DFKI Document D-93-05, ~German Research Center for Artificial Intelligence (DFKI), Saarbriicken, May.Google Scholar
- ~DOWLING, W. F., AND GALLIER, J.H. 1984. Linear time algorithms for testing the satisfiability ~of propositional Horn formula. J. Logic Prog. 3, 267-284.Google Scholar
- ~FEINER, S. K., LITMAN, D. J., McKEowN, K. R., AND PASSONNEAU, R. J. 1993. Towards ~coordinated temporal multimedia presentation. In bztelligent Multi Media, M. Maybury, ed. ~AAAI Press, Menlo Park, Calif., pp. 139-147. Google Scholar
- FREKSA, C. 1992. Temporal reasoning based on semi-intervals. Artif Int. 54, 1-2, 199-227. Google Scholar
- FREUDER, E. C. 1978. Synthesizing constraint expressions. Commun. ACM 21, 11 (Nov.), ~958-966. Google Scholar
- ~GALLIER, J. H., AND RAATZ, S. 1985. Logic programming and graph rewriting. In Proceedings ~of Symposium on Logic Programming, IEEE Society, pp. 208-219.Google Scholar
- ~GEREVINI, A., AND SCHUBERT, L. 1993a. Complexity of temporal reasoning with disjunctions of ~inequalities. Tech. Rep. 9303-01. IRST, Trento, Italy, Jan.Google Scholar
- ~GEREVINI, A., AND SCHUBERT, L. 1993b. Efficient temporal reasoning through timegraphs. In ~Proceedings of the 13th International Joint Conference on Artificial Intelligence (Chambery, France, ~Aug.). Morgan-Kaufmann, San Mateo, Calif., pp. 648-654.Google Scholar
- ~GHALLAB, M., AND MOUNIR ALAOUI, A. 1989. Managing efficiently temporal relations through ~indexed spanning trees. In Proceedings of the llth International Joint Conference on Artificial ~Intelligence (Detroit, Mich., Aug.). Morgan-Kaufmann, San Mateo, Calif., pp. 1279-1303.Google Scholar
- ~GOLUMBIC, M. C., AND SHAMIR, R. 1992. Algorithms and complexity for reasoning about time. ~In Proceedings of the lOth National Conference of the American Association for Artificial ~Intelligence (San Jose, Calif., July). AAAI Press/MIT Press, Cambridge, Mass., pp. 741-747.Google Scholar
- ~GOLUMBIC, M. C., AND SHAMIR, R. 1993. Complexity and algorithms for reasoning about time: ~A graph-theoretic approach. J. ACM 40, 5 (Nov.), 1128-1133. Google Scholar
- ~HENSCHEN, L., AND WOS, L. 1974. Unit refutations and Horn sets. J. ACM 21, 4 (Oct.), ~590-605. Google Scholar
- ~KOUBARAKIS, M., MYLOPOULOS, J., STANLEY, M., AND BORGIDA, A. 1987. Teleos: Features and ~formalization. Tech. Rep. KRR-TR-89-4. Department of Computer Science, University of ~Toronto, Toronto, Ont., Canada.Google Scholar
- ~LADKIN, P. B. 1987. Models of axioms for time intervals. In Proceedings of the 6th Nattonal ~Conference of the American Association for Artificial Intelligence (AAAI-87) (Seattle, Wash., July), ~AAAI Press, Menlo Park, Calif., pp. 234-239.Google Scholar
- ~LADKIN, P. B., AND MADDUX, R. 1988. On binary constraint networks. Tech. Rep. KES.U.88.8. ~Kestrel Institute, Palo Alto, Calif.Google Scholar
- ~LADKIN, P. B., AND MADDUX, R. 1994. On binary constraint problems. J. ACM 41, 3 (May), ~435-469. Google Scholar
- ~LEVESQUE, H. J., AND BRACHMAN, R.J. 1987. Expressiveness and tractability in knowledge ~representation and reasoning. Comput. bzt. 3, 78-93.Google Scholar
- ~MACKWORTH, A.K. 1977. Consistency in networks of relations. Artif Int. 8, 99-118.Google Scholar
- ~MACKWORTH, A. K., AND FREUDER, E.C. 1985. The complexity of some polynomial network ~consistency algorithms for constraint satisfaction problems. Amf bzt. 25, 65-73. Google Scholar
- ~MONTANARI, U. 1974. Networks of constraints: Fundamental properties and applications to ~picture processing. Inf. Sci. 7, 95-132.Google Scholar
- ~NOKEL, K. 1989. Convex relations between time intervals. In Proceedings der 5. dJsterreichischen ~Artificial Intelligence-Tagung, J. Rettie and K. Leidlmair, eds. Springer-Verlag, Berlin, Heidel- ~berg, New York, pp. 298-302. Google Scholar
- ~N/SKEL, K. 1991. Temporally distributed symptoms in technical diagnosis. In Lecture Notes in ~Artificial Intelligence, vol. 517. Springer-Verlag, Berlin, Heidelberg, New York. Google Scholar
- ~SONG, F., AND COHEN, R. 1988. The interpretation of temporal relations in narrative. In ~Proceedings of the 7th National Conference of the American Association for Artificial Intelligence ~(Saint Paul, Minn., Aug.). AAAI Press, Menlo Park, Calif., pp. 745-750.Google Scholar
- ~VALD~Z-P~REZ, R.E. 1987. The satisfiability of temporal constraint networks. In Proceedings ~of the 6th National Conference of the American Association for Artificial Intelligence (Seattle, ~Wash., July). AAAI Press, Menlo Park, Calif., pp. 256-260.Google Scholar
- ~VAN BEEK, P. 1989. Approximation algorithms for temporal reasoning. In Proceedings of the ~l l th International Joint Conference on Artificial Intelligence (Detroit, Mich., Aug.). Morgan-Kauf- ~mann, San Mateo, Calif., pp. 1291-1296.Google Scholar
- ~VAN BEEK, P. 1990. Reasoning about qualitative temporal information. In Proceedings of the ~8th National Conference of the American Assoctation for Artificial Intelligence (Boston, Mass., ~Aug.). MIT Press, Cambridge, Mass., pp. 728-734.Google Scholar
- ~VAN BEEK, P., AND COHEN, R. 1990. Exact and approximate reasoning about temporal rela- ~tions. Comput. Int. 6. 132-144. Google Scholar
- ~VILAIN, M. B., AND KAUTZ, H. A. 1986. Constraint propagation algorithms for temporal ~reasoning. In Proceedings of the 5th National Conference of the American Association for Artificial ~bzteIligence (Philadelphia, Pa., Aug.). AAAI Press, Menlo Park, Calif., pp. 377-382.Google Scholar
- ~VILAIN, M. B., KAUTZ, H. A., AND VAN BEEK, P.G. 1989. Constraint propagation algorithms ~for temporal reasoning: A revised report. In Readings in Qualitatit,e Reasoning about Physical ~Systems, D. S. Weld and J. de Kleer, eds. Morgan-Kaufmann, San Mateo, Calif., pp. 373-381. Google Scholar
- ~WEIDA, R., AND LITMAN, D. 1992. Terminological reasoning with constraint networks and an ~application to plan recognition. In Principles of Knowledge Representation and Reasoning.' ~Proceedings of the 3rd Internattonal Conference (Cambridge, Mass., Oct.). B. Nebel, W. Swartout, ~and C. Rich, eds. Morgan-Kaufmann, San Mateo, Calif., pp. 282-293.Google Scholar
Index Terms
- Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Recommendations
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Allen's interval algebra is one of the best established formalisms for temporal reasoning. This article provides the final step in the classification of complexity for satisfiability problems over constraints expressed in this algebra. When the ...
Incremental qualitative temporal reasoning: Algorithms for the Point Algebra and the ORD-Horn class
In many applications of temporal reasoning we are interested in processing temporal information incrementally. In particular, given a set of temporal constraints (a temporal CSP) and a new constraint, we want to maintain certain properties of the ...
Temporal reasoning in a meta constraint logic programming architecture
TIME '96: Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)Constraint Logic Programming (CLP) is a powerful programming paradigm combining the advantages of Logic Programming and the efficiency of constraint solving. However, CLP presents some limitations in dealing with temporal reasoning. First, it uses an "...
Comments