Sciweavers

25 search results - page 3 / 5
» Action Relations In Rationale Clauses And Means Clauses
Sort
View
CIE
2007
Springer
15 years 3 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
BDA
2007
14 years 11 months ago
Towards Action-Oriented Continuous Queries in Pervasive Systems
Pervasive information systems give an overview of what digital environments should look like in the future. From a data-centric point of view, traditional databases have to be use...
Yann Gripay, Frédérique Laforest, Je...
CADE
2004
Springer
15 years 2 months ago
Modular Proof Systems for Partial Functions with Weak Equality
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
Harald Ganzinger, Viorica Sofronie-Stokkermans, Uw...
JCDL
2003
ACM
129views Education» more  JCDL 2003»
15 years 2 months ago
XML Semantics and Digital Libraries
The lack of a standard formalism for expressing the semantics of an XML vocabulary is a major obstacle to the development of high-function interoperable digital libraries. XML doc...
Allen Renear, David Dubin, C. M. Sperberg-McQueen,...
TABLEAUX
2009
Springer
15 years 1 months ago
Tableaux for Projection Computation and Knowledge Compilation
Projection computation is a generalization of second-order quantifier elimination, which in turn is closely related to the computation of forgetting and of uniform interpolants. O...
Christoph Wernhard