Parker v. Flook
http://dbpedia.org/resource/Parker_v._Flook an entity of type: Thing
Parker v. Flook, 437 U.S. 584 (1978), was a 1978 United States Supreme Court decision that ruled that an invention that departs from the prior art only in its use of a mathematical algorithm is patent eligible only if there is some other "inventive concept in its application." The algorithm itself must be considered as if it were part of the prior art, and the claim must be considered as a whole. The case was argued on April 25, 1978 and was decided June 22, 1978. This case is the second member of the Supreme Court's patent-eligibility trilogy.
rdf:langString
rdf:langString
Parker v. Flook
rdf:langString
rdf:langString
Parker, Acting Commissioner of Patents and Trademarks v. Flook
xsd:integer
2614029
xsd:integer
969038979
rdf:langString
Diamond v. Diehr, Diamond v. Chakrabarty
rdf:langString
Stewart
rdf:langString
Burger, Rehnquist
rdf:langString
Brennan, White, Marshall, Blackmun, Powell
rdf:langString
ยง 101 of the Patent Act
<second>
172800.0
<second>
17280.0
xsd:integer
584
xsd:integer
437
xsd:gMonthDay
--04-25
xsd:integer
1978
rdf:langString
Parker v. Flook,
xsd:gMonthDay
--06-22
xsd:integer
1978
rdf:langString
Parker, Acting Commissioner of Patents and Trademarks v. Flook
rdf:langString
A mathematical algorithm is not patentable if its application is not novel.
rdf:langString
Parker v. Flook
rdf:langString
Stevens
rdf:langString
Parker v. Flook, 437 U.S. 584 (1978), was a 1978 United States Supreme Court decision that ruled that an invention that departs from the prior art only in its use of a mathematical algorithm is patent eligible only if there is some other "inventive concept in its application." The algorithm itself must be considered as if it were part of the prior art, and the claim must be considered as a whole. The case was argued on April 25, 1978 and was decided June 22, 1978. This case is the second member of the Supreme Court's patent-eligibility trilogy.
xsd:nonNegativeInteger
16818