en.swpat.org is a wiki.   You can edit it.   May contain statements End Software Patents does not endorse.

November 2014: About Microsoft’s patent licence for .NET core

SitemapCountriesWhy abolish?Law proposalsStudiesCase lawPatent office case lawLawsuits


Stålmarck's algorithm

From en.swpat.org
Jump to: navigation, search

Stålmarck's algorithm, which describes a decision procedure, is covered in the USA by patent [1]. 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 often cite the patent itself. The alternative is to cite the unpublished manuscript.

The algorithm 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.

[edit] Related pages on en.swpat.org


This wiki is part of the End Software Patents (ESP) campaign (donate). For more information, see:
>> endsoftwarepatents.org (Main ESP website) <<
>> endsoftwarepatents.org/news (News) <<

This wiki is publicly editable. (See: en.swpat.org:About) It's a pool of information, not a statement of ESP's views or policies, so no permission is required. Add your knowledge! (See: Help:How to make a good contribution)