Analysis of the use of semantic trees in automated theorem proving
Semantic trees have served as a theoretical tool for confirming the unsatisfiability of clauses in first-order predicate logic, but it has seemed impractical to use them in practice. In this thesis we experimentally investigated the practicality of generating semantic trees for proofs of unsatisfiab...
Main Author: | Almulla, Mohammed Ali |
---|---|
Other Authors: | Newborn, Monty (advisor) |
Format: | Others |
Language: | en |
Published: |
McGill University
1994
|
Subjects: | |
Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=28662 |
Similar Items
-
Parallel semantic tree theorem proving with resolutions
by: Kim, Choon Kyu, 1963-
Published: (2004) -
Semantic trees : new foundations for automatic theorem-proving
by: Hayes, Patrick J.
Published: (1973) -
Willow : extending Herby's semantic tree theorem-proving heuristics
by: Lapierre, Patrice.
Published: (1999) -
Resolution based techniques for automated proving of theorems in Tarskian-Euclidian geometry
by: Savchenko, Sergei.
Published: (1999) -
Automated Theorem Proving : Resolution vs. Tableaux
by: Folkler, Andreas
Published: (2002)