A DPLL Procedure for the Propositional Product Logic
暂无分享,去创建一个
[1] Toby Walsh,et al. Handbook of satisfiability , 2009 .
[2] Dov M. Gabbay,et al. Analytic Calculi for Product Logics , 2004, Arch. Math. Log..
[3] Lluis Godo,et al. On Product Logic with Truth-constants , 2006, J. Log. Comput..
[4] Dusan Guller. On the Satisfiability and Validity Problems in the Propositional Gödel Logic , 2010, IJCCI.
[5] Petr Hájek,et al. A complete many-valued logic with product-conjunction , 1996, Arch. Math. Log..
[6] Reiner Hähnle. Exploiting Data Dependencies in Many-Valued Logics , 1996, J. Appl. Non Class. Logics.
[7] Dusan Guller. On the refutational completeness of signed binary resolution and hyperresolution , 2009, Fuzzy Sets Syst..
[8] Thierry Boy de la Tour. An Optimality Result for Clause Form Translation , 1992, J. Symb. Comput..
[9] G. Escalada-Imaz,et al. The satisfiability problem in regular CNF-formulas , 1998, Soft Comput..
[10] Daniele Mundici,et al. Satisfiability in Many-Valued Sentential Logic is NP-Complete , 1987, Theor. Comput. Sci..
[11] W. W. Bledsoe,et al. A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness , 1970, JACM.
[12] Reiner Hähnle,et al. Many-valued logic and mixed integer programming , 1994, Annals of Mathematics and Artificial Intelligence.
[13] Christoph Weidenbach,et al. On Generating Small Clause Normal Forms , 1998, CADE.
[14] Dusan Guller. A DPLL Procedure for the Propositional Gödel Logic , 2010, IJCCI.
[15] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[16] Reiner Hähnle,et al. The SAT problem of signed CNF formulas , 2000 .
[17] Reiner Hähnle. Proof theory of many-valued logic—linear optimization—logic design: connections and interactions , 1997, Soft Comput..
[18] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[19] David A. Plaisted,et al. A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..
[20] Stefano Aguzzoli,et al. Finiteness in Infinite-Valued Łukasiewicz Logic , 2000, J. Log. Lang. Inf..
[21] Reiner Hähnle,et al. Short Conjunctive Normal Forms in Finitely Valued Logics , 1994, J. Log. Comput..
[22] Daniel Sheridan,et al. The Optimality of a Fast CNF Conversion and its Use with SAT , 2004, SAT.