Use this URL to cite or link to this record in EThOS:
Title: Computational properties of spatial logics in the real plane
Author: Griffiths, Aled Alun
ISNI:       0000 0001 3519 9863
Awarding Body: University of Manchester
Current Institution: University of Manchester
Date of Award: 2008
Availability of Full Text:
Access from EThOS:
Spatial logics are formal languages whose predicate and function symbols are interpreted as geometric relations and properties. In order to use spatial logics to perform automated reasoning on spatial data, we must have formal procedures which can decide the satisfiability of the formulae of these logics. However, first order spatial logics are typically undecidable and thus have no such formal procedure. By restricting the syntax of a spatial logic in certain ways, we can achieve languages which are decidable. This thesis examines a particular type of syntactic restriction of spatial logics which result in a family of spatial logics called topological constraint languages. The thesis is mainly concerned with the various approaches taken to solving the satisfiability problems of these topological constraint languages. During this thesis we contribute new results providing complexity results and decision procedures for the satisfiability problems of some topological constraint languages.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available