DCTP - A Disconnection Calculus Theorem Prover - System Abstract
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Tableaux for Quantified Hybrid Logic
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
The design and implementation of VAMPIRE
AI Communications - CASC
AI Communications - CASC
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Comparative Concept Similarity over Minspaces: Axiomatisation and Tableaux Calculus
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Automated Synthesis of Tableau Calculi
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Using tableau to decide expressive description logics with role negation
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
CSL-lean: A Theorem-prover for the Logic of Comparative Concept Similarity
Electronic Notes in Theoretical Computer Science (ENTCS)
MetTeL: a tableau prover with logic-independent inference engine
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Using tableau to decide description logics with full role negation and identity
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
In this paper we compare two approaches to automated reasoning about metric and topology in the framework of the logic $\mathcal{MT}$ introduced in [10]. $\mathcal{MT}$-formulas are built from set variablesp1,p2,... (for arbitrary subsets of a metric space) using the Booleans ∧, ∨, →, and ¬, the distance operators∃a and ∃≤a, for $a\in {\mathbb Q}^{ 0}$, and the topological interior and closure operatorsI and C. Intended models for this logic are of the form $\mathfrak I=(\Delta,d,p_{1}^{\mathfrak I},p_{2}^{\mathfrak I},\dots)$ where (Δ,d) is a metric space and $p_{i}^{\mathfrak I} \subseteq \Delta$. The extension$\varphi^{\mathfrak I} \subseteq \Delta$ of an $\mathcal{MT}$-formula ϕ in $\mathfrak I$ is defined inductively in the usual way, with I and C being interpreted as the interior and closure operators induced by the metric, and $(\exists^{a-neighbourhood of $\varphi^{\mathfrak I}$, and $(\exists^{\le a}\varphi)^{\mathfrak I}$ is the closed one. A formula ϕ is satisfiable if there is a model ${\mathfrak I}$ such that $\varphi^{\mathfrak I} \ne \emptyset$; ϕ is valid if ¬ϕ is not satisfiable.