Abstract: A method for change management includes providing a dependency graph as an instantiation of a linked resource model in which a plurality of resources are linked by at least one dependency. The resources include at least one source resource and at least one target resource, each of the at least one dependency specifying preconditions on at least one of the at least one source resources for the dependency to be activated and an impact on at least one of the at least one target resources when the dependency is activated. A change to one of the plurality of resources is propagated to at least one other of the plurality of resources in the graph and information based on the propagation is output.

Abstract: A method for semantic representation supporting multiple formalisms includes providing a business modeling space (BMS) and a corresponding semantic modeling space (SMS). An inter-layer connection bridge (ILCB) automatically performs transformations between at least one domain specific layer (DSL) and a BPMN layer within the BMS and stores a respective link generated from each transformation in a connect layer of an ILCB layer. A semantically compatible mapping is defined between the BMS and the SMS for each of the at least one DSL, BPMN layer, ILCB layer, and connect layer. Each of the at least one DSL, BPMN layer, and ILCB layer are transformed from the BMS into a corresponding context in the SMS based on the semantically compatible mappings. The connect layer is encoded as at least one explicit bridge rule which connects the corresponding contexts within the SMS.

Abstract: A Version management Service (VMS) that enables consistent management of dynamic digital resources throughout their life cycle. The service handles the association of resources with logical specifications formally expressed using an extensible logical language understood and agreed by tiers. A new version of a digital resource is considered certified only if the resource owner is able to formally prove that the new version satisfies the logical specifications, with the help of the VMS. The VMS uses formal proofs for qualifying changes (occurring either on the resource content or on the corresponding specifications), and for characterizing them through the evolution of version labels. While the resource owners may handle a fully detailed specification (internal), the users may have a simplified view of the same resource, i.e. a particular external specification.

Abstract: A method for change management includes providing a dependency graph as an instantiation of a linked resource model in which a plurality of resources are linked by at least one dependency. The resources include at least one source resource and at least one target resource, each of the at least one dependency specifying preconditions on at least one of the at least one source resources for the dependency to be activated and an impact on at least one of the at least one target resources when the dependency is activated. A change to one of the plurality of resources is propagated to at least one other of the plurality of resources in the graph and information based on the propagation is output.

Abstract: A method for supervising text includes receiving input text in a natural language, the input text including at least one source sentence. The input text is analyzed, which includes, for a source sentence in the input text, generating a syntacetic representation. A target sentence is generated in the same natural language, based on the syntacetic representation. The source sentence is compared with the target sentence to determine whether there is a match. A decision is output, based on the comparison.

Abstract: A method for semantic representation of artifacts includes receiving artifact data which includes transformation data and modification data. The transformation data represents transformations of respective artifacts from a source language to a target language. The languages can be domain-specific or generic. The modification data represents modifications in the source and/or target languages to one or more of the artifacts for which transformation data has been received. Based on the received artifact data, a semantic representation is generated. The representation includes objects representing the artifacts together with associated transformations and modifications. Objects are also associated with respective local contexts which denote a respective one of the languages. At least some of the objects in the semantic representation are associated with inferences based on inference definitions.

Abstract: A computer-implemented system and method for processing a markup language document and its change history are provided. The method includes receiving first and second versions of the same target document into computer memory. One of the first and second versions of the target document is encapsulated within an encapsulating document. A change history corresponding to a difference between the first version and the second version of the target document is encoded. The change history is encapsulated within the encapsulating document. The encapsulated document can then be output. As each new version of the target document is created, the encapsulating document can be modified to reflect the changes, enabling prior versions of the target document which have been encapsulated to be extracted at any time.

Abstract: A system and method generate an ontology of linked resources. The method includes providing a policy comprising at least one logical rule which is to hold across an ontology of linked resources and initializing a set of resources with an initial subset of the set of resources, each resource in the initial subset being identified by a respective link. Each of the resources in the subset is processed, which includes populating the ontology with a corresponding member of a resource class, for a resource that is valid against a schema, asserting the member's class as a class specific to the schema of the validated resource in the ontology and providing a dependency specification for extracting links within the resource, each extracted link identifying one of the set of resources.

Abstract: A system and method generate an ontology of linked resources. The method includes providing a policy comprising at least one logical rule which is to hold across an ontology of linked resources and initializing a set of resources with an initial subset of the set of resources, each resource in the initial subset being identified by a respective link. Each of the resources in the subset is processed, which includes populating the ontology with a corresponding member of a resource class, for a resource that is valid against a schema, asserting the member's class as a class specific to the schema of the validated resource in the ontology and providing a dependency specification for extracting links within the resource, each extracted link identifying one of the set of resources.

