Semantic resolution tree
Jump to navigation
Jump to search
This article needs additional citations for verification. (December 2009) |
A semantic resolution tree is a tree used for the definition of the semantics of a programming language.[1] They have often been used as a theoretical tool for showing the unsatisfiability of clauses in first-order predicate logic.[2]
References
[edit | edit source]
