Sciweavers

300 search results - page 13 / 60
» An extension of the Cayley-Sylvester formula
Sort
View
POPL
2004
ACM
14 years 8 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
CADE
2008
Springer
14 years 8 months ago
Automata-Based Axiom Pinpointing
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...
Franz Baader, Rafael Peñaloza
SIGMOD
2003
ACM
196views Database» more  SIGMOD 2003»
14 years 8 months ago
Spreadsheets in RDBMS for OLAP
One of the critical deficiencies of SQL is lack of support for ndimensional array-based computations which are frequent in OLAP environments. Relational OLAP (ROLAP) applications ...
Andrew Witkowski, Srikanth Bellamkonda, Tolga Bozk...
ICCD
2001
IEEE
154views Hardware» more  ICCD 2001»
14 years 4 months ago
Performance Optimization By Wire and Buffer Sizing Under The Transmission Line Model
As the operating frequency increases to Giga Hertz and the rise time of a signal is less than or comparable to the time-of-flight delay of a line, it is necessary to consider the...
Tai-Chen Chen, Song-Ra Pan, Yao-Wen Chang
TACAS
2010
Springer
191views Algorithms» more  TACAS 2010»
14 years 2 months ago
Blocked Clause Elimination
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
Matti Järvisalo, Armin Biere, Marijn Heule