ProbLog: A Probabilistic Prolog and Its Application in Link Discovery

A general framework for minimisation-based belief change is presented. A problem instance is made up of an undirected graph, where a formula is associated with each vertex. For example, vertices may represent spatial locations, points in time, or some other notion of locality. Information is shared between vertices via a process of minimisation over the graph. We give equivalent semantic and syntactic characterisations of this minimisation. We also show that this approach is general enough to capture existing minimisation-based approaches to belief merging, belief revision, and (temporal) extrapolation operators. While we focus on a set-theoretic notion of minimisation, we also consider other approaches, such as cardinality-based and priority-based minimisation.

[1]  Torsten Schaub,et al.  A consistency-based framework for merging knowledge bases , 2007, J. Appl. Log..

[2]  Richard Booth,et al.  Social contraction and belief negotiation , 2002, Inf. Fusion.

[3]  Stefan Woltran,et al.  On Computing Belief Change Operations using Quantified Boolean Formulas , 2004, J. Log. Comput..

[4]  Norman Y. Foo,et al.  Negotiation as Mutual Belief Revision , 2004, AAAI.

[5]  J. Lang,et al.  Propositional Independence - Formula-Variable Independence and Forgetting , 2011, J. Artif. Intell. Res..

[6]  Torsten Schaub,et al.  A consistency-based approach for belief change , 2003, Artif. Intell..

[7]  Sébastien Konieczny,et al.  Merging Information Under Constraints: A Logical Framework , 2002, J. Log. Comput..

[8]  P. Bork,et al.  Association of genes to genetically inherited diseases using data mining , 2002, Nature Genetics.

[9]  Odile Papini,et al.  Revision: an application in the framework of GIS , 2000, International Conference on Principles of Knowledge Representation and Reasoning.

[10]  Marco Schaerf,et al.  BReLS: A System for the Integration of Knowledge Bases , 2000, KR.

[11]  Kishor S. Trivedi,et al.  An improved algorithm for coherent-system reliability , 1998 .

[12]  Marco Schaerf,et al.  Arbitration: A Commutative Operator for Belief Revision , 1995, WOCFAI.

[13]  Peter A. Flach.  Simply logical - intelligent reasoning by example , 1994, Wiley professional computing.

[14]  David Poole,et al.  Probabilistic Horn Abduction and Bayesian Networks , 1993, Artif. Intell..

[15]  Ken Satoh.  Nonmonotonic Reasoning by Minimal Belief Revision , 1988, FGCS.

[16]  Y. Shoham.  Reasoning About Change: Time and Causation from the Standpoint of Artificial Intelligence , 1987 .

[17]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[18]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..