Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference14 articles.
1. B. Aspvall, M.F. Plass and R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Inf. Proc. Lett. 8 (1973) 121?123.
2. B.A. Bernstein, Note on the condition that a Boolean equation has a unique solution, Amer. J. Math. 54 (1952) 417?418.
3. A. Blass and Y. Gurevich, On the Unique Satisfiability Problem, Inf. Control 55 (1982) 80?88.
4. S.A. Cook, The complexity of theorem-proving procedures,Proc. 3rd Annual ACM Symp. on Theory of Computing (ACM, New York, 1979) pp. 151?158.
5. W.F. Dowling and J.H. Gallier, Linear-time algorithms for testing the satisfiability of prepositional Horn formulae, J. Logic Progr. 3 (1984) 267?284.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献