Talk:Paradox (theorem prover)
This is the talk page for discussing improvements to the Paradox (theorem prover) article. This is not a forum for general discussion of the article's subject. |
Article policies
|
Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL |
![]() | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
|
![]() | This article was nominated for deletion on 5 November 2018. The result of the discussion was keep. |
Not positive that this is "non-notable"
editI did a quick google, there is at least one external citation of the software at http://www.cs.nott.ac.uk/~led/papers/led_bsc_dissertation.pdf. Additionally this theorem prover is listed at http://www.haskell.org/haskellwiki/Libraries_and_tools/Theorem_provers. However I am having some problems finding the source code of this software. Such code should exist somewhere as this is Free Software licensed under the GNU/GPL. I'm not positive this is notable, but I'm also not convinced that the software is non-notable. Therefore I am going to remove the proposal for deletion template and investigate a bit further over the weekend and next week as I have time. If I fail to find any source code or additional references, than deletion is appropriate. —— nixeagleemail me 02:22, 9 September 2011 (UTC)
November 2018 article accuracy concerns
editan archived page seems to indicate this is a finite-domain model finder rather than an automated theorem prover (ATP). (Equinox is however an ATP. This is not to say Paradox cannot be a component of an ATP system. As far as I can tell.Djm-leighpark (talk) 10:08, 6 November 2018 (UTC) I've now added this reference to the article and improved artice to match so my concerns are now alleviated.07:16, 7 November 2018 (UTC)
Other References
edit— Preceding unsigned comment added by Djm-leighpark (talk • contribs) 00:32, 8 November 2018 (UTC)