On generating small clause normal forms-Reference-Cited by-同舟云学术

On generating small clause normal forms

Published:1998 Issue: Volume: Page:397-411
ISSN:0302-9743
Container-title:Automated Deduction — CADE-15
language:
Short-container-title:

Author:

Nonnengart Andreas,Rock Georg,Weidenbach Christoph

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/BFb0054274

Reference21 articles.

1. Thierry Boy de la Tour. An Optimality Result for Clause Form Translation. Journal of Symbolic Computation, 14:283–301, 1992.

2. Chin-Liang Chang and Richard Char-Tung Lee. Symbolic Logic and Mechanical Theorem Proving. Computer Science and Applied Mathematics. Academic Press, 1973.

3. Li Dafa. The Formulation of the Halting Problem is Not Suitable for Describing the Halting Problem. Association for Automated Reasoning Newsletter, 27:1–7, 1994.

4. Ingo Dahn, J. Gehne, Thomas Honigmann, and Andreas Wolf. Integration of Automated and Interactive Theorem Proving in ILF. In Proceedings of the 14th International Conference on Automated Deduction, CADE-14, volume 1249 of LNAI,pages 57–60, Townsville, Australia, 1997. Springer.

5. Elmar Eder. Relative Complexities of First Order Calculi. Artificial Intelligence. Vieweg, 1992.

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

1. Dot-to-Dot Semantic Representation;Lecture Notes in Computer Science;2024

2. SMT solving for the validation of B and Event-B models;International Journal on Software Tools for Technology Transfer;2022-11-21

3. Tseitin or not Tseitin? The Impact of CNF Transformations on Feature-Model Analyses;Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering;2022-10-10

4. Chapter 27. Non-Clausal SAT and ATPG;Frontiers in Artificial Intelligence and Applications;2021-02-02

5. Knowledge Acquisition from Natural Language with Treebank Semantics and $$\mathcal{F}\textsc {lora}$$-2;New Frontiers in Artificial Intelligence;2021