Sciweavers

207 search results - page 17 / 42
» Canonical Forms for Data-Specifications
Sort
View
ENTCS
2006
113views more  ENTCS 2006»
14 years 9 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
HYBRID
2009
Springer
15 years 4 months ago
Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
Radu Grosu
WOLLIC
2007
Springer
15 years 3 months ago
Hydra Games and Tree Ordinals
Hydra games were introduced by Kirby and Paris, for the formulation of a result which is independent from Peano arithmetic but depends on the transfinite structure of 0. Tree ordi...
Ariya Isihara
AGP
1999
IEEE
15 years 2 months ago
Comparing expressiveness of set constructor symbols
In this paper we consider the relative expressive power of two very common operators applicable to sets and multisets: the with and the union operators. For such operators we prove...
Agostino Dovier, Carla Piazza, Alberto Policriti
CORR
2010
Springer
132views Education» more  CORR 2010»
14 years 9 months ago
Functorial Data Migration
In this paper we present a simple database definition language: that of categories and functors. A database schema is a category and a state is a set-valued functor. We show that m...
David I. Spivak