Talk:Superposition calculus
 | This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
I don't know much about high-order mathematical logic but...
[edit]"every unsatisfiable clause set can eventually be proved to be unsatisfiable" this is just plain grammatically wrong, no? Since I will be the first to admit I am not qualified to edit this article, perhaps someone could change this to something that makes more sense. I suppose it should instead read, "every satisfiable clause set can eventually be proved to be unsatisfiable"? 141.70.82.221 (talk) 22:52, 22 March 2009 (UTC)
Raise priority
[edit]I believe Superposition calculus should be at least Mid-Priority. It is an important Automated Theorem Proving topic, and covering it more deeply would give us a comprehensive exposition to standard ATP approaches, given that we already have deep coverage of topics such as:
- Conflict-driven clause learning
- Resolution
- Method of analytic tableaux — Preceding unsigned comment added by 178.197.229.85 (talk) 10:49, 22 March 2020 (UTC)