Finding Hard Instances of Satisfiability in Lukasiewicz Logics
暂无分享,去创建一个
Felip Manyà | Mateu Villaret | Miquel Bofill | Amanda Vidal | F. Manyà | Miquel Bofill | Mateu Villaret | Amanda Vidal
[1] Robert E. Tarjan,et al. A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas , 1979, Inf. Process. Lett..
[2] Petr Hájek,et al. Metamathematics of Fuzzy Logic , 1998, Trends in Logic.
[3] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[4] Bruno Dutertre,et al. Yices 2.2 , 2014, CAV.
[5] D. Gabbay,et al. Proof theory for fuzzy logics. Applied Logic Series, vol. 36 , 2010 .
[6] Rafael Peñaloza,et al. Many-valued Horn Logic is Hard , 2014, PRUV.
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[9] Carlos Ansótegui,et al. Building Automated Theorem Provers for Infinitely-Valued Logics with Satisfiability Modulo Theory Solvers , 2012, 2012 IEEE 42nd International Symposium on Multiple-Valued Logic.
[10] James M. Crawford,et al. Experimental Results on the Crossover Point inSatis ability , 1993 .
[11] Carlos Ansótegui,et al. SAT and SMT Technology for Many-Valued Logics , 2015, J. Multiple Valued Log. Soft Comput..
[12] Brunella Gerla,et al. Complexity issues in basic logic , 2005, Soft Comput..
[13] Hantao Zhang,et al. An Efficient Algorithm for Unit Propagation , 1996 .
[14] Lluis Godo,et al. An SMT-Based Solver for Continuous t-norm Based Logics , 2012, SUM.