A sound semantics for a similarity-based logic programming language

Authors:
Pascual Julián-Iranzo;Clemente Rubio-Manzano
Affiliations:
Department of Information Technologies and Systems, University of Castilla-La Mancha;Department of Information Technologies and Systems, University of Castilla-La Mancha
Venue:
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
Year:
2011

Citing 7
Cited 0

Quantitative deduction and its fixpoint theory

Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Approximate reasoning by similarity-based SLD resolution

Theoretical Computer Science
Similarity-based reasoning in qualified logic programming

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
A declarative semantics for Bousi~Prolog

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Quantitative logic programming revisited

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bousi~Prolog is an extension of the standard Prolog language aiming at to make more flexible the query answering process and to deal with vagueness applying declarative techniques. In this paper we precise a model-theoretic semantics for a pure subset of this language. Next, for the first time, we define a notion of correct answer which provides a declarative description of the output of a program and a goal in the context of a similarity relation. Afterwards, we recall both the WSLDresolution principle and a similarity-based unification algorithm which is the basis of its operational mechanism and then we prove the soundness of WSLD-resolution.