Papers for
knowledge representation developers
Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.
Modal style dependence logics extended and shown undecidable by reductions
Connecting Extended Modal Dependence Logics
Abstract: We consider three natural extensions of the basic decidable dependence logic LFD, adding, respectively, conditional dependence atoms, independence atoms, and identity atoms between variables. We show that these systems are all connected to first-order logic with identity by SAT reductions and in several cases also faithful translations. In particular, this implies that all these extended modal-style dependence logics are undecidable. This solves a number of problems left open in the original publication [1] introducing the LFD framework. The definitions and proofs presented here were found by ChatGPT and checked and streamlined as needed by the authors. At the end, we provide some discussion of what new things we learnt about dependence logics and about the methodology of using AI in logical research.
Several logic systems between S4.2 and S4.3 explained by independence
On Some Logics Intermediate Between S4.2 and S4.3 Defined by the Notion of Independence
Abstract: Hamkins and Loewe described modal logic S4.2 through the notion of sets of independent buttons - statements that are possibly necessary - and switches - necessarily contingent statements. In this article we investigate logics intermediate between S4.2 and S4.3 that are defined through a different notion of independence. We provide an axiomatic description of such logics, state some basic facts and prove various completeness and decidability results.