Abstract: A computer-implemented method and system for encoding (and decoding) nodes of a tree structure are provided. The method includes receiving nodes of a tree structure into memory and, with a processor, for each node of at least one node in the tree structure, creating a numeric encoding by assigning an encoding value to the node, a root node N0 having a fixed encoding value and any other node Nj having an encoding value which is a function of an encoding value of its parent node and an integer k, where Nj is the kth child of the parent node. The encoding enables a path from the node to be traversed to the root node of the tree by applying a decomposition function to the encoding.

Abstract: A system and method for encrypting/decrypting a document is provided. The encryption method includes encrypting portions within the document containing structural information with an asymmetric public key, encrypting portions within the document containing content information with a symmetric private key, and outputting the document, whereby a service provider provided with a public key is able to access and process only the structural information.

Abstract: A computer-implemented method and system for encoding (and decoding) nodes of a tree structure are provided. The method includes receiving nodes of a tree structure into memory and, with a processor, for each node of at least one node in the tree structure, creating a numeric encoding by assigning an encoding value to the node, a root node N0 having a fixed encoding value and any other node Nj having an encoding value which is a function of an encoding value of its parent node and an integer k, where Nj is the kth child of the parent node. The encoding enables a path from the node to be traversed to the root node of the tree by applying a decomposition function to the encoding.

Abstract: A system and method for encrypting/decrypting a document is provided. The encryption method includes encrypting portions within the document containing structural information with an asymmetric public key, encrypting portions within the document containing content information with a symmetric private key, and outputting the document, whereby a service provider provided with a public key is able to access and process only the structural information.

Abstract: A computer-based method and system for processing links in a markup language document are provided. The method includes providing a specification in computer memory, the specification including at least one link description rule and at least one link processing rule for processing links which satisfy the link description rule. A markup language document is input to computer memory and links in the markup language document are processed in accordance with the link description rule(s) and link processing rule(s) of the specification to generate processed data. The processed data includes at least one of a modified markup language document and data derived from the markup language document.

Abstract: A system, method, and computer program product for computing a digest value of a document, one or more schemas, and a validation report. The validation report indicates a validation status of the document based on the schema or schemas. The digest value is encrypted to produce a digital signature of the document, the schema or schemas, and the validation report.

Abstract: An SGML validation system comprises: an XML validation engine; a translator configured to convert an SGML document to a translated XML document; a set of XML schemas against which the XML validation engine validates the translated XML document, the XML schema set configured such that errors detected by the validation of the translated XML document correspond to SGML errors in the SGML document; and a report generator configured to generate an error report identifying SGML errors corresponding with errors detected by the validation and linking the identified SGML errors with corresponding locations in the SGML document.

Abstract: A computer-implemented system and method for processing a markup language document and its change history are provided. The method includes receiving first and second versions of the same target document into computer memory. One of the first and second versions of the target document is encapsulated within an encapsulating document. A change history corresponding to a difference between the first version and the second version of the target document is encoded. The change history is encapsulated within the encapsulating document. The encapsulated document can then be output. As each new version of the target document is created, the encapsulating document can be modified to reflect the changes, enabling prior versions of the target document which have been encapsulated to be extracted at any time.

Abstract: A computer-based method and system for processing links in a markup language document are provided. The method includes providing a specification in computer memory, the specification including at least one link description rule and at least one link processing rule for processing links which satisfy the link description rule. A markup language document is input to computer memory and links in the markup language document are processed in accordance with the link description rule(s) and link processing rule(s) of the specification to generate processed data. The processed data includes at least one of a modified markup language document and data derived from the markup language document.

Abstract: To determine a table structure, a spatially ordered sequence of rectangular cells (42) disposed in a two dimensional region is derived. The ordered sequence of rectangular cells is parsed in accordance with a two-dimensional structural grammar (54) having terminal elements corresponding to cells and non-terminal elements corresponding to structural relationship operators. The parsing produces a grammatical expression (52) with the cells represented by terminal elements and structural relationships represented by non-terminal elements.

Abstract: In a method for identifying cells, line graphics are converted into vectors (12) having a canonical form without vector overlaps or crossings. Connecting vectors (22, 24, 26, 30, 32) are associated, including (i) forking vectors (22) having common starting points, and (ii) meeting vectors (24) having common ending points. A set of vectors is identified including at least two forking vectors and two meeting vectors cooperatively defining a cell.