Abstract
The work deals with the organization of temporal reasoning basing on constraint satisfaction methods. The definition of the constraint satisfaction problem and the notion of constraint consistency are given. The possibilities of epresentation of a planning problem as an interval constraint network are considered. As a mathematical apparatus for the formalization of temporal reasining, the Allen’s interval algebra is described, which main operations are composition and the intersection of temporal relations. A path consistency algorithm is given that implements one of the types of local consistency on interval constraint network and uses computations based on operations of interval algebra. An example of the application of this algorithm is presented. In the conclusion the prospects for the development of methods of temporal reasoning are considered.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Transactions of the Kоla Science Centre of RAS. Series: Engineering Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
