Skip to main content
Springer Nature Link
Log in

A Similarity-Based Unification Model for Flexible Querying

  • Conference paper
  • First Online:
Flexible Query Answering Systems (FQAS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2522))

Included in the following conference series:

Abstract

We use the formal model for similarity-based fuzzy unification in multi-adjoint logic programs to provide new tools for flexible querying. Our approach is based on a general framework for logic programming, which gives a formal model of fuzzy logic programming extended by fuzzy similarities and axioms of first-order logic with equality. As a source of similarities we consider different approaches, such as statistical generation of fuzzy similarities, or similarities generated by some information retrieval techniques or similarities arisingfrom fuzzy conceptual lattices.

Partially supported by Slovak grant VEGA 1/7557/20.

Partially supported by Spanish DGI project BFM2000-1054-C02-02.

Partially supported by COST project 274.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Adali and C. Bu.. A flexible architecture for query integration and mapping. In Cooperative Information Systems Conference, 1998.

    Google Scholar 

  2. B. Bouchon-Meunier, M. Rifqi and S. Bothorel. Towards general measures of comparison of objects. Fuzzy Sets and Systems, 84:143–153, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  3. S.M. Chen, M.S. Yeh and P.Y. Hsiao. A comparison of similarity measures of fuzzy values. Fuzzy Sets and Systems 72:79–89, 1995

    Article  MathSciNet  Google Scholar 

  4. S. Decker, S. Melnik, F. van Harmelen, D. Fensel, M. Klein, J. Broekstra, M. Erdmann, and I. Horrocks. The semantic web: the roles of XML and RDF. IEEE Internet Computing, 43:2–13, 2000.

    Google Scholar 

  5. P. Fonck, J. Fodor and M. Roubens. An application of aggregation procedures to the definition of measures of similarity between fuzzy sets Fuzzy Sets and Systems 97:67–74, 1998

    Article  MATH  MathSciNet  Google Scholar 

  6. K.G. Jeffery. What’s next in database. ERCIM News, 39:24–26, 1999.

    Google Scholar 

  7. F. Klawonn and J.L. Castro. Similarity in fuzzy reasoning Mathware and Soft Computing 2:336–350, 1995.

    MathSciNet  Google Scholar 

  8. J. Medina, M. Ojeda-Aciego, and P. Vojtáš. A procedural semantics for multiadjoint logic programming. In Progress in ArtificialIntel ligence, EPIA’01, pages 290–297. Lect. Notes in Artificial Intelligence 2258, 2001.

    Google Scholar 

  9. J. Medina, M. Ojeda-Aciego, and P. Vojtáš. Similarity-based unification: a multiadjoint approach. Fuzzy Sets and Systems, 2002. Submitted.

    Google Scholar 

  10. C.P. Pappis and N.I. Karacapilidis. A comparative assessment of measures of similarity of fuzzy values Fuzzy Sets and Systems 56:171–174, 1993

    Article  MATH  MathSciNet  Google Scholar 

  11. M.I. Sessa. Approximate reasoning by similarity-based SLD resolution. Theoretical Computer Science, 275(1-2):389–426, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  12. P. Vojtáš and Z. Fabián. Aggregating similar witnesses for flexible query answering. In H.L. Larsen et al., editor, Flexible Query Answering Systems, FQAS’00, pages 220–229. Physica Verlag, 2000.

    Google Scholar 

  13. X. Wang, B. De Baets. and E. Kerre. A comparative study of similarity measures Fuzzy Sets and Systems 73:259–268, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  14. A. Yazici and D. Cibiceli. An access structure for similarity-based fuzzy databases. Information Sciences, 115(1-4):137–163, 1999.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inst. of Informatics, P.J. Šafárik University, Slovakia

    S. Krajči & R. Lencses

  2. Dept. Matemática Aplicada, Univ. Málaga, Spain

    J. Medina & M. Ojeda-Aciego

  3. Inst. of Computer Science, Acad. Sci. of the Czech Republic, Spain

    P. Vojtáš

Authors
  1. S. Krajči
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Lencses
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Medina
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Ojeda-Aciego
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. P. Vojtáš
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carnegie Mellon University, Pittsburgh, PA, USA

    Jaime G. Carbonell

  2. University of Saarland, Saabrücken, Germany

    Jörg Siekmann

  3. Roskilde University, Building 42-1, P.O. Box 260, 4000, Roskilde, Denmark

    Troels Andreasen  & Henning Christiansen  & 

  4. Department of Information and Software Engineering School of Information Technology and Engineering, George Mason University, Fairfax, 22030-4444, Virginia, USA

    Amihai Motro

  5. Dept. of Computer Science and Engineering, Aalborg University Esbjerg, Niels Bohrs Vej 8, 6700, Esbjerg, Denmark

    Henrik Legind Larsen

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krajči, S., Lencses, R., Medina, J., Ojeda-Aciego, M., Vojtáš, P. (2002). A Similarity-Based Unification Model for Flexible Querying. In: Carbonell, J.G., Siekmann, J., Andreasen, T., Christiansen, H., Motro, A., Legind Larsen, H. (eds) Flexible Query Answering Systems. FQAS 2002. Lecture Notes in Computer Science(), vol 2522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36109-X_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-36109-X_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00074-7

  • Online ISBN: 978-3-540-36109-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics