Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Algorithms for precise and imprecise conditional probability assessments
Mathematical models for handling partial knowledge in artificial intelligence
Nonmonotonic reasoning, conditional objects and possibility theory
Artificial Intelligence
Simplification Rules for the Coherent Probability Assessment Problem
Annals of Mathematics and Artificial Intelligence
Locally Strong Coherence in Inference Processes
Annals of Mathematics and Artificial Intelligence
Probabilistic Reasoning Under Coherence in System P
Annals of Mathematics and Artificial Intelligence
Probabilistic Consistency of Knowledge Bases in Inference Systems
ECSQARU '93 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
On the checking of G-coherence of conditional probability bounds
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Probabilistic logic under coherence: complexity and algorithms
Annals of Mathematics and Artificial Intelligence
Managing uncertainty and vagueness in description logics for the Semantic Web
Web Semantics: Science, Services and Agents on the World Wide Web
Correction of incoherent conditional probability assessments
International Journal of Approximate Reasoning
Quasi conjunction and inclusion relation in probabilistic default reasoning
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Some theoretical properties of conditional probability assessments
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Generalizing inference rules in a coherence-based probabilistic default reasoning
International Journal of Approximate Reasoning
Tightly integrated probabilistic description logic programs for representing ontology mappings
Annals of Mathematics and Artificial Intelligence
Incoherence correction strategies in statistical matching
International Journal of Approximate Reasoning
Quasi conjunction, quasi disjunction, t-norms and t-conorms: Probabilistic aspects
Information Sciences: an International Journal
Conditional random quantities and iterated conditioning in the setting of coherence
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| Hi-index | 0.00 |
In this paper, by adopting a coherence-based probabilistic approach to default reasoning, we focus the study on the logical operation of quasi conjunction and the Goodman-Nguyen inclusion relation for conditional events. We recall that quasi conjunction is a basic notion for defining consistency of conditional knowledge bases. By deepening some results given in a previous paper we show that, given any finite family of conditional events F and any nonempty subset S of F, the family F p-entails the quasi conjunction C(S); then, given any conditional event E|H, we analyze the equivalence between p-entailment of E|H from F and p-entailment of E|H from C(S), where S is some nonempty subset of F We also illustrate some alternative theorems related with p-consistency and p-entailment. Finally, we deepen the study of the connections between the notions of p-entailment and inclusion relation by introducing for a pair (F,E|H) the (possibly empty) class K of the subsets S of F such that CS implies E|H. We show that the class K satisfies many properties; in particular K is additive and has a greatest element which can be determined by applying a suitable algorithm.