ML Anthology

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

Andrei A. Krokhin, Peter Jeavons, Peter Jonsson
IJCAI 2001 pp. 83-88
/ijcai/2001/krokhin2001ijcai-complete/
Semantic Scholar

Cite

Text

Krokhin et al. "A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation." International Joint Conference on Artificial Intelligence, 2001.

Markdown

[Krokhin et al. "A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation." International Joint Conference on Artificial Intelligence, 2001.](https://mlanthology.org/ijcai/2001/krokhin2001ijcai-complete/)

BibTeX

@inproceedings{krokhin2001ijcai-complete,
  title     = {{A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation}},
  author    = {Krokhin, Andrei A. and Jeavons, Peter and Jonsson, Peter},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2001},
  pages     = {83-88},
  url       = {https://mlanthology.org/ijcai/2001/krokhin2001ijcai-complete/}
}