DOIAbstract
We give finite axiomatizations for the varieties generated by representable domain-range algebras when the semigroup operation is interpreted as angelic or demonic composition, respectively
We give finite axiomatizations for the varieties generated by representable domain-range algebras when the semigroup operation is interpreted as angelic or demonic composition, respectively
Demonic composition is defined on the set of binary relations over the non-empty set X, , and is a v...
We propose Kleene algebra with domain (KAD), an extension of Kleene algebra by simple equational axi...
Domain operations on semirings have been axiomatised in two different ways: by a map from an additiv...
We give finite axiomatizations for the varieties generated by representable domain--range algebras w...
Relational semigroups with domain and range are a useful tool for modelling nondeterministic program...
Demonic composition, demonic refinement and demonic union are alternatives to the usual “angelic” co...
Demonic composition ∗ is an associative operation on binary relations, and demonic refinement ⊑ is a...
Relation algebra and its reducts provide us with a strong tool for reasoning about nondeterministic ...
The motivation for using demonic calculus for binary relations stems from the behaviour of demonic t...
AbstractThe family of domain algebras provide an elegant formal system for automated reasoning about...
We give complete, finite quasiequational axiomatisations for algebras of unary partial functions und...
A study of the classes of finite relations as enriched strict monoidal categories is presented in [C...
We give an algebraic model of (H3) designs of Hoare's and He's Unifying Theories of Programming. It ...
AbstractNew axioms for domain operations on semirings and Kleene algebras are proposed. They general...
AbstractWe propose a new and uniform abstract relational approach to demonic nondeterminism and robu...
Demonic composition is defined on the set of binary relations over the non-empty set X, , and is a v...
We propose Kleene algebra with domain (KAD), an extension of Kleene algebra by simple equational axi...
Domain operations on semirings have been axiomatised in two different ways: by a map from an additiv...
We give finite axiomatizations for the varieties generated by representable domain--range algebras w...
Relational semigroups with domain and range are a useful tool for modelling nondeterministic program...
Demonic composition, demonic refinement and demonic union are alternatives to the usual “angelic” co...
Demonic composition ∗ is an associative operation on binary relations, and demonic refinement ⊑ is a...
Relation algebra and its reducts provide us with a strong tool for reasoning about nondeterministic ...
The motivation for using demonic calculus for binary relations stems from the behaviour of demonic t...
AbstractThe family of domain algebras provide an elegant formal system for automated reasoning about...
We give complete, finite quasiequational axiomatisations for algebras of unary partial functions und...
A study of the classes of finite relations as enriched strict monoidal categories is presented in [C...
We give an algebraic model of (H3) designs of Hoare's and He's Unifying Theories of Programming. It ...
AbstractNew axioms for domain operations on semirings and Kleene algebras are proposed. They general...
AbstractWe propose a new and uniform abstract relational approach to demonic nondeterminism and robu...
Demonic composition is defined on the set of binary relations over the non-empty set X, , and is a v...
We propose Kleene algebra with domain (KAD), an extension of Kleene algebra by simple equational axi...
Domain operations on semirings have been axiomatised in two different ways: by a map from an additiv...
Add to ORKG