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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Fuzzy sets and systems Ročník 317; s. 1 - 26
Hlavní autoři: Julián-Iranzo, Pascual, Rubio-Manzano, Clemente
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 15.06.2017
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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