Abstract
For natural language understanding and generation, plan generation and recognition, and knowledge representation, it is necessary to represent qualitiave temporal information and to reason with it. Allen's interval calculus provides an appropriate framework for such a task. 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 machinegenerated 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.