𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computational complexity of spatial reasoning with directional relationship

✍ Scribed by Mao Jianhua; Guo Qingsheng; Wang Tao

Book ID
105623132
Publisher
Springer
Year
2002
Tongue
English
Weight
375 KB
Volume
5
Category
Article
ISSN
1009-5020

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the computational complexity of assum
On the computational complexity of assumption-based argumentation for default reasoning
✍ Yannis Dimopoulos; Bernhard Nebel; Francesca Toni πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 177 KB

Bondarenko et al. have recently proposed an abstract framework for default reasoning. Besides capturing most existing formalisms and proving that their standard semantics all coincide, the framework extends these formalisms by generalising the semantics of admissible and preferred arguments, origina

Computational complexity of relating tim
Computational complexity of relating time points with intervals
✍ Peter Jonsson; Thomas Drakengren; Christer BΓ€ckstrΓΆm πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 190 KB

Several algebras have been proposed for reasoning about qualitative constraints over the time line. One of these algebras is Vilain's point-interval algebra, which can relate time points with time intervals. Apart from being a stand-alone qualitative algebra, it is also used as a subalgebra in Meiri