Common equivalence and size after forgetting

Forgetting variables from a propositional formula may increase its size. Introducing new variables is a way to shorten it. Both operations can be expressed in terms of common equivalence, a weakened version of equivalence. In turn, common equivalence can be expressed in terms of forgetting. An algorithm for forgetting and checking common equivalence in polynomial space is given for the Horn case; it is polynomial-time for the subclass of single-head formulae. Minimizing after forgetting is polynomial-time if the formula is also acyclic and variables cannot be introduced, NP-hard when they can.

[1]  Olivier Coudert,et al.  Two-level logic minimization: an overview , 1994, Integr..

[2]  Jonathan M. Smith,et al.  Effects of Copy-on-Write Memory Management on the Response Time of UNIX Fork Operations , 1988, Comput. Syst..

[3]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[4]  Kewen Wang,et al.  A Syntax-Independent Approach to Forgetting in Disjunctive Logic Programs , 2015, AAAI.

[5]  Bae.  50 % , 2018, CME.

[6]  Pierre Marquis,et al.  Reasoning under inconsistency: A forgetting-based approach , 2010, Artif. Intell..

[7]  Hans Kleine Büning,et al.  On the Restricted Equivalence Subclasses of Propositional Logic , 1993, RAIRO Theor. Informatics Appl..

[8]  Fred L. Drake,et al.  The Python Language Reference Manual , 1999 .

[9]  Kewen Wang,et al.  Forgetting and Conflict Resolving in Disjunctive Logic Programming , 2006, AAAI.

[10]  O. Coudert,et al.  Two-level logic minimization , 2001 .

[11]  Jérôme Lang,et al.  Expressive Power and Succinctness of Propositional Languages for Preference Representation , 2004, KR.

[12]  James P. Delgrande,et al.  A Knowledge Level Account of Forgetting , 2017, J. Artif. Intell. Res..

[13]  Matthias Knorr,et al.  The Ultimate Guide to Forgetting in Answer Set Programming , 2016, KR.

[14]  Peter L. Hammer,et al.  Optimal Compression of Propositional Horn Knowledge Bases: Complexity and Approximation , 1993, Artif. Intell..

[15]  Peter L. Hammer,et al.  Quasi-Acyclic Propositional Horn Knowledge Bases: Optimal Compression , 1995, IEEE Trans. Knowl. Data Eng..

[16]  Hector J. Levesque,et al.  Forgetting in Action , 2014, KR.

[17]  Hans Tompits,et al.  Forgetting in Managing Rules and Ontologies , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

[18]  Paolo Liberatore,et al.  Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems , 2005, ArXiv.

[19]  Sylvain Conchon,et al.  Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme , 2009, FroCoS.

[20]  Andreas Herzig,et al.  Introspective Forgetting , 2008, Australasian Conference on Artificial Intelligence.

[21]  Nicolas Peltier.  Propositional Resolution and Prime Implicates Generation , 2016, Arch. Formal Proofs.

[22]  Kewen Wang,et al.  Forgetting for Defeasible Logic , 2012, LPAR.

[23]  Abdul Sattar,et al.  A Theory of Forgetting in Logic Programming , 2005, AAAI.

[24]  Yi Zhou,et al.  Knowledge Forgetting in Answer Set Programming , 2014, J. Artif. Intell. Res..

[25]  Ilka Schnoor,et al.  Complexity of Default Logic on Generalized Conjunctive Queries , 2007, LPNMR.

[26]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[27]  Boris Konev,et al.  Forgetting and Uniform Interpolation in Extensions of the Description Logic EL , 2009, Description Logics.

[28]  Stefan Woltran,et al.  When you must forget: Beyond strong persistence when forgetting in answer set programming , 2017, Theory Pract. Log. Program..

[29]  Francesco M. Donini,et al.  Space Efficiency of Propositional Knowledge Representation Formalisms , 2000, J. Artif. Intell. Res..

[30]  Paolo Liberatore.  The ghosts of forgotten things: A study on size after forgetting , 2020, ArXiv.

[31]  Dhruv Mubayi,et al.  On Approximate Horn Formula Minimization , 2010, ICALP.

[32]  Esra Erdem,et al.  Forgetting Actions in Domain Descriptions , 2007, AAAI.

[33]  E. W. Veitch,et al.  A chart method for simplifying truth functions , 1952, ACM '52.

[34]  Nripendra N. Biswas,et al.  Minimization of Boolean Functions , 1971, IEEE Transactions on Computers.

[35]  Robert E. Tarjan,et al.  Enumeration of the Elementary Circuits of a Directed Graph , 1972, SIAM J. Comput..

[36]  M. Karnaugh.  The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[37]  Hans Kleine Büning,et al.  The Power of Auxiliary Variables for Propositional and Quantified Boolean Formulas , 2010 .

[38]  Alberto L. Sangiovanni-Vincentelli,et al.  Multiple-Valued Minimization for PLA Optimization , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[39]  Gabriele Kern-Isberner,et al.  A Brief Survey on Forgetting from a Knowledge Representation and Reasoning Perspective , 2018, KI - Künstliche Intelligenz.

[40]  Yi Zhou,et al.  Bounded Forgetting , 2011, AAAI.