Sciweavers

2920 search results - page 376 / 584
» Finite information logic
Sort
View
WWW
2006
ACM
16 years 7 months ago
Tables and trees don't mix (very well)
There are principal differences between the relational model and XML's tree model. This causes problems in all cases where information from these two worlds has to be brought...
Erik Wilde
WWW
2005
ACM
16 years 7 months ago
Signing individual fragments of an RDF graph
Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statement...
Giovanni Tummarello, Christian Morbidoni, Paolo Pu...
CADE
2002
Springer
16 years 7 months ago
Formal Verification of a Combination Decision Procedure
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
Jonathan Ford, Natarajan Shankar
SAINT
2009
IEEE
16 years 1 months ago
CCDM: Central Controller-Based Device Management Architecture and Method to Split Management Scripts
This paper presents CCDM, a new architecture for management of devices, which collect environmental information and give effects to the environment. CCDM provides easy management ...
Akihiro Sugiyama, Hideya Ochiai, Hiroshi Esaki
CIKM
2009
Springer
16 years 1 months ago
Leveraging a scalable row store to build a distributed text index
Many content-oriented applications require a scalable text index. Building such an index is challenging. In addition to the logic of inserting and searching documents, developers ...
Ning Li, Jun Rao, Eugene J. Shekita, Sandeep Tata