On the Complexity of Derivation in Propositional Calculus-Reference-Cited by-同舟云学术

On the Complexity of Derivation in Propositional Calculus

Published:1983 Issue: Volume: Page:466-483
ISSN:
Container-title:Automation of Reasoning
language:
Short-container-title:

Author:

Tseitin G. S.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-81955-1_28.pdf

Reference3 articles.

1. C. Berge, Theory of Graphs and Its Applications [Russian translation], IL, Moscow (1962).

2. N.A. Shanin, G.V. Davydov, S.Yu. Maslov, G.F. Mints, V.P. Orevkov, and A.O. Slisenko, An Algorithm for a Computer-Aided Search for Natural Logical Proofs in the Predicate Calculus [in Russian], “Nauka”, Moscow (1965).

3. J. A. Robinson, A machine-oriented logic based on the resolution principle„ J. Assoc. Computing Mach., 12 (1): 23–41 (1965).

Cited by 199 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SAT and Lattice Reduction for Integer Factorization;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

2. Divider verification using symbolic computer algebra and delayed don’t care optimization: theory and practical implementation;Formal Methods in System Design;2024-05-24

3. Network Can Help Check Itself: Accelerating SMT-based Network Configuration Verification Using Network Domain Knowledge;IEEE INFOCOM 2024 - IEEE Conference on Computer Communications;2024-05-20

4. Fermihedral: On the Optimal Compilation for Fermion-to-Qubit Encoding;Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3;2024-04-27

5. A knowledge compilation perspective on queries and transformations for belief tracking;Annals of Mathematics and Artificial Intelligence;2024-01-31