| Autor: |
Goos, G., Hartmanis, J., van Leeuwen, J., Tepfenhart, William M., Cyre, Walling, Carbonell, Jaime G., Siekmann, Jörg, Braüner, Torben, Nilsson, Jørgen Fischer, Rasmussen, Anne |
| Zdroj: |
Conceptual Structures: Standards & Practices; 1999, p456-469, 14p |
| Abstrakt: |
The first part of this paper presents a logico-algebraic reconstruction of conceptual graph fundamentals using an appropriately extended binary relation algebra. The algebraisation comprises axioms which in a straightforward and instructive fashion admit deductive reasoning by term rewriting. As an application of the described logico-algebraic framework, the second part of the paper addresses formalisation of analogical reasoning. It is suggested that analogical reasoning be carried out as clausal resolution inference using axioms of the binary relation algebra together with the application specific axioms corresponding to the domains under consideration. This makes the analogical reasoning amenable to implementation in logic programming languages. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
