A sound and complete semantics for a similarity-based logic programming language

Similarity-based Logic Programming replaces the syntactic unification algorithm of classical SLD-resolution by a fuzzy one, leading to an operational mechanism that we name Weak SLD-resolution. This is the operational semantics of a subset of Bousi∼Prolog, an extension of Prolog aiming at making the...

Full description

Saved in:
Bibliographic Details
Published in:Fuzzy sets and systems Vol. 317; pp. 1 - 26
Main Authors: Julián-Iranzo, Pascual, Rubio-Manzano, Clemente
Format: Journal Article
Language:English
Published: Elsevier B.V 15.06.2017
Subjects:
Declarative semantics
Fixpoint semantics
Fuzzy logic programming
Operational semantics
Similarity relations
Weak SLD-resolution
Fixpoint semantics
Similarity relations
Declarative semantics
Operational semantics
Weak SLD-resolution
Fuzzy logic programming
ISSN:0165-0114, 1872-6801
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Similarity-based Logic Programming replaces the syntactic unification algorithm of classical SLD-resolution by a fuzzy one, leading to an operational mechanism that we name Weak SLD-resolution. This is the operational semantics of a subset of Bousi∼Prolog, an extension of Prolog aiming at making the query answering process more flexible. In this paper, after recalling the model-theoretic and fixpoint semantics for a pure subset of this language, we detail the operational semantics of Bousi∼Prolog and we prove, among other results, its soundness and completeness. Significantly, throughout this work we also clarify some of the differences between our framework and other related proposals.
ISSN:0165-0114
1872-6801
DOI:10.1016/j.fss.2016.12.016