Skip to main content
SpringerLink
Log in

Deduction Algorithms for Some Extensions of Allen’s Interval Logic

  • Published:
Scientific and Technical Information Processing Aims and scope

Abstract

This paper considers Allen’s interval logic language and the languages whose statements are Boolean combinations of Allen’s logic statements, possibly, with metric information. Some deduction algorithms for the languages are presented. The algorithms are based on the analytic tableaux method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Allen, J.A., Maintaining knowledge about temporal intervals, Commun. ACM, 1983, vol. 20, no. 11, pp. 832–843.

    Article  MATH  Google Scholar 

  2. Allen, J.A., Planning as temporal reasoning, Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, 1991, pp. 3–14.

    Google Scholar 

  3. Allen, J.A. and Hayes, P.I., Common-sense theory of time, Proceedings of the 9th International Joint Conference on Artificial Intelligence, 1985, pp. 528–531.

    Google Scholar 

  4. Allen, J.A. and Koomen, J.A., Planning using a temporal word model, Proceedings of the 8th International Joint Conference on Artificial Intelligence, 1983, pp. 741–747.

    Google Scholar 

  5. Automatic Reasoning with Analytic Tableaux and Related Methods, LNAI 6793, Brunner, K. and Metcalf, G., Eds., 2011, p. 279.

    Google Scholar 

  6. Koubarakis, M., Tractable disjunctions of linear constraints, Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP96), LNCS 1118, 1996, pp. 297–307.

    Google Scholar 

  7. Litman, D. and Allen, J., A plan recognition model for subdialogues in conversation, Cognit. Sci., 1987, vol. 11, no. 2, pp. 163–200.

    Article  Google Scholar 

  8. Vilain, M. and Kautz, H., Constraint propagation algorithms for temporal reasoning, Proceedings of the 5th Conference on Artificial Intelligence, 1986, pp. 377–382.

    Google Scholar 

  9. Pleshevich, G.S., Nguyen Thi Minh Vu, and Karabekov, B.S., A deduction algorithm for the Boolean extension of Allen’s interval logic, Integrirovannye modeli i myagkie vychisleniya v iskusstvennom intellekte. Sbornik nauchnykh trudov VIII-i Mezhdunarodnoi nauchno-prakticheskoi konferentsii (Kolomna, 18–20 maya 2015g.) (Integrated Models and Soft Computing in Artificial Intelligence. Proceedings of the 8th International Scientific and Practical Conference, Kolomna, Russia, May 18–20, 2015), Moscow, 2015, pp. 181–189.

    Google Scholar 

  10. Dechter, R., Meiri, I., and Pearl, J., Temporal constraint networks, Artif. Intell., 1991, vol. 45, no. 1, 1991, pp. 61–95.

    Article  MathSciNet  MATH  Google Scholar 

  11. Shostak, R., Deciding linear inequalities by computing loop residues, J. ACM, 1981, vol. 28, no. 4, 1981, pp. 769–779.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. National Research University Moscow Power Engineering Institute (MPEI), Moscow, 111250, Russia

    G. S. Plesniewicz &  Nguyen Thi Minh Vu

Authors
  1. G. S. Plesniewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nguyen Thi Minh Vu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to G. S. Plesniewicz.

Additional information

Original Russian Text © G.S. Plesniewicz, Nguyen Thi Minh Vu, 2016, published in Iskusstvennyi Intellekt i Prinyatie Reshenii, 2016, No. 1, pp. 75–88.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Plesniewicz, G.S., Nguyen Thi Minh Vu Deduction Algorithms for Some Extensions of Allen’s Interval Logic. Sci. Tech. Inf. Proc. 44, 345–356 (2017). https://doi.org/10.3103/S0147688217050100

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0147688217050100

Keywords

Search

Navigation