Quantitative deduction and its fixpoint theory
Journal of Logic Programming
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
Approximate reasoning by similarity-based SLD resolution
Theoretical Computer Science
A Direct Proof for the Completeness of SLD-Resolution
CSL '89 Proceedings of the 3rd Workshop on Computer Science Logic
Query Processing in Quantitative Logic Programming
Proceedings of the 9th International Conference on Automated Deduction
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
Quantitative logic programming revisited
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Programming with fuzzy logic and mathematical functions
WILF'05 Proceedings of the 6th international conference on Fuzzy Logic and Applications
| Hi-index | 0.01 |
Research on the field of uncertainty in logic programming has evolved during the last 25 years. In a recent paper [M. Rodriguez-Artalejo and C.A. Romero-Diaz. Quantitative logic programming revisited. In J. Garrigue and M. Hermenegildo, editors, Functional and Logic Programming (FLOPS'08), volume 4989 of LNCS, pages 272-288. Springer Verlag, 2008] we have revised a classical approach by van Emden's to Quantitative Logic Programming [M.H. van Emden. Quantitative deduction and its fixpoint theory. Journal of Logic Programming, 3(1):37-53, 1986], generalizing it to a generic scheme QLP(D) for so-called Qualified Logic Programming over a parametrically given domain D, whose elements play the role of generalized truth values and can be used to qualify logical assertions. In this paper we present an extension of QLP(D) yielding a more expressive scheme BQLP(D), which supports a simple kind of negation based on bivalued predicates and allows threshold constraints in clause bodies in order to impose lower bounds to the qualifications computed by program clauses. The new scheme has a rigorous declarative semantics and a sound and strongly complete goal resolution procedure which can be efficiently implemented using constraint logic programming technology.