Computing Small Clause Normal Forms
- 1 January 2001
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- A BDD-Based Simplification and Skolemization ProcedureLogic Journal of the IGPL, 1995
- A note on assumptions about Skolem functionsJournal of Automated Reasoning, 1995
- ON SKOLEMIZATION AND PROOF COMPLEXITYFundamenta Informaticae, 1994
- An optimality result for clause form translationJournal of Symbolic Computation, 1992
- A Structure-preserving Clause Form TranslationJournal of Symbolic Computation, 1986
- Theorem Proving via General MatingsJournal of the ACM, 1981