Bousi~Prolog: a Prolog Extension Language for Flexible Query Answering

  • Authors:

  • Pascual Julián-Iranzo;Clemente Rubio-Manzano;Juan Gallardo-Casero

  • Affiliations:

  • Dep. of Information Technologies and Systems, University of Castilla-La Mancha, Spain;Dep. of Information Technologies and Systems, University of Castilla-La Mancha, Spain;Dep. of Information Technologies and Systems, University of Castilla-La Mancha, Spain

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present the main features and implementation details of a programming language that we call Bousi~Prolog. It can be seen as an extension of Prolog able to deal with similarity-based fuzzy unification (''Bousi'' is the Spanish acronym for ''fuzzy unification by similarity''). The main goal is the implementation of a declarative programming language well suited for flexible query answering. The operational semantics of Bousi~Prolog is an adaptation of the SLD resolution principle where classical unification has been replaced by an algorithm based on similarity relations defined on a syntactic domain. A similarity relation is an extension of the standard notion of equivalence relation and it can be useful in any context where the concept of equality must be weakened. Hence, the syntax of Bousi~Prolog is an extension of the Prolog's language: in general, a Bousi~Prolog program is a set of Prolog clauses plus a set of similarity equations.