Jul 21, 2010 · In this paper we propose a new scheme SQCLP designed as an extension of CLP that supports qualification values and proximity relations. We show ...

In this paper we propose a new scheme SQCLP designed as an extension of CLP that supports qualification values and proximity relations. We show that several ...

A declarative semantics for CLP with qualification and proximity. 629. Bistarelli et al. (2001) proposed a semiring-based approach to CLP, where constraints.

In this paper we propose a new scheme SQCLP designed as an extension of CLP that supports qualification values and proximity relations. We show that several ...

Bibliographic details on A declarative semantics for CLP with qualification and proximity.

We present a declarative semantics for SQCLP that is based on observables, providing fixpoint and proof-theoretical characterizations of least program models as ...

A declarative semantics for CLP with qualification and proximity* · Computer Science. Theory and Practice of Logic Programming · 2010.

Apr 25, 2012 · A declarative semantics for CLP with qualification and proximity. Theory and Practice of Logic Programming, 26th Int'l. Conference on Logic ...

Under Consideration for Publication in Theory and Practice of Logic Programming a Transformation-based Implementation for Clp with Qualification and Proximity *.

Uncertainty in logic programming has been widely investigated in the last decades, leading to multiple extensions of the classical LP paradigm.