Author:
Boros E.,Crama Y.,Hammer P. L.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference26 articles.
1. B. Aspvall, Recognizing disguised NR(1)-instances of the satisfiability problem, J. Algorithms 1 (1980) 97–103.
2. B. Aspvall, M.F. Plass and R.E. Tarjan, A linear-time algorithm for testing the truth of certain quantified Boolean formulas, Information Processing Lett. 8 (1979) 121–123.
3. A. Blake, Canonical expressions in Boolean algebra, Ph.D. Disertation, University of Chicago, ILL (1937).
4. F.M. Brown, The origin of the method of iterated consensus, IEEE Trans. Computers C-17 (1968) 802.
5. C.L. Chang and R.C. Lee,Symbolic Logic and Mechanical Theorem Proving (Academic Press, New York, 1973).
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strong Backdoors for Default Logic;ACM Transactions on Computational Logic;2024-06-17
2. SAT backdoors: Depth beats size;Journal of Computer and System Sciences;2024-06
3. Unique key Horn functions;Theoretical Computer Science;2022-06
4. Tractable Classes in Exactly-One-SAT;Artificial Intelligence: Methodology, Systems, and Applications;2018
5. Autark assignments of Horn CNFs;Japan Journal of Industrial and Applied Mathematics;2017-12-21