Similarity-based Reasoning in Qualified Logic Programming

Details Similarity-based Reasoning in Qualified Logic Programming Similarity-based Reasoning in Qualified Logic Programming

2010-08-23

arxiv.org/abs/1008.3867v1

Computer Science

Logic in Computer Science

10 pages, 2 figures, revised edition of Similarity-based Reasoning in Qualified Logic Programming, in PPDP '08: Proceedings of

Scientific paper

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 R 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(R,D) which subsumes both SLP and QLP(D) as particular cases. We also show that SQLP(R,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.

Affiliated with

Also associated with

No associations

Rating

Similarity-based Reasoning in Qualified Logic Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Similarity-based Reasoning in Qualified Logic Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Similarity-based Reasoning in Qualified Logic Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-466124