Sciweavers

32 search results - page 6 / 7
» Interpolation, Definability and Fixed Points in Interpretabi...
Sort
View
CADE
2008
Springer
14 years 7 months ago
Automated Induction with Constrained Tree Automata
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
Adel Bouhoula, Florent Jacquemard
ECAI
2010
Springer
13 years 8 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
CORR
2008
Springer
179views Education» more  CORR 2008»
13 years 7 months ago
Induction and Co-induction in Sequent Calculus
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
Alwen Tiu, Alberto Momigliano
ICALP
2000
Springer
13 years 11 months ago
A Statically Allocated Parallel Functional Language
Abstract. We describe SAFL, a call-by-value first-order functional language which is syntactically restricted so that storage may be statically allocated to fixed locations. Evalua...
Alan Mycroft, Richard Sharp
SIGMOD
2006
ACM
156views Database» more  SIGMOD 2006»
14 years 7 months ago
MauveDB: supporting model-based user views in database systems
Real-world data -- especially when generated by distributed measurement infrastructures such as sensor networks -- tends to be incomplete, imprecise, and erroneous, making it impo...
Amol Deshpande, Samuel Madden