Artificial Intelligence
Quantitative deduction and its fixpoint theory
Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Paraconsistent logic programming
Theoretical Computer Science
Non-monotonic negation in probabilistic deductive databases
Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
Bilattices and the semantics of logic programming
Journal of Logic Programming
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
Empirical probabilities in Monadic deductive databases
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
Probabilistic logic programming
Information and Computation
Stable semantics for probabilistic deductive databases
Information and Computation
ACM Transactions on Database Systems (TODS)
ProbView: a flexible probabilistic database system
ACM Transactions on Database Systems (TODS)
On the Semantics of Rule-Based Expert Systems with Uncertainty
ICDT '88 Proceedings of the 2nd International Conference on Database Theory
A framework for heuristic reasoning about uncertainty
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Logic programs with uncertainties: a tool for implementing rule-based systems
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Hi-index | 0.00 |
This paper proposes a new knowledge representation language, called QDLP, which extends DLP to deal with uncertain values. A certainty degree interval (a subinterval of [0; 1]) is assigned to each (quantitative) rule. Triangular norms (T-norms) are employed to define calculi for propagating uncertainty information from the premises to the conclusion of a quantitative rule. Negation is considered and the concept of stable model is extended to QDLP. Different T-norms induce different semantics for one given quantitative program. In this sense, QDLP is parameterized and each choice of a T-norm induces a different QDLP language. Each T-norm is eligible for events with determinate relationships (e.g., independence, exclusiveness) between them. Since there are infinitely many T-norms, it turns out that there is a family of infinitely many QDLP languages. This family is carefully studied and the set of QDLP languages which generalize traditional DLP is precisely singled out. Finally, the complexity of the main decisional problems arising in the context of QDLP (i.e., Model Checking, Stable Model Checking, Consistency, and Brave Reasoning) is analyzed. It is shown that the complexity of the relevant fragments of QDLP coincides exactly with the complexity of DLP. That is, reasoning with uncertain values is more general and not harder than reasoning with boolean values.