Appeal No. 2004-1890 2
Application No. 09/225,974
The claimed invention relates to a computer system and method of searching for
information to construct an information object in which a resource having information
stored as bindable data elements is queried. The bindable data elements, which are
structures that can be bound to each other in an additive manner, have binding rules which
are specified in the bindable data elements. According to Appellant’s specification (page
2, lines 7-30), bindable data elements are defined as including primitives, fragments (two
or more primitives bound together), and information objects (multiple primitives and
fragments bound together), the binding being provided according to binding rules specified
in the primitives and fragments.
Claim 1 is illustrative of the invention and reads as follows:
1. A method of searching for information to construct an informationobject
comprises:
querying a resource having information stored as bindable data elements
with bindable data elements being structures that can be bound to each other in
an additive manner, with binding being according to a binding specification that is
implemented by binding rules that are specified in the bindable data element; and
returning as a result of querying the resource bindable data elements that
can be combined together to construct the information object according to the
binding rules.
The Examiner relies on the following prior art:
Suver 6,016,497 Jan. 18, 2000
(filed Dec. 24, 1997)
Carey et al. (Carey) 6,134,540 Oct. 17, 2000
(filed May 09, 1997)
Page: Previous 1 2 3 4 5 6 7 8 9 10 Next
Last modified: November 3, 2007