Труды КНЦ (Технические науки вып. 7/2023(14))

Труды Кольского научного центра РАН. Серия: Технические науки. 2023. Т. 14, № 7. С. 43-51. Transactions of the Kola Science Centre of RAS. Series: Engineering Sciences. 2023. Vol. 14, No. 7. P. 43-51. 22. Meiri I. Combining qualitative and quantitative constraints in temporal reasoning // Artificial Intelligence, 1996. № 87(1-2). P. 343-385. 23. Handbook o f Constraint Programming Edited by F. Rossi, P. Van Beek and T. Walsh. Elsevier. 2006. 24. Kumar T. K. S. On the tractability of restricted disjunctive temporal problems. ICAPS, 2005. P. 110-119. 25. Beaumont M., Thornton J., Sattar A., and Maher M. J. Solving over-constrained temporal reasoning problems using local search. PRICAI, 2004. P. 134-143. 26. Kumar T. K. S. A polynomial-time algorithm for simple temporal problems with piecewise constant domain preference functions. AAAI, 2004. P. 67-72. 27. Liffiton M. H., Moffitt M. D., Pollack M. E., and Sakallah K. A. Identifying conflicts in overconstrained temporal problems. IJCAI, 2005. P. 205-211. 28. Ladkin P. Satisfying First-Order Constraints About Time Intervals. AAAI, 1988. P. 512-517. 29. Koubarakis M. The Complexity o f Query Evaluation in Indefinite Temporal Constraint Databases // Theoretical Computer Science, Special Issue on Uncertainty in Databases and Deductive Systems, Editor: L. V. S. Lakshmanan. 1997. № 171. P. 25-60. 30. Koubarakis M. and Skiadopoulos S. Querying Temporal and Spatial Constraint Networks in PTIME // Artificial Intelligence, 2000. № 123(1-2). P. 223-263. References 1. Allen J., Kautz H., and Pelavin R., editors. Reasoning About Plans. Morgan Kaufmann, 1991. 2. Cesta A., Oddi A., and Smith S. F. A constraint-based method for project scheduling with time windows. Journal o fHeuristics, 2002, no. 8(1), pp. 109-136. 3. Schubert L. and Hwang C. Episodic logic meets Little Red Riding Hood: A comprehensive, natural representation for language understanding. In L. Iwanska and S. Shapiro, editors, Natural Language Processing and Knowledge Representation: Language for Knowledge and Knowledge for Language. MIT/AAAI Press, 2000, pp. 111-174. 4. Mylopoulos J., Borgida A., Jarke M., and Koubarakis M. Telos: A Language for Representing Knowledge About Information Systems. ACM Transactions on Information Systems, 1990, no. 8(4), pp. 325-362. 5. Koubarakis M., Sellis T. K., Frank A. U., Grumbach S., G'uting R. H., Jensen C. S., Lorentzos N. A., Manolopoulos Y., Nardelli E., Pernici B., Schek H.-J., Scholl M., Theodoulidis B., and Tryfona N. editors. Spatio-Temporal Databases: The CHOROCHRONOS Approach, vol. 2520 o f Lecture Notes in Computer Science, Springer, 2003. 6. Revesz P. Introduction to Constraint Databases. Springer, 2002. 7. P. van Beek. Reasoning About Qualitative Temporal Information. Artificial Intelligence, 1992, no. 58, pp. 297-326. 8. Alur R. Timed automata. CAV, 1999, pp. 8-22. 9. Balbiani P., Condotta J.-F., and Ligozat G. Reasoning about generalized intervals: Horn representability and tractability. TIME, 2000, pp. 23-30. 10. Balbiani P., Condotta J.-F., and Ligozat G. On the consistency problem for the INDU calculus. TIME, 2003, p p .203-211. 11. Cohen D. A., Jeavons P., and Koubarakis M. Tractable disjunctive constraints. CP, 1997, pp. 478-490. 12. Console L. and Terenziani P. Efficient processing of queries and assertions about qualitative and quantitative temporal constraints. Computational Intelligence, 1999, no. 15(4), pp. 442-465. 13. Cormen T., Leiserson C., and Rivest R. Introduction to Algorithms. MIT Press, 1990. 14. Dean T. Using temporal hierarchies to efficiently maintain large temporal databases. Journal ofthe ACM, 1989, no. 36(4). pp. 687-718. 15. Dean T. and McDermott D. Temporal Data Base Management. Artificial Intelligence, 1987, no. 32(1), pp. 1-55. 16. Dechter R. Constraint Processing. Morgan Kaufmann, 2003. 17. Vilain M. and Kautz H. Constraint Propagation Algorithms for Temporal Reasoning. AAAI, 1986, p p . 377-382. 18. Dean T. and McDermott D. Temporal Data Base Management. Artificial Intelligence, 1987, no. 32(1), pp. 1-55. © Зуенко А. А., Фридман О. В., 2023 50