Logics of Space with Connectedness Predicates: Complete Axiomatizations
نویسندگان
چکیده
In this paper we present a complete quantifier-free axiomatization of several logics on region-based theory of space based on contact relation and connectedness predicates. We prove completeness theorems for the logics in question with respect to three different semantics: algebraic – with respect to several important classes of contact algebras, topological – based on the contact algebras over various classes of topological spaces, and relational semantics with respect to Kripke frames with reflexive and symmetric relations.
منابع مشابه
Topological Logics over Euclidean Spaces
In this paper we prove some results on the computational complexity of standard quantifierfree spatial logics with the connectedness predicate interpreted over the Euclidean spaces R and R. Topological logics with connectedness. A topological logic is a formal language whose variables range over subsets of topological spaces, and whose non-logical primitives denote fixed topological properties ...
متن کاملSpatial logics with connectedness predicates
We consider quantifier-free spatial logics, designed for qualitative spatial representation and reasoning in AI, and extend them with the means to represent topological connectedness of regions and restrict the number of their connected components. We investigate the computational complexity of these logics and show that the connectedness constraints can increase complexity from NP to PSpace, E...
متن کاملComplete Axiomatizations for Logics of Knowledge and Past Time (Long Version)
Sound and complete axiomatizations are provided for two different logics involving modalities for knowledge and both past and future time modalities. The logics considered allow for multiple agents with unique initial state and synchrony. Such semantic restrictions are of particular interest in the context of past time modalities since both synchrony and unique initial state restrictions are no...
متن کاملAxiomatizations of Temporal Logics on Trace Systems
Partial order temporal logics interpreted on trace systems have been shown not to have finitary complete axiomatizations due to the fact that the complexity of their decidability problem is in 11. This paper gives infinitary complete proof systems for several temporal logics on trace systems e.g. Computation Tree Logic with past operators and an essential subset of Interleaving Set Temporal Logic.
متن کاملAxiomatizing GSOS with Predicates
In this paper, we introduce an extension of the GSOS rule format with predicates such as termination, convergence and divergence. For this format we generalize the technique proposed by Aceto, Bloom and Vaandrager for the automatic generation of ground-complete axiomatizations of bisimilarity over GSOS systems. Our procedure is implemented in a tool that receives SOS specifications as input and...
متن کامل