Sciweavers

1004 search results - page 43 / 201
» Safe Constraint Queries
Sort
View
CADE
2003
Springer
14 years 9 months ago
Proof Search and Proof Check for Equational and Inductive Theorems
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
Eric Deplagne, Claude Kirchner, Hélè...
FLOPS
2010
Springer
14 years 1 months ago
Tag-Free Combinators for Binding-Time Polymorphic Program Generation
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Peter Thiemann, Martin Sulzmann
TIME
2002
IEEE
14 years 1 months ago
Representation and Reasoning with Disjunctive Temporal Constraints
We show the expressiveness provided by a Labelled point-based metric model for specifying and reasoning about complex disjunctive temporal constraints. The model allows us to mana...
María Isabel Alfonso Galipienso, Federico B...
ICDE
2006
IEEE
177views Database» more  ICDE 2006»
14 years 10 months ago
Searching Substructures with Superimposed Distance
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
Xifeng Yan, Feida Zhu, Jiawei Han, Philip S. Yu
ICDT
2007
ACM
107views Database» more  ICDT 2007»
14 years 2 months ago
Privacy in GLAV Information Integration
Abstract. We define and study formal privacy guarantees for information integration systems, where sources are related to a public schema by mappings given by source-to-target dep...
Alan Nash, Alin Deutsch