We consider two kinds of similarity-based reasoning and formalise them in a logical setting. In one case, we are led by the principle that conclusions can be drawn even if they are only approximately correct. This leads to a graded approximate entailment, which is weaker than classical entailment. In the other case, we follow the principle that conclusions must remain correct even if the assumptions are slightly changed. This leads to a notion of a graded strong entailment, which is stronger than classical entailment. We develop two logical calculi based on the notions of approximate and of strong entailment, respectively.
Links:
[1] http://www.iiia.csic.es/en/individual/francesc-esteva
[2] http://www.iiia.csic.es/en/individual/lluis-godo
[3] http://www.iiia.csic.es/en/individual/ricardo-oscar-rodriguez
[4] http://www.iiia.csic.es/en/node/3644
[5] http://dx.doi.org/10.1016/j.fss.2011.09.005
[6] http://www.iiia.csic.es/en/publications/keyword/Non-classical logics
[7] http://www.iiia.csic.es/en/publications/keyword/Similarity-based reasoning
[8] http://www.iiia.csic.es/en/publications/keyword/Approximate entailment
[9] http://www.iiia.csic.es/en/publications/keyword/Strong entailment
[10] http://www.iiia.csic.es/en/publications/export/tagged/4316
[11] http://www.iiia.csic.es/en/publications/export/xml/4316
[12] http://www.iiia.csic.es/en/publications/export/bib/4316
[13] http://www.iiia.csic.es/en/project/arinf
[14] http://www.iiia.csic.es/en/project/locomotion-0
[15] http://www.iiia.csic.es/en/project/matomuvi