A Declarative Semantics for CLP with Qualification and Proximity

Computer Science – Logic in Computer Science

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

17 pages, 26th Int'l. Conference on Logic Programming (ICLP'10)

Scientific paper

10.1017/S1471068410000323

Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications. Existing proposals rely on different approaches, such as clause annotations based on uncertain truth values, qualification values as a generalization of uncertain truth values, and unification based on proximity relations. On the other hand, the CLP scheme has established itself as a powerful extension of LP that supports efficient computation over specialized domains while keeping a clean declarative semantics. 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 previous proposals can be viewed as particular cases of the new scheme, obtained by partial instantiation. We present a declarative semantics for SQCLP that is based on observables, providing fixpoint and proof-theoretical characterizations of least program models as well as an implementation-independent notion of goal solutions.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Declarative Semantics for CLP with Qualification and Proximity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Declarative Semantics for CLP with Qualification and Proximity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Declarative Semantics for CLP with Qualification and Proximity will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-183753

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.