Quantitative deduction and its fixpoint theory
Journal of Logic Programming
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
Partial constraint satisfaction
Artificial Intelligence - Special volume on constraint-based reasoning
Probabilistic logic programming
Information and Computation
Proximity relations in the fuzzy relational database model
Fuzzy Sets and Systems
Semiring-based constraint logic programming: syntax and semantics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fuzzy Sets and Systems: Theory and Applications
Fuzzy Sets and Systems: Theory and Applications
Approximate reasoning by similarity-based SLD resolution
Theoretical Computer Science
Compiling Semiring-Based Constraints with clp (FD, S)
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Multi-adjoint Logic Programming with Continuous Semantics
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Formal Properties of Needed Narrowing with Similarity Relations
Electronic Notes in Theoretical Computer Science (ENTCS)
Similarity-based reasoning in qualified logic programming
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
A declarative semantics for Bousi~Prolog
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Qualified Computations in Functional Logic Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A fuzzy extension of the XPath query language
Journal of Intelligent Information Systems
Similarity relations and fuzzy orderings
Information Sciences: an International Journal
Quantitative logic programming revisited
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Hi-index | 0.00 |
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.