Probabilistic argumentation systems: A new way to combine logic with probability

Probability is usually closely related to Boolean structures, i.e., Boolean algebras or propositional logic. Here we show, how probability can be combined with non-Boolean structures, and in particular non-Boolean logics. The basic idea is to describe uncertainty by (Boolean) assumptions, which may or may not be valid. The uncertain information depends then on these uncertain assumptions, scenarios or interpretations. We propose to describe information in information systems, as introduced by Scott into domain theory. This captures a wide range of systems of practical importance such as many propositional logics, first order logic, systems of linear equations, inequalities, etc. It covers thus both symbolic as well as numerical systems. Assumption-based reasoning allows then to deduce supporting arguments for hypotheses. A probability structure imposed on the assumptions permits to quantify the reliability of these supporting arguments and thus to introduce degrees of support for hypotheses. Information systems and related information algebras are formally introduced and studied in this paper as the basic structures for assumption-based reasoning. The probability structure is then formally represented by random variables with values in information algebras. Since these are in general non-Boolean structures some care must be exercised in order to introduce these random variables. It is shown that this theory leads to an extension of Dempster-Shafer theory of evidence and that information algebras provide in fact a natural frame for this theory.

[1]  J. Kohlas,et al.  Information Algebras and Information Systems , 1996 .

[2]  Nic Wilson,et al.  Logical Deduction Using the Local Computation Framework , 1999, ESCQARU.

[3]  J. Kohlas Information Algebras , 2003, Discrete Mathematics and Theoretical Computer Science.

[4]  Jürg Kohlas,et al.  Assumption-Based Modeling Using ABEL , 1997, ECSQARU-FAPR.

[5]  Prakash P. Shenoy,et al.  Computation in Valuation Algebras , 2000 .

[6]  Johan de Kleer,et al.  An Assumption-Based TMS , 1987, Artif. Intell..

[7]  Jon Barwise,et al.  Information Flow: The Logic of Distributed Systems , 1997 .

[8]  P. Monney A Mathematical Theory of Arguments for Statistical Evidence , 2002 .

[9]  Jürg Kohlas,et al.  A Mathematical Theory of Hints , 1995 .

[10]  Prakash P. Shenoy,et al.  Axioms for probability and belief-function proagation , 1990, UAI.

[11]  Ewa Orlowska Information Algebras , 1995, AMAST.

[12]  P. Halmos Lectures on Boolean Algebras , 1963 .

[13]  J. Dekleer An assumption-based TMS , 1986 .

[14]  H.P.M. Jagers,et al.  Information in context , 2001 .

[15]  Dana S. Scott,et al.  Some Domain Theory and Denotational Semantics in Coq , 2009, TPHOLs.

[16]  J. Kohlas,et al.  A Mathematical Theory of Hints: An Approach to the Dempster-Shafer Theory of Evidence , 1995 .

[17]  Claudette Cayrol,et al.  On the Acceptability of Arguments in Preference-based Argumentation , 1998, UAI.

[18]  J. Neveu Bases mathématiques du calcul des probabilités , 1966 .

[19]  Rolf Haenni,et al.  Probabilistic Argumentation Systems , 2003 .

[20]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[21]  Nicholas R. Jennings,et al.  Agents That Reason and Negotiate by Arguing , 1998, J. Log. Comput..

[22]  Anthony Hunter,et al.  A logic-based theory of deductive arguments , 2001, Artif. Intell..

[23]  Kathryn B. Laskey,et al.  Assumptions, Beliefs and Probabilities , 1989, Artif. Intell..

[24]  D. A. Kappos,et al.  Probability algebras and stochastic spaces , 1969 .

[25]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[26]  Gerard Vreeswijk,et al.  Defeasible Dialectics: A Controversy-Oriented Approach Towards Defeasible Argumentation , 1993, J. Log. Comput..

[27]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.