Admissibility and unifiability in contact logics

Philippe Balbiani (1, 2) , Cigdem Gencer (3)

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

Contact logics are logics for reasoning about the contact relations between regular subsets in a topological space. Admissible inference rules can be used to improve the performance of any algorithm that handles provability within the context of contact logics. The decision problem of unifiability can be seen as a special case of the decision problem of admissibility. In this paper, we examine the decidability of admissibility problems and unifiability problems in contact logics.

Mots clés: Contact logic; Unification problem; Admissibility problem; Computability; Decidability

Domaines: Intelligence artificielle [cs.AI]; Apprentissage [cs.LG]; Logique en informatique [cs.LO]; Informatique et langage [cs.CL]

Philippe Balbiani, Cigdem Gencer. Admissibility and unifiability in contact logics. 10th International Tbilisi Symposium on Logic, Language, and Computation (TbiLLC 2013), Sep 2013, Gudauri, Georgia. pp.44-60, ⟨10.1007/978-3-662-46906-4_4⟩. ⟨hal-01809353⟩