Two decision problems in Contact Logics

Philippe Balbiani (1, 2) , Cigdem Gencer (1, 3) , Zafer Özdemir (1, 3)

1 IRIT-LILaC - Logique, Interaction, Langue et Calcul
2 CNRS - Centre National de la Recherche Scientifique
3 Istanbul University

Contact Logics provide a natural framework for representing and reasoning about regions in several areas of computer science. In this paper, we focus our attention on reasoning methods for Contact Logics and address the satisfiability problem and the unifiability problem. Firstly, we give sound and complete tableaux-based decision procedures in Contact Logics and we obtain new results about the decidability/complexity of the satisfiability problem in these logics. Secondly, we address the computability of the unifiability problem in Contact Logics and we obtain new results about the unification type of the unifiability problem in these logics.

Mots clés: Unifiability problem; Contact Logics; Satisfiability problem

Domaines: Logique en informatique [cs.LO]

Philippe Balbiani, Cigdem Gencer, Zafer Özdemir. Two decision problems in Contact Logics. Logic Journal of the IGPL, 2019, 27 (1), pp.8-32. ⟨10.1093/jigpal/jzy016⟩. ⟨hal-02378372⟩