Sciweavers

330 search results - page 28 / 66
» Intersection and Union Types
Sort
View
DATE
2003
IEEE
85views Hardware» more  DATE 2003»
14 years 29 days ago
Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis
Symbolic techniques usually use characteristic functions for representing sets of states. Boolean functional vectors provide an alternate set representation which is suitable for ...
Amit Goel, Randal E. Bryant
CSL
2001
Springer
14 years 4 days ago
Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
Hitoshi Ohsaki
VLDB
1992
ACM
173views Database» more  VLDB 1992»
13 years 11 months ago
An Extended Relational Database Model for Uncertain and Imprecise Information
We propose an extended relational database model which can model both uncertainty and imprecision in data. This model is basedon Dempster-Shafertheory which has become popular in ...
Suk Kyoon Lee
COMPGEOM
2005
ACM
13 years 9 months ago
Inclusion-exclusion formulas from independent complexes
Using inclusion-exclusion, we can write the indicator function of a union of finitely many balls as an alternating sum of indicator functions of common intersections of balls. We...
Dominique Attali, Herbert Edelsbrunner
FMCAD
2008
Springer
13 years 9 months ago
Augmenting a Regular Expression-Based Temporal Logic with Local Variables
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...
Cindy Eisner, Dana Fisman