The equivalence problem and correctness formulas for a simple class of programs
Abstract
Index Terms
- The equivalence problem and correctness formulas for a simple class of programs
Recommendations
The Equivalence Problem of Simple Programs
Many problems, some of them quite meaningful, have been proved to be recursively unsolvable for programs in general. The paper is directed toward a class of programs where many decision problems are solvable. The equivalence problem has been proved to ...
Extension and equivalence problems for clause minimal formulae
Inspired by the notion of minimal unsatisfiable formulae we first introduce and study the class of clause minimal formulae. A CNF formula F is said to be clause minimal if any proper subformula of F is not equivalent to F. We investigate the equivalence ...
Extension and Equivalence Problems for Clause Minimal Formulae
Inspired by the notion of minimal unsatisfiable formulae we first introduce and study the class of clause minimal formulae. A CNF formula F is said to be clause minimal if any proper subformula of F is not equivalent to F. We investigate the equivalence ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Academic Press Professional, Inc.
United States
Publication History
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in