Proportional Reasoning in a Boolean Setting
نویسندگان
چکیده
Extrapolations are often based on parallels made between two situations that are thus compared. Comparative information may pertain to similarities as well as to dissimilarities. Analogical proportions, i.e., statements of the form “A is to B as C is to D”, provide a natural way for stating such a parallel. In the Boolean setting, logical proportions, a recently introduced notion that generalizes the idea of analogical proportion, relate four objects through the conjunction of two equivalences between comparison indicators expressing similarities or dissimilarities. Among the 120 existing logical proportions, we identify the ones that are suitable candidates for getting a unique D from C and comparison indicators whose values are obtained from A and B. In order to provide a new introduction to the idea of logical proportion, we first investigate comparative reasoning about objects described in terms of Boolean properties. More precisely, thanks to comparative information that we may have about an object w.r.t. another known object, it is sometimes possible to complete the information we have regarding the initial object.
منابع مشابه
Models of clinical reasoning with a focus on general practice: a critical review
Introduction: Diagnosis lies at the heart of general practice.Every day general practitioners (GPs) visit patients with awide variety of complaints and concerns, with often minor butsometimes serious symptoms. General practice has many featureswhich differentiate it from specialty care setting, but during thelast four decades little attention was paid to clinical reasoningin general practice. T...
متن کاملRelations Algebras in Qualitative Spatial Reasoning
The formalization of the “part – of” relationship goes back to the mereology of S. Leśniewski, subsequently taken up by Leonard & Goodman (1940), and Clarke (1981). In this paper we investigate relation algebras obtained from different notions of “part–of”, respectively, “connectedness” in various domains. We obtain minimal models for the relational part of mereology in a general setting, and w...
متن کاملRepresenting Paraconsistent Reasoning via Quantified Propositional Logic
Quantified propositional logic is an extension of classical propositional logic where quantifications over atomic formulas are permitted. As such, quantified propositional logic is a fragment of secondorder logic, and its sentences are usually referred to as quantified Boolean formulas (QBFs). The motivation to study quantified propositional logic for paraconsistent reasoning is based on two fu...
متن کاملParaconsistent Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories
Through minimal-model semantics, three-valued logics provide an interesting formalism for capturing reasoning from inconsistent information. However, the resulting paraconsistent logics lack so far a uniform implementation platform. Here, we address this and specifically provide a translation of two such paraconsistent logics into the language of quantified Boolean formulas (QBFs). These formul...
متن کاملSemi-G-filters, Stonean filters, MTL-filters, divisible filters, BL-filters and regular filters in residuated lattices
At present, the filter theory of $BL$textit{-}algebras has been widelystudied, and some important results have been published (see for examplecite{4}, cite{5}, cite{xi}, cite{6}, cite{7}). In other works such ascite{BP}, cite{vii}, cite{xiii}, cite{xvi} a study of a filter theory inthe more general setting of residuated lattices is done, generalizing thatfor $BL$textit{-}algebras. Note that fil...
متن کامل