Quantitative deduction and its fixpoint theory
Journal of Logic Programming
Handbook of theoretical computer science (vol. B)
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
Likelog: a logic programming language for flexible data retrieval
Proceedings of the 1999 ACM symposium on Applied computing
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Fundamenta Informaticae
Fuzzy Sets and Systems
Approximate reasoning by similarity-based SLD resolution
Theoretical Computer Science
Query Processing in Quantitative Logic Programming
Proceedings of the 9th International Conference on Automated Deduction
Quantitative logic programming revisited
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Programming with fuzzy logic and mathematical functions
WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
Qualified Logic Programming with Bivalued Predicates
Electronic Notes in Theoretical Computer Science (ENTCS)
A declarative semantics for Bousi~Prolog
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Qualified Computations in Functional Logic Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A declarative semantics for clp with qualification and proximity*
Theory and Practice of Logic Programming
A sound semantics for a similarity-based logic programming language
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Hi-index | 0.00 |
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