Proof Theoretic Reasoning in System P

Simon Parsons and Rachel A. Bourne

This paper investigates how the rules of System P might be used in order to construct proofs for default rules which take into account the bounds on the probabilities of the consequents of the defaults. The paper defines a proof system, shows that it is sound, and then discusses at length the completeness of the system, and the kind of proofs that it can generate.

This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.