Declarative and procedural semantics of fuzzy similarity based unification

Peter Vojtáš

Kybernetika (2000)

  • Volume: 36, Issue: 6, page [707]-720
  • ISSN: 0023-5954

Abstract

top
In this paper we argue that for fuzzy unification we need a procedural and declarative semantics (as opposed to the two valued case, where declarative semantics is hidden in the requirement that unified terms are syntactically – letter by letter – identical). We present an extension of the syntactic model of unification to allow near matches, defined using a similarity relation. We work in Hájek’s fuzzy logic in narrow sense. We base our semantics on a formal model of fuzzy logic programming extended by fuzzy similarities and axioms of predicate calculus with equality. Rules are many valued implications and not Horn clauses. We prove soundness and completeness of fuzzy similarity based unification.

How to cite

top

Vojtáš, Peter. "Declarative and procedural semantics of fuzzy similarity based unification." Kybernetika 36.6 (2000): [707]-720. <http://eudml.org/doc/33512>.

@article{Vojtáš2000,
abstract = {In this paper we argue that for fuzzy unification we need a procedural and declarative semantics (as opposed to the two valued case, where declarative semantics is hidden in the requirement that unified terms are syntactically – letter by letter – identical). We present an extension of the syntactic model of unification to allow near matches, defined using a similarity relation. We work in Hájek’s fuzzy logic in narrow sense. We base our semantics on a formal model of fuzzy logic programming extended by fuzzy similarities and axioms of predicate calculus with equality. Rules are many valued implications and not Horn clauses. We prove soundness and completeness of fuzzy similarity based unification.},
author = {Vojtáš, Peter},
journal = {Kybernetika},
keywords = {declarative semantics; fuzzy logic; fuzzy similarity; declarative semantics; fuzzy logic; fuzzy similarity},
language = {eng},
number = {6},
pages = {[707]-720},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Declarative and procedural semantics of fuzzy similarity based unification},
url = {http://eudml.org/doc/33512},
volume = {36},
year = {2000},
}

TY - JOUR
AU - Vojtáš, Peter
TI - Declarative and procedural semantics of fuzzy similarity based unification
JO - Kybernetika
PY - 2000
PB - Institute of Information Theory and Automation AS CR
VL - 36
IS - 6
SP - [707]
EP - 720
AB - In this paper we argue that for fuzzy unification we need a procedural and declarative semantics (as opposed to the two valued case, where declarative semantics is hidden in the requirement that unified terms are syntactically – letter by letter – identical). We present an extension of the syntactic model of unification to allow near matches, defined using a similarity relation. We work in Hájek’s fuzzy logic in narrow sense. We base our semantics on a formal model of fuzzy logic programming extended by fuzzy similarities and axioms of predicate calculus with equality. Rules are many valued implications and not Horn clauses. We prove soundness and completeness of fuzzy similarity based unification.
LA - eng
KW - declarative semantics; fuzzy logic; fuzzy similarity; declarative semantics; fuzzy logic; fuzzy similarity
UR - http://eudml.org/doc/33512
ER -

References

top
  1. Arcelli F., Formato, F., Gerla G., Similitude-based unification as a foundation of fuzzy logic programming, In: Logic Programming and Soft Computing in AI (T. P. Martin and F. Arcelli Fontana, eds.), Research Studies Press, Wiley, New York 1998 
  2. Baldwin J. F., Support logic programming, In: Fuzzy Sets – Theory and Applications (A. Jones, ed.), D. Reidel 1986, pp. 133–170 (1986) Zbl0641.68142
  3. Dubois D., Lang, J., Prade H., Fuzzy sets in approximate reasoning, Part 2: Logical approaches, In: Foundations of Fuzzy Reasoning. Special Memorial Volume; 25 years of fuzzy sets: Attribute to Professor Lotfi Zadeh. First issue (I. B. Turksen, D. Dubois, H. Prade, and R. R. Yager eds.), Fuzzy Sets and Systems 40 (1991), 203–244 (1991) MR1103661
  4. Gottwald S., Fuzzy Sets and Fuzzy Logic, Vieweg, Wiesbaden 1993 Zbl1088.03024MR1218623
  5. Hájek P., Metamathematics of Fuzzy Logic, Kluwer, Dordrecht 1998 Zbl1007.03022MR1900263
  6. Kriško P., Marcinčák P., Mihók P., Sabol, J., Vojtáš P., Low retrieval remote querying dialogue with fuzzy conceptual, syntactical and linguistical unification, In: Proc. FQAS’98 Flexible Query Answering Systems (T. Andreasen et al, eds., Lecture Notes in Computer Science 1495), Springer Verlag, Berlin 1998, pp. 215–226 (1998) 
  7. Lloyd J. W., Foundations of Logic Programming, Springer Verlag, Berlin 1987 Zbl0807.68001MR0911272
  8. Martelli A., Montanari U., 10.1145/357162.357169, ACM Trans. Programming Languages and Systems 4 (1982), 258–282 (1982) Zbl0478.68093DOI10.1145/357162.357169
  9. Pedrycz W., Fuzzy Control and Fuzzy Systems, Report 82/14, Dept. Math., Delft Univ. of Technology Zbl0839.93006
  10. Petry F. E., Fuzzy Databases – Principles and Applications, Kluwer, Dordrecht 1996 Zbl0853.68086
  11. Robinson J. A., 10.1145/321250.321253, J. Assoc. Comp. Mach. 12 (1965), 23–41 (1965) Zbl0139.12303MR0170494DOI10.1145/321250.321253
  12. Emden E. van, 10.1016/0743-1066(86)90003-8, J. Logic Programming 1 (1986), 37–53 (1986) MR0836013DOI10.1016/0743-1066(86)90003-8
  13. Virtanen H. E., Linguistic logic programming, In: Logic Programming and Soft Computing (T. P. Martin and F. Arcelli Fontana, eds., Research Press Studies Lim.), Wiley, New York 1998 MR1655064
  14. Vojtáš P., Fuzzy reasoning with tunable -operators, J. Advanced Comp. Intelligence 2 Fuji Press (1998), 121–127 (1998) 
  15. Vojtáš P., Fuzzy logic programming, Submitted to Proc. Workshop on Fuzzy Logic at FSTA, for Fuzzy Sets and Systems Zbl1015.68036MR1860856
  16. Vojtáš P., Uncertain reasoning with floating connectives, In: Proc. AIT’96 Artificial Intelligence Techniques Brno (J. Žižka, ed.), Technical University Brno, PC–Dir Publ. 1996, pp. 31–40 (1996) 

NotesEmbed ?

top

You must be logged in to post comments.