Results 1  10
of
741,410
Deciding Equivalences among Aggregate Queries
 PROC. 17TH SYMMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS (PODS)
, 1998
"... Equivalence of aggregate queries is investigated for the class of conjunctive queries with comparisons and the aggregate operators min, max, count, countdistinct, and sum. Essentially, this class contains all unnested SQL queries with the above aggregate operators, with a WHERE clause consisting of ..."
Abstract

Cited by 33 (5 self)
 Add to MetaCart
Equivalence of aggregate queries is investigated for the class of conjunctive queries with comparisons and the aggregate operators min, max, count, countdistinct, and sum. Essentially, this class contains all unnested SQL queries with the above aggregate operators, with a WHERE clause consisting
Probabilistic algorithms for deciding equivalence of straightline programs
 J. ACM
, 1983
"... Let Q be any algebraic structure and ~the set of all total programs over Q using the instruction set {z,, 1, z,, x + y, z,, x y, z ~ x * y, z ~ x/y}. (A program is total if no division by zero occurs during any computation) Let the equivalence problem for ~ be the problem of deciding for tw ..."
Abstract

Cited by 47 (1 self)
 Add to MetaCart
Let Q be any algebraic structure and ~the set of all total programs over Q using the instruction set {z,, 1, z,, x + y, z,, x y, z ~ x * y, z ~ x/y}. (A program is total if no division by zero occurs during any computation) Let the equivalence problem for ~ be the problem of deciding
DECIDING EQUIVALENCE OF FINITE TREE AUTOMATA by Helmut Seidl
"... We show:for mJe~j constant m it can be decided in polynomial time whether or not two mambiguous finite tree automata are equivalent. In general, inequivalence for finite tree automata is DEXPTIfdEcomplete v).r.t, logspace reductions, and PSPACEcomplete w.r.t, logspace reductions, if the automata ..."
Abstract
 Add to MetaCart
We show:for mJe~j constant m it can be decided in polynomial time whether or not two mambiguous finite tree automata are equivalent. In general, inequivalence for finite tree automata is DEXPTIfdEcomplete v).r.t, logspace reductions, and PSPACEcomplete w.r.t, logspace reductions, if the automata
Representing Herbrand Models by Grammars and Deciding Equivalence Efficiently
, 1996
"... . Finding computationally valuable representations of models of predicate logic formulas is an important subtask in many fields related to automated theorem proving, e.g. automated model building or semantic resolution. In this article we investigate the use of contextfree languages for representin ..."
Abstract
 Add to MetaCart
for representing single Herbrand models, emphasizing algorithmic issues like the equivalence test (which we solve by applying methods of automated theorem proving again), clause evaluation, etc. Surprisingly our representation turns out to be a natural extension of "linear atomic representations
Deciding Equivalence of TopDown XML Transformations in Polynomial Time
"... Many useful XML transformations can be formulated through deterministic topdown tree transducers. A canonical form for such transducers is presented which allows to decide equivalence of their induced transformations in polynomial time. If the transducer is total, the canonical form can be obtaine ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
Many useful XML transformations can be formulated through deterministic topdown tree transducers. A canonical form for such transducers is presented which allows to decide equivalence of their induced transformations in polynomial time. If the transducer is total, the canonical form can
A New Class of Algebraic Series Having a Decidable Equivalence Problem
"... We introduce a new class of algebraic series with noncommuting variables having a decidable equivalence problem. As a tool we consider star roots of formal power series. Keywords: Algebraic series, equivalence problem TUCS Research Group ..."
Abstract
 Add to MetaCart
We introduce a new class of algebraic series with noncommuting variables having a decidable equivalence problem. As a tool we consider star roots of formal power series. Keywords: Algebraic series, equivalence problem TUCS Research Group
A compositional method for deciding equivalence and termination of nondeterministic programs
 IFM 2010, LNCS
, 2010
"... Abstract. In this paper we address the problem of deciding may and mustequivalence and termination of nondeterministic finite programs from secondorder recursionfree Erratic Idealized Algol. We use game semantics to compositionally extract finite models of programs, and the CSP process algebra a ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract. In this paper we address the problem of deciding may and mustequivalence and termination of nondeterministic finite programs from secondorder recursionfree Erratic Idealized Algol. We use game semantics to compositionally extract finite models of programs, and the CSP process algebra
Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids
, 1999
"... In the last decade, some researches on the star problem in trace monoids (is the iteration of a recognizable language also recognizable?) has pointed out the interest of the finite power property to achieve partial solutions of this problem. We prove that the star problem is decidable in some trace ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In the last decade, some researches on the star problem in trace monoids (is the iteration of a recognizable language also recognizable?) has pointed out the interest of the finite power property to achieve partial solutions of this problem. We prove that the star problem is decidable in some trace
S.: Deciding equivalencebased properties using constraint solving. Theoretical Computer Science 492
, 2013
"... Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy or authentication. There are however several security properties, which cannot be defined (or cannot be naturally defined) as trace properties and require ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
, such as processes without replication. Second, we reduce the decidability of trace equivalence (for finite processes) to deciding symbolic equivalence between sets of constraint systems. For simple processes without replication and with trivial else branches, it turns out that it is actually sufficient to decide
Results 1  10
of
741,410