Sciweavers

2035 search results - page 256 / 407
» On the complexity of stratified logics
Sort
View
VLSID
2004
IEEE
108views VLSI» more  VLSID 2004»
16 years 6 months ago
Boolean Decomposition Using Two-literal Divisors
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
Nilesh Modi, Jordi Cortadella
CADE
2008
Springer
16 years 6 months ago
On Automating the Calculus of Relations
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
Georg Struth, Peter Höfner
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
16 years 6 months ago
Rewriting nested XML queries using nested views
We present and analyze an algorithm for equivalent rewriting of XQuery queries using XQuery views, which is complete for a large class of XQueries featuring nested FLWR blocks, XM...
Nicola Onose, Alin Deutsch, Yannis Papakonstantino...
PODS
2004
ACM
115views Database» more  PODS 2004»
16 years 6 months ago
Foundations of Semantic Web Databases
The Semantic Web is based on the idea of adding more machine-readable semantics to web information via annotations written in a language called the Resource Description Framework ...
Claudio Gutiérrez, Carlos A. Hurtado, Alber...
ICSE
2003
IEEE-ACM
16 years 6 months ago
The Deployer's Problem: Configuring Application Servers for Performance and Reliability
Frameworks such as J2EE are designed to simplify the process of developing enterprise applications by handling much of the complexity of concurrency, transaction, and persistence ...
Mukund Raghavachari, Darrell Reimer, Robert D. Joh...