Paper Info
Title
Similarity-based reasoning in qualified logic programming
Abstract
Similarity-based Logic Programming (briefly, SLP) has been proposed to enhance the LP paradigm with a kind of approximate reasoning which supports flexible information retrieval applications. This approach uses a fuzzy similarity relation ℝ between symbols in the program's signature, while keeping the syntax for program clauses as in classical LP. Another recent proposal is the QLP(D) scheme for Qualified Logic Programming, an extension of the LP paradigm which supports approximate reasoning and more. This approach uses annotated program clauses and a parametrically given domain D whose elements qualify logical assertions by measuring their closeness to various users' expectations. In this paper we propose a more expressive scheme SQLP(ℝ, D) which subsumes both SLP and QLP(D) as particular cases. We also show that SQLP(ℝ, D) programs can be transformed into semantically equivalent QLP(D) programs. As a consequence, existing QLP(D) implementations can be used to give efficient support for similarity-based reasoning
Year
DOI
Venue
2010
10.1145/1389449.1389472
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Keywords
DocType
Volume
qualified logic programming,approximate reasoning,similarity-based reasoning,similarity-based logic programming,expressive scheme,domain d,annotated program clause,lp paradigm,program clause,classical lp,programming language,information retrieval
Journal
abs/1008.3867
Citations 
PageRank 
References 
14
0.62
17
Authors
3
Name
Order
Citations
PageRank
Rafael Caballero1140.96
Mario Rodríguez-Artalejo271659.70
Carlos A. Romero-Díaz3473.94