1916 search results - page 59 / 384 » Reasoning with class algebra |
SAC
2009
ACM
14 years 4 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
LACL
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Some new algebras, which are possible denotations for various determiners, are studied. One of them is the algebra of generalised cardinal quantifiers which is a sub-alg...
WFLP
2000
Springer
14 years 1 months ago
2000
Springer
We introduce a framework for assessing the effectiveness of partial evaluators in functional logic languages. Our framework is based on properties of the rewrite system that models...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Computing the minimal network (or minimal CSP) representation of a given set of constraints over the Point Algebra (PA) is a fundamental reasoning problem. In this paper ...
CL
2007
Springer
13 years 10 months ago
2007
Springer
The CCS (Calculus of Communicating Systems) process algebra is a well-known formal model of synchronization and communication. It is used for the analysis of safety and liveness i...