Author:
Bubeck Uwe,Büning Hans Kleine,Zhao Xishun
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Aspvall, B., Plass, M., Tarjan, R.: A Linear-Time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Information Processing Letters 8(3), 121–123 (1979)
2. Lecture Notes in Computer Science;A. Biere,2005
3. Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified boolean formulae. In: Proc. 16th Natl. Conf. on AI, AAAI 1998 (1998)
4. Dowling, W., Gallier, J.: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae. J. of Logic Programming 1(3), 267–284 (1984)
5. Kleine Büning, H., Lettmann, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press, Cambridge (1999)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献