Computer Science – Logic in Computer Science
Scientific paper
2010-09-10
Computer Science
Logic in Computer Science
47 pages, 2 figures, extended version with full proofs of A Declarative Semantics for CLP with Qualification and Proximity (
Scientific paper
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 report 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.
Rodríguez-Artalejo Mario
Romero-Díaz Carlos A.
No associations
LandOfFree
Fixpoint & Proof-theoretic 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 Fixpoint & Proof-theoretic 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 Fixpoint & Proof-theoretic Semantics for CLP with Qualification and Proximity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-672455