Sciweavers

4370 search results - page 68 / 874
» Algebra of Logic Programming
Sort
View
106
Voted
ICTAC
2010
Springer
14 years 11 months ago
Invariants and Well-Foundedness in Program Algebra
Ian J. Hayes
93
Voted
FSS
2006
85views more  FSS 2006»
15 years 2 months ago
The logic of tied implications, part 2: Syntax
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...
Nehad N. Morsi, Wafik Boulos Lotfallah, Moataz Sal...