|
Classifying the complexity in Allen's algebra
by
Andrei Krokhin
Oxford University, UK
Coauthors: Peter Jeavons (Oxford University, UK), Peter Jonsson (Linkoeping University, Sweden)
Allen's interval algebra is one of the best established formalisms for temporal reasoning. Since reasoning in the full algebra is NP-hard, there arises the problem of identifying tractable fragments of the algebra. In this talk, we shall discuss some recent results obtained in this direction.
Date received: December 19, 2000
Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafo-32.