Sciweavers

1679 search results - page 11 / 336
» Strong order equivalence
Sort
View
SOFSEM
1997
Springer
14 years 3 days ago
On Finite Representations of Infinite-State Behaviours
Abstract. We examine the problem of finite-state representability of infinitestate processes w.r.t. certain behavioural equivalences. We show that the classical notion of regularit...
Antonín Kucera
ICDE
2004
IEEE
89views Database» more  ICDE 2004»
14 years 10 months ago
Nested Queries and Quantifiers in an Ordered Context
We present algebraic equivalences that allow to unnest nested algebraic expressions for order-preserving algebraic operators. We illustrate how these equivalences can be applied s...
Norman May, Sven Helmer, Guido Moerkotte
ICLP
2003
Springer
14 years 1 months ago
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
Thomas Eiter, Michael Fink
IANDC
2010
68views more  IANDC 2010»
13 years 7 months ago
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
Antonín Kucera, Richard Mayr
ICTAI
2007
IEEE
14 years 2 months ago
Strong Inverse Consistencies for Non-Binary CSPs
Domain filtering local consistencies, such as inverse consistencies, that only delete values and do not add new constraints are particularly useful in Constraint Programming. Alt...
Kostas Stergiou