Balbiani, Philippe
and Gencer, Cigdem
Finitariness of elementary unification in Boolean Region Connection Calculus.
(2017)
In: 11th International Symposium on Frontiers of Combining Systems (FroCoS 2017), 27 September 2017 - 29 September 2017 (Brasilia, Brazil).
|
(Document in English)
PDF (Author's version) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 364kB |
Official URL: https://doi.org/10.1007/978-3-319-66167-4_16
Abstract
Boolean Region Connection Calculus is a formalism for reasoning about the topological relations between regions. In this paper, we provide computability results about unifiability in Boolean Region Connection Calculus and prove that elementary unification is finitary
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | Thanks to Springer editor. This papers appears in Volume 10483 of Lecture Notes in Computer Science ISSN : 0302-9743 ISBN: 978-3-319-66166-7 The original PDF is available at: https://link.springer.com/chapter/10.1007/978-3-319-66167-4_16 |
| HAL Id: | hal-01650175 |
| Audience (conference): | International conference proceedings |
| Uncontrolled Keywords: | |
| Institution: | Université de Toulouse > Institut National Polytechnique de Toulouse - Toulouse INP (FRANCE) French research institutions > Centre National de la Recherche Scientifique - CNRS (FRANCE) Université de Toulouse > Université Toulouse III - Paul Sabatier - UT3 (FRANCE) Université de Toulouse > Université Toulouse - Jean Jaurès - UT2J (FRANCE) Université de Toulouse > Université Toulouse 1 Capitole - UT1 (FRANCE) |
| Laboratory name: | |
| Statistics: | download |
| Deposited On: | 20 Nov 2017 10:26 |
Repository Staff Only: item control page
