Sciweavers

2022 search results - page 286 / 405
» Complexity of Non-Monotonic Logics
Sort
View
ICDT
2012
ACM
251views Database» more  ICDT 2012»
13 years 8 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
PODS
2009
ACM
171views Database» more  PODS 2009»
16 years 7 months ago
XML schema mappings
Relational schema mappings have been extensively studied in connection with data integration and exchange problems, but mappings between XML schemas have not received the same amo...
Shun'ichi Amano, Leonid Libkin, Filip Murlak
DEBS
2008
ACM
15 years 8 months ago
Event-based constraints for sensornet programming
We propose a sensornet programming model based on declarative spatio-temporal constraints on events only, not sensors. Where previous approaches conflate events and sensors becaus...
Jie Mao, John Jannotti, Mert Akdere, Ugur Ç...
COMPLEXITY
2006
91views more  COMPLEXITY 2006»
15 years 6 months ago
The evolution of technology within a simple computer model
Technology--the collection of devices and methods available to human society--evolves by constructing new devices and methods from ones that previously exist, and in turn offering...
W. Brian Arthur, Wolfgang Polak
DAC
2006
ACM
16 years 7 months ago
Early cutpoint insertion for high-level software vs. RTL formal combinational equivalence verification
Ever-growing complexity is forcing design to move above RTL. For example, golden functional models are being written as clearly as possible in software and not optimized or intend...
Xiushan Feng, Alan J. Hu