1679 search results - page 11 / 336 » Strong order equivalence |
104
click to vote
SOFSEM
1997
Springer
15 years 5 months ago
1997
Springer
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...
200
click to vote
ICDE
2004
IEEE
16 years 3 months ago
2004
IEEE
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...
155
Voted
ICLP
2003
Springer
15 years 7 months ago
2003
Springer
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...
IANDC
2010
15 years 12 days ago
2010
Simulation preorder/equivalence and bisimulation equivalence are the most commonly used equivalences in concurrency theory. Their standard definitions are often called strong sim...
103
click to vote
ICTAI
2007
IEEE
15 years 8 months ago
2007
IEEE
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...