Approximations and Refinements of Certain Answers via Many-Valued Logics
نویسندگان
چکیده
Computing certain answers is the preferred way of answering queries in scenarios involving incomplete data. This, however, is computationally expensive, so practical systems use efficient techniques based on a particular three-valued logic, although this often leads to
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملClassical Gentzen-Type Methods in Propositional Many-Valued Logics
A classical Gentzen-type system is one which employs two-sided sequents, together with structural and logical rules of a certain characteristic form. A decent Gentzentype system should allow for direct proofs, which means that it should admit some useful forms of cut elimination and the subformula property. In this tutorial we explain the main difficulty in developing classical Gentzen-type sys...
متن کاملA Correspondence Framework between Three-Valued Logics and Similarity-Based Approximate Reasoning
This paper focuses on approximate reasoning based on the use of similarity spaces. Similarity spaces and the approximated relations induced by them are a generalization of the rough set-based approximations of Pawlak [17, 18]. Similarity spaces are used to define neighborhoods around individuals and these in turn are used to define approximate sets and relations. In any of the approaches, one w...
متن کاملTitle Fuzzy Topology and Łukasiewicz Logics from the
This paper explores relationships between many-valued logic and fuzzy topology from the viewpoint of duality theory. We first show a fuzzy topological duality for the algebras of Lukasiewicz n-valued logic with truth constants, which generalizes Stone duality for Boolean algebras to the n-valued case via fuzzy topology. Then, based on this duality, we show a fuzzy topological duality for the al...
متن کاملReduction of Many-valued into Two-valued Modal Logics
In this paper we develop a 2-valued reduction of many-valued logics, into 2-valued multi-modal logics. Such an approach is based on the contextualization of many-valued logics with the introduction of higher-order Herbrand interpretation types, where we explicitly introduce the coexistence of a set of algebraic truth values of original many-valued logic, transformed as parameters (or possible w...
متن کامل