Abstract
Despite their different perspectives, probabilistic reasoning and disjunctive logic programming strive for similar goals. Both address the problem of representing incomplete information and providing conclusions under reasonable assumptions such as independencies or closed world assumptions. This paper investigates the evaluation of independence assumptions which can be characterized by graphs (MARKOV and BAYESIAN networks). The underlying independence axioms are well-known/spl minus/they correspond to a set of disjunctive clauses. Based on a compact representation of disjunctive clauses, called clause trees, we provide an efficient /spl Delta/-iteration technique with subsumption, which allows us to compute the least fixpoint of the program or alternatively the verification of particular independences. Experimental results revealed that our approach is much more efficient than the conventional evaluation techniques. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
