Logics for approximate and strong entailments
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. I...
Guardado en:
Autores principales: | , , , |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_01650114_v197_n_p59_Esteva |
Aporte de: |
id |
todo:paper_01650114_v197_n_p59_Esteva |
---|---|
record_format |
dspace |
spelling |
todo:paper_01650114_v197_n_p59_Esteva2023-10-03T15:02:31Z Logics for approximate and strong entailments Esteva, F. Godo, L. Rodríguez, R.O. Vetterlein, T. Approximate entailment Non-classical logics Similarity-based reasoning Strong entailment Approximate entailment Logical calculi Non-classical logic Similarity-based reasoning Strong entailment Artificial intelligence Fuzzy sets Biomineralization 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. © 2011 Elsevier B.V. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_01650114_v197_n_p59_Esteva |
institution |
Universidad de Buenos Aires |
institution_str |
I-28 |
repository_str |
R-134 |
collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
topic |
Approximate entailment Non-classical logics Similarity-based reasoning Strong entailment Approximate entailment Logical calculi Non-classical logic Similarity-based reasoning Strong entailment Artificial intelligence Fuzzy sets Biomineralization |
spellingShingle |
Approximate entailment Non-classical logics Similarity-based reasoning Strong entailment Approximate entailment Logical calculi Non-classical logic Similarity-based reasoning Strong entailment Artificial intelligence Fuzzy sets Biomineralization Esteva, F. Godo, L. Rodríguez, R.O. Vetterlein, T. Logics for approximate and strong entailments |
topic_facet |
Approximate entailment Non-classical logics Similarity-based reasoning Strong entailment Approximate entailment Logical calculi Non-classical logic Similarity-based reasoning Strong entailment Artificial intelligence Fuzzy sets Biomineralization |
description |
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. © 2011 Elsevier B.V. |
format |
JOUR |
author |
Esteva, F. Godo, L. Rodríguez, R.O. Vetterlein, T. |
author_facet |
Esteva, F. Godo, L. Rodríguez, R.O. Vetterlein, T. |
author_sort |
Esteva, F. |
title |
Logics for approximate and strong entailments |
title_short |
Logics for approximate and strong entailments |
title_full |
Logics for approximate and strong entailments |
title_fullStr |
Logics for approximate and strong entailments |
title_full_unstemmed |
Logics for approximate and strong entailments |
title_sort |
logics for approximate and strong entailments |
url |
http://hdl.handle.net/20.500.12110/paper_01650114_v197_n_p59_Esteva |
work_keys_str_mv |
AT estevaf logicsforapproximateandstrongentailments AT godol logicsforapproximateandstrongentailments AT rodriguezro logicsforapproximateandstrongentailments AT vetterleint logicsforapproximateandstrongentailments |
_version_ |
1807320187749269504 |