A connection between similarity logic programming and gödel modal logic
In this paper we relate two logical similarity-based approaches to approximate reasoning. One approach extends the framework of (propositional) classical logic programming by introducing a similarity relation in the alphabet of the language that allows for an extended unification procedure. The seco...
| Publicado: |
2005
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_84765387_v_n_p775_Blandi http://hdl.handle.net/20.500.12110/paper_84765387_v_n_p775_Blandi |
| Aporte de: |
| id |
paper:paper_84765387_v_n_p775_Blandi |
|---|---|
| record_format |
dspace |
| spelling |
paper:paper_84765387_v_n_p775_Blandi2023-06-08T16:36:50Z A connection between similarity logic programming and gödel modal logic Logic Programming Gödel Logic Similarity Approximate reasoning Kripke model Modal logic Possible worlds Similarity Similarity relations Fuzzy logic Logic programming Many valued logics In this paper we relate two logical similarity-based approaches to approximate reasoning. One approach extends the framework of (propositional) classical logic programming by introducing a similarity relation in the alphabet of the language that allows for an extended unification procedure. The second approach is a many-valued modal logic approach where 3p is understood as approximately p. Here, the similarity relations are introduced at the level of the Kripke models where possible worlds can be similar to some extent. We show that the former approach can be expressed inside the latter. 2005 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_84765387_v_n_p775_Blandi http://hdl.handle.net/20.500.12110/paper_84765387_v_n_p775_Blandi |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Logic Programming Gödel Logic Similarity Approximate reasoning Kripke model Modal logic Possible worlds Similarity Similarity relations Fuzzy logic Logic programming Many valued logics |
| spellingShingle |
Logic Programming Gödel Logic Similarity Approximate reasoning Kripke model Modal logic Possible worlds Similarity Similarity relations Fuzzy logic Logic programming Many valued logics A connection between similarity logic programming and gödel modal logic |
| topic_facet |
Logic Programming Gödel Logic Similarity Approximate reasoning Kripke model Modal logic Possible worlds Similarity Similarity relations Fuzzy logic Logic programming Many valued logics |
| description |
In this paper we relate two logical similarity-based approaches to approximate reasoning. One approach extends the framework of (propositional) classical logic programming by introducing a similarity relation in the alphabet of the language that allows for an extended unification procedure. The second approach is a many-valued modal logic approach where 3p is understood as approximately p. Here, the similarity relations are introduced at the level of the Kripke models where possible worlds can be similar to some extent. We show that the former approach can be expressed inside the latter. |
| title |
A connection between similarity logic programming and gödel modal logic |
| title_short |
A connection between similarity logic programming and gödel modal logic |
| title_full |
A connection between similarity logic programming and gödel modal logic |
| title_fullStr |
A connection between similarity logic programming and gödel modal logic |
| title_full_unstemmed |
A connection between similarity logic programming and gödel modal logic |
| title_sort |
connection between similarity logic programming and gödel modal logic |
| publishDate |
2005 |
| url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_84765387_v_n_p775_Blandi http://hdl.handle.net/20.500.12110/paper_84765387_v_n_p775_Blandi |
| _version_ |
1768545997768622080 |