Skip to Main content Skip to Navigation
Conference papers

Admissibility and unifiability in contact logics

Abstract : 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.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Wednesday, June 6, 2018 - 4:14:02 PM
Last modification on : Wednesday, June 9, 2021 - 10:00:27 AM
Long-term archiving on: : Friday, September 7, 2018 - 2:06:34 PM


Files produced by the author(s)


  • HAL Id : hal-01809353, version 1
  • OATAO : 19007


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. ⟨hal-01809353⟩



Record views


Files downloads