Skip to main content

Similarity in Logic Programming

  • Chapter

Abstract

By introducing a similarity relation R between constant and predicate symbols in the language of a logic program P, it is possible to perform approximate inferences. Indeed, it allows us to manage alternative instances of entities that can be considered“equal” with a given degree. We analyze the semantics of this approach exploiting an abstract interpretation technique. The abstract domain is obtained by considering suitable equivalence relations associated with the similarity R. The optimality of the abstract semantics is proved and the definition of fuzzy Herbrand model is also introduced.

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
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Apt Krkysztof, R. Logic Programming. In Handbook of Theoretical Computer Science Vol. B, Jan van Leeuwen (Ed.), Amsterdam: Elsevier, 1990.

    Google Scholar 

  • Biacino, L.; Gerla, G. Logics with approximate premises. (To appear in Journal of Intelligent Systems).

    Google Scholar 

  • Cousot, P.; Cousot, R. Abstract interpretation and application to logic programs. Journal of Logic Programming, 1992; 13: 103–179.

    Article  MathSciNet  MATH  Google Scholar 

  • Van Emden, M.H.; Kowalski, R.A. The semantics of predicate Logic as a programming language. Journal of ACM 1976; 23(4): 733–742.

    Google Scholar 

  • Formato, F.; Gerla, G.; Sessa, M.I. Similarity-based Unification. (Submitted).

    Google Scholar 

  • Klawonn, F.; Castro, J.L. Similarity in fuzzy reasoning. Mathware & Soft Computing 1995; 2: 197–228; Ying M. A logic for approximate reasoning. The Journal of Symbolic Logic 1994; 59.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Gerla, G., Sessa, M.I. (1999). Similarity in Logic Programming. In: Chen, G., Ying, M., Cai, KY. (eds) Fuzzy Logic and Soft Computing. The International Series on Asian Studies in Computer and Information Science, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5261-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4615-5261-1_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7399-5

  • Online ISBN: 978-1-4615-5261-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics