3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.LO2011★ 3 cited
On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces
Roman Kontchakov, Yavor Nenov, Ian Pratt-Hartmann +1
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dim…
cs.LO2006
Undecidability of the unification and admissibility problems for modal and description logics
Frank Wolter, Michael Zakharyaschev
We show that the unification problem `is there a substitution instance of a given formula that is provable in a given logic?' is undecidable for basic modal logics K and K4 extende…