Similarity in Logic Programming
- 184 Downloads
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.
KeywordsLogic programming approximate reasoning similarity relation abstract interpretation
Unable to display preview. Download preview PDF.
- 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
- 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