"A logic for approximate reasoning with a comparative connective"
: Working Papers ECAI-?2012 Workshop on WL4AI, 2012
A logic for approximate reasoning with a comparative connective
Sprache des Titels:
Working Papers ECAI-?2012 Workshop on WL4AI
The Logic of Approximate Entailment (LAE), introduced in R. Rodriguez's Ph.D. Thesis, uses a graded version of the classical consequence relation. In LAE, reasoning about facts is possible even if relationships between them hold only approximately.
Here, we consider a modification of LAE. Namely, we introduce an additional binary connective $\comp$ expressing the relative proximity of a proposition when compared to another one. We propose a proof system for the new logic and show finite strong completeness. Certain common problems with the axiomatisation of logics for approximate reasoning are shown to be avoidable in the extended language.