Switch to: References

Add citations

You must login to add citations.
  1. On the Decidability of Axiomatized Mereotopological Theories.Hsing-Chien Tsai - 2015 - Notre Dame Journal of Formal Logic 56 (2):287-306.
    The signature of the formal language of mereotopology contains two predicates $P$ and $C$, which stand for “being a part of” and “contact,” respectively. This paper will deal with the decidability issue of the mereotopological theories which can be formed by the axioms found in the literature. Three main results to be given are as follows: all axiomatized mereotopological theories are separable; all mereotopological theories up to $\mathbf{ACEMT}$, $\mathbf{SACEMT}$, or $\mathbf{SACEMT}^{\prime}$ are finitely inseparable; all axiomatized mereotopological theories except $\mathbf{SAX}$, $\mathbf{SAX}^{\prime}$, (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Mereotopological Connection.Anthony G. Cohn & Achille C. Varzi - 2003 - Journal of Philosophical Logic 32 (4):357-390.
    The paper outlines a model-theoretic framework for investigating and comparing a variety of mereotopological theories. In the first part we consider different ways of characterizing a mereotopology with respect to (i) the intended interpretation of the connection primitive, and (ii) the composition of the admissible domains of quantification (e.g., whether or not they include boundary elements). The second part extends this study by considering two further dimensions along which different patterns of topological connection can be classified - the strength of (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Tableaux and Dual Tableaux: Transformation of Proofs.Joanna Golińska-Pilarek & Ewa Orłowska - 2007 - Studia Logica 85 (3):283-302.
    We present two proof systems for first-order logic with identity and without function symbols. The first one is an extension of the Rasiowa-Sikorski system with the rules for identity. This system is a validity checker. The rules of this system preserve and reflect validity of disjunctions of their premises and conclusions. The other is a Tableau system, which is an unsatisfiability checker. Its rules preserve and reflect unsatisfiability of conjunctions of their premises and conclusions. We show that the two systems (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Relational proof systems for spatial reasoning.Joanna Golińska-Pilarek & Ewa Orlowska - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):409-431.
    We present relational proof systems for the four groups of theories of spatial reasoning: contact relation algebras, Boolean algebras with a contact relation, lattice-based spatial theories, spatial theories based on a proximity relation.
    Download  
     
    Export citation  
     
    Bookmark  
  • Boolean connection algebras: A new approach to the Region-Connection Calculus.J. G. Stell - 2000 - Artificial Intelligence 122 (1-2):111-136.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • An efficient relational deductive system for propositional non-classical logics.Andrea Formisano & Marianna Nicolosi-Asmundo - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):367-408.
    We describe a relational framework that uniformly supports formalization and automated reasoning in varied propositional modal logics. The proof system we propose is a relational variant of the classical Rasiowa-Sikorski proof system. We introduce a compact graph-based representation of formulae and proofs supporting an efficient implementation of the basic inference engine, as well as of a number of refinements. Completeness and soundness results are shown and a Prolog implementation is described.
    Download  
     
    Export citation  
     
    Bookmark   1 citation