Proceedings

A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation

Download BibTeX Cite

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 83-87.

Abstract

We study fragments of Allen’s algebra that contain a basic relation distinct from the equality relation. We prove that such a fragment is either NPcomplete or else contained in some already known tractable subalgebra. We obtain this result by giving a new uniform description of known maximal tractable subalgebras and then systematically using an algebraic technique for description of maximal subalgebras with a given property. This approach avoids the need for extensive computerassisted search.

Andrei A. Krokhin, Peter Jeavons, and Peter Jonsson. 2001. A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01. IJCAI, 83–87. https://ijcai.org/proceedings/2001/11
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards