Computer Science – Logic in Computer Science
Scientific paper
2003-06-07
Computer Science
Logic in Computer Science
12 pages
Scientific paper
A decision procedure for detecting valid propositional formulas is presented. It is based on the Davis-Putnam method and deals with propositional formulas that are initially converted to negational normal form. This procedure splits variables but, in contrast to other decision procedures based on the Davis-Putnam method, it does not branch. Instead, this procedure iteratively makes validity-preserving transformations of fragments of the formula. The transformations involve only a minimal formula part containing occurrences of the selected variable. Selection of the best variable for splitting is crucial in this decision procedure - it may shorten the decision process dramatically. A variable whose splitting leads to a minimal size of the transformed formula is selected. Also, the decision procedure performs plenty of optimizations based on calculation of delta-sets. Some optimizations lead to removing fragments of the formula. Others detect variables for which a single truth value assignment is sufficient. The latest information about this research can be found at http://www.sakharov.net/valid.html
No associations
LandOfFree
A Transformational Decision Procedure for Non-Clausal Propositional Formulas does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Transformational Decision Procedure for Non-Clausal Propositional Formulas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Transformational Decision Procedure for Non-Clausal Propositional Formulas will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-75356