Skip to main content

A Similarity-Based WAM for Bousi~Prolog

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5517))

Abstract

Bousi~Prolog is an extension of the standard Prolog language with an operational semantics which is an adaptation of the SLD resolution principle where classical unification has been replaced by a fuzzy unification algorithm based on proximity relations defined on a syntactic domain. In this paper we present the structure and main features of a low level implementation for Bousi~Prolog. It consists in a compiler and an extension of the Warren Abstract Machine (WAM) able to incorporate fuzzy unification.

This work has been partially supported by FEDER and the Spanish Science and Education Ministry under grants TIN 2004-07943-C04-03 and TIN 2007-65749 and by the Castilla-La Mancha Regional Administration under grant PII1I09-0117-4481.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aït-Kaci, H.: Warren’s Abstract Machine: A Tutorial Reconstruction. MIT Press, Cambridge (1991)

    Google Scholar 

  2. Fontana, F.A., Formato, F.: Likelog: A logic programming language for flexible data retrieval. In: Proc. of the ACM SAC, pp. 260–267 (1999)

    Google Scholar 

  3. Fontana, F., Formato, F.: A similarity-based resolution rule. Int. J. Intell. Syst. 17(9), 853–872 (2002)

    Article  MATH  Google Scholar 

  4. Julián, P., Rubio, C., Gallardo, J.: Bousi~Prolog: a Prolog extension language for flexible query answering. In: ENTCS, p. 16. Elsevier, Amsterdam (in press, 2009)

    Google Scholar 

  5. Julián-Iranzo, P.: A procedure for the construction of a similarity relation. In: Málaga, U. (ed.) Proceedings of IPMU, pp. 489–496 (2008)

    Google Scholar 

  6. Julián, P., Rubio, C.: A WAM implementation for flexible query answering. In: Proc. of the 10th IASTED ASC, pp. 262–267. ACTA Press (2006)

    Google Scholar 

  7. Loia, V., Senatore, S., Sessa, M.: Similarity-based SLD resolution and its implementation in an extended prolog system. In: FUZZ-IEEE, pp. 650–653 (2001)

    Google Scholar 

  8. Medina, J., Ojeda-Aciego, M., Vojtáš, P.: Similarity-based unification: a multi-adjoint approach. Fuzzy Sets and Systems 146(1), 43–62 (2004)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  10. Shenoi, S., Melton, A.: Proximity relations in the fuzzy relational database model. Fuzzy Sets and Systems 100, 51–62 (1999)

    Article  MATH  Google Scholar 

  11. Warren, D.H.D.: An Abstract Prolog Instruction Set. Technical note 309, SRI International, Menlo Park, CA (October 1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Julián-Iranzo, P., Rubio-Manzano, C. (2009). A Similarity-Based WAM for Bousi~Prolog. In: Cabestany, J., Sandoval, F., Prieto, A., Corchado, J.M. (eds) Bio-Inspired Systems: Computational and Ambient Intelligence. IWANN 2009. Lecture Notes in Computer Science, vol 5517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02478-8_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02478-8_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02477-1

  • Online ISBN: 978-3-642-02478-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics