1302 search results - page 84 / 261 » Fair Equivalence Relations |
ICFP
2008
ACM
14 years 10 months ago
2008
ACM
There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reve...
CONCUR
2008
Springer
13 years 12 months ago
2008
Springer
Abstract. Comparison between different formalisms and models is often by flattening structure and reducing them to behaviorally equivalent models e.g., automaton and Turing machine...
KSEM
2007
Springer
14 years 4 months ago
2007
Springer
Extended argumentation framework is a formalism where defeat relations are determined by establishing a preference between arguments involved in symmetric conflicts. This process ...
HYBRID
2005
Springer
14 years 3 months ago
2005
Springer
In this paper we define a bisimulation concept for some very general models for stochastic hybrid systems (general stochastic hybrid systems). The definition of bisimulation buil...
LICS
2012
IEEE
12 years 17 days ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...