A complete classification of tractability in Allen's algebra relative to subsets of basic relations.
We characterise the set of subalgebras of Allen's algebra which have anext term tractable satisfiability problem, and in addition contain certain basic relations. The conclusion is that no tractable subalgebra dial is not known in the literature can contain more than the three basic relations (...
| Published in: | Artificial intelligence. 106, 2 (1998). |
|---|---|
| Main Author: | |
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Subjects: |