ESP Wiki is looking for moderators and active contributors!
Difference between revisions of "Stålmarck's algorithm"
(==Related pages on {{SITENAME}}== * Software is math * Example software patents {{footer}} Category: Example software patents) |
(publication date) |
||
| Line 3: | Line 3: | ||
Academic papers explicitly note its patented status: [http://www.cl.cam.ac.uk/~jrh13/papers/stalmarck.html in 1996], [http://dl.acm.org/citation.cfm?id=594285 in 2000], etc. It is notable that the algorithm actually was never properly published, so academic publications actually cite the patent itself, which I think is rare for a software patent. The alternative is to cite the unpublished manuscript. | Academic papers explicitly note its patented status: [http://www.cl.cam.ac.uk/~jrh13/papers/stalmarck.html in 1996], [http://dl.acm.org/citation.cfm?id=594285 in 2000], etc. It is notable that the algorithm actually was never properly published, so academic publications actually cite the patent itself, which I think is rare for a software patent. The alternative is to cite the unpublished manuscript. | ||
| − | It is important enough that the standard handbook of the field, [http://books.google.co.kr/books?id=lYSYLPWJQKMC Handbook of Practical Logic and Automated Reasoning], devotes nearly 10 pages to the algorithm. As usual, the book notes its patented status on [http://books.google.co.kr/books?id=lYSYLPWJQKMC&pg=PA90 page 90]. | + | It is important enough that the standard handbook of the field, [http://books.google.co.kr/books?id=lYSYLPWJQKMC Handbook of Practical Logic and Automated Reasoning] (published 2009), devotes nearly 10 pages to the algorithm. As usual, the book notes its patented status on [http://books.google.co.kr/books?id=lYSYLPWJQKMC&pg=PA90 page 90]. |
==Related pages on {{SITENAME}}== | ==Related pages on {{SITENAME}}== | ||
Revision as of 21:00, 21 April 2015
Stålmarck's algorithm is a patented decision procedure. It is widely known to be patented, and it is often considered that all "saturation based decision procedure" is claimed by the patent.
Academic papers explicitly note its patented status: in 1996, in 2000, etc. It is notable that the algorithm actually was never properly published, so academic publications actually cite the patent itself, which I think is rare for a software patent. The alternative is to cite the unpublished manuscript.
It is important enough that the standard handbook of the field, Handbook of Practical Logic and Automated Reasoning (published 2009), devotes nearly 10 pages to the algorithm. As usual, the book notes its patented status on page 90.
