Combining Syntax and Semantics through Prime Form Representation

This article presents an algorithm that, besides calculating the number of models of a propositional logic theory, also determines the distribution of these models among the terms of a disjunctive normal form representation of the theory. Using prime implicants to represent the target theory, in a knowledge compilation context, we discuss how this distribution can be used to define belief change operators that respect the theory structure. Some experimental results are also presented.

[1]  Johan de Kleer.  An Improved Incremental Algorithm for Generating Prime Implicates , 1992, AAAI.

[2]  Magnus Wahlström,et al.  Counting Satisfying Assignments in 2-SAT and 3-SAT , 2002, COCOON.

[3]  Melvin Fitting,et al.  First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[4]  Marco Cadoli,et al.  A Survey on Knowledge Compilation , 1997, AI Commun..

[5]  Alex Kean,et al.  An Incremental Method for Generating Prime Implicants/Impicates , 1990, J. Symb. Comput..

[6]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[7]  Mukesh Dalal,et al.  Investigations into a Theory of Knowledge Base Revision , 1988, AAAI.

[8]  Ron Rymon.  An SE-tree-based prime implicant generation algorithm , 2005, Annals of Mathematics and Artificial Intelligence.

[9]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[10]  Pierre Marquis,et al.  A Perspective on Knowledge Compilation , 2001, IJCAI.

[11]  Andreas Herzig,et al.  Propositional Belief Base Update and Minimal Change , 1999, Artif. Intell..

[12]  Jerusa Marchi,et al.  A Syntactic Approach to Satisfaction , 2008 .

[13]  George Becker,et al.  CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates , 2004, Journal of Automated Reasoning.

[14]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .

[15]  Guilherme Bittencourt,et al.  An Algorithm for Dual Transformation in First-Order Logic , 2004, Journal of Automated Reasoning.

[16]  P G rdenfors,et al.  Knowledge in flux: modeling the dynamics of epistemic states , 1988 .

[17]  Erik Rosenthal,et al.  The Semi-Resolution Inference Rule and Prime Implicate Computations , 1995 .

[18]  W. Quine.  On Cores and Prime Implicants of Truth Functions , 1959 .

[19]  Dan Roth,et al.  On the Hardness of Approximate Reasoning , 1993, IJCAI.

[20]  Christopher Umans.  The Minimum Equivalent DNF Problem and Shortest Implicants , 2001, J. Comput. Syst. Sci..

[21]  Olivier Dubois,et al.  Counting the Number of Solutions for Instances of Satisfiability , 1991, Theor. Comput. Sci..

[22]  Wenhui Zhang,et al.  Number of Models and Satisfiability of Sets of Clauses , 1996, Theor. Comput. Sci..

[23]  Rolf Socher.  Optimizing the clausal normal form transformation , 2004, Journal of Automated Reasoning.

[24]  Jerusa Marchi,et al.  A Syntactical Approach to Revision , 2004, ECAI.

[25]  Hirofumi Katsuno,et al.  On the Difference between Updating a Knowledge Base and Revising It , 1991, KR.

[26]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[27]  Alvaro del Val.  Syntactic Characterizations of Belief Change Operators , 1993, IJCAI.

[28]  Roberto J. Bayardo,et al.  Counting Models Using Connected Components , 2000, AAAI/IAAI.

[29]  Sven Ove Hansson,et al.  A textbook of belief dynamics - theory change and database updating , 1999, Applied logic series.

[30]  Peter Jackson,et al.  Computing Prime Implicants , 1990, CADE.

[31]  Jerusa Marchi,et al.  A Syntactical Approach to Belief Update , 2005, MICAI.

[32]  Robert A. MacLachlan.  CMU Common Lisp User''s Manual , 1992 .

[33]  Eliezer L. Lozinskii,et al.  The Good Old Davis-Putnam Procedure Helps Counting Models , 2011, J. Artif. Intell. Res..

[34]  Bernhard Nebel,et al.  Belief Revision and Default Reasoning: Syntax-Based Approaches , 1991, KR.

[35]  João Silva.  On Computing Minimum Size Prime Implicants , 1997 .

[36]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[37]  Richard C. T. Lee,et al.  A New Algorithm for Generating Prime Implicants , 1970, IEEE Transactions on Computers.

[38]  Jerusa Marchi,et al.  Propositional Reasoning for an Embodied Cognitive Model , 2004, SBIA.