A general framework for computing maximal contractions

This paper investigates the problem of computing all maximal contractions of a given formula set Γ with respect to a consistent set Δ of atomic formulas and negations of atomic formulas. We first give a constructive definition of minimal inconsistent subsets and propose an algorithmic framework for computing all minimal inconsistent subsets of any given formula set. Then we present an algorithm to compute all maximal contractions fromminimal inconsistent subsets. Based on the algorithmic framework and the algorithm, we propose a general framework for computing all maximal contractions. The computability of the minimal inconsistent subset and maximal contraction problems are discussed. Finally, we demonstrate the ability of this framework by applying it to the first-order language without variables and design an algorithmfor the computation of all maximal contractions.

[1]  Bernhard Nebel,et al.  Base Revision Operations and Schemes: Semantics, Representation and Complexity , 1994, ECAI.

[2]  Dongchen Jiang,et al.  A Revision System Based on Delegate Model for Propositional Logic , 2009, 2009 International Conference on Information Engineering and Computer Science.

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

[4]  Wei Li,et al.  A development calculus for specifications , 2003, Science in China Series F: Information Sciences.

[5]  Wei Li,et al.  R-calculus without the cut rule , 2011, Science China Information Sciences.

[6]  Wei Li.  A Logical Framework for Evolution of Specifications , 1994, ESOP.

[7]  Emilio Corchado,et al.  Intelligent Data Engineering and Automated Learning - IDEAL 2006, 7th International Conference, Burgos, Spain, September 20-23, 2006, Proceedings , 2006, IDEAL.

[8]  Jean H. Gallier,et al.  Logic for Computer Science: Foundations of Automatic Theorem Proving , 1985 .

[9]  He Li,et al.  Notice of RetractionComputing R-contraction for Propositional Logic is Hard , 2010, 2010 Second International Workshop on Education Technology and Computer Science.

[10]  Hector J. Levesque,et al.  Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning , 1991 .

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

[12]  Wei Li.  Mathematical logic - foundations for information science , 2010, Progress in computer science and applied logic.

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

[14]  Wei Li.  Logical verification of scientific discovery , 2010, Science China Information Sciences.

[15]  Kwong-Sak Leung,et al.  Intelligent Data Engineering and Automated Learning — IDEAL 2000. Data Mining, Financial Engineering, and Intelligent Agents , 2002, Lecture Notes in Computer Science.

[16]  Wei Li,et al.  An algorithm to compute maximal contractions for Horn clauses , 2010, Science China Information Sciences.

[17]  Georg Gottlob,et al.  On the complexity of propositional knowledge base revision, updates, and counterfactuals , 1992, Artif. Intell..

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

[19]  Wei Li.  A Computational Framework for Convergent Agents , 2000, IDEAL.

[20]  Wei Li,et al.  R-Calculus: An Inference System for Belief Revision , 2007, Comput. J..

[21]  Dongchen Jiang,et al.  A Revision Approach Based on Assignment Equivalence Classes , 2010, 2010 2nd International Workshop on Intelligent Systems and Applications.