Sciweavers

548 search results - page 34 / 110
» On the Limitations of Power Macromodeling Techniques
Sort
View
AAAI
1994
15 years 14 days ago
Temporal Reasoning with Constraints on Fluents and Events
We propose a propositional language for temporal reasoning that is computationally effective yet expressive enough to describe information about fluents, events and temporal const...
Eddie Schwalb, Kalev Kask, Rina Dechter
IDEAS
2009
IEEE
129views Database» more  IDEAS 2009»
14 years 8 months ago
Speeding-up data-driven applications with program summaries
We consider the class of database programs and address the problem of minimizing the cost of their exchanges with the database server. This cost partly consists of query execution...
Sonia Guehis, Virginie Goasdoué-Thion, Phil...
LICS
2008
IEEE
15 years 5 months ago
Structural Logical Relations
Tait’s method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed λ-calculi. Histo...
Carsten Schürmann, Jeffrey Sarnat
DATE
2006
IEEE
145views Hardware» more  DATE 2006»
15 years 5 months ago
Building a better Boolean matcher and symmetry detector
Boolean matching is a powerful technique that has been used in technology mapping to overcome the limitations of structural pattern matching. The current basis for performing Bool...
Donald Chai, Andreas Kuehlmann
JMLC
2000
Springer
15 years 2 months ago
Explicit Namespaces
A namespace is a mapping from labels to values. Most programming languages support different forms of namespaces, such as records, dictionaries, objects, environments, packages and...
Franz Achermann, Oscar Nierstrasz