Sciweavers

532 search results - page 37 / 107
» The Logic of Quasi-MV Algebras
Sort
View
ENTCS
2006
142views more  ENTCS 2006»
13 years 10 months ago
The Rewriting Logic Semantics Project
Rewriting logic is a flexible and expressive logical framework that unifies algebraic denotational semantics and structural operational semantics (SOS) in a novel way, avoiding th...
José Meseguer, Grigore Rosu
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
14 years 3 months ago
Search Experiment of Business-Rule by Dynamic Constraint Algebra
Abstract Although e-commerce is becoming popular, product rules, which describe various conditions such as prices, applicability, and discount conditions are still expressed in nat...
Rui Kimura, Takayuki Shiga, Mizuho Iwaihara
CADE
2007
Springer
14 years 10 months ago
Automated Reasoning in Kleene Algebra
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
Georg Struth, Peter Höfner
LICS
1992
IEEE
14 years 1 months ago
Asynchronous Communication in Process Algebra
d Abstract) Frank S. de Boer, Jan Willem Klopyz , Catuscia Palamidessiyx We study the paradigm of asynchronous process communication, as contrasted with the synchronous communicat...
Frank S. de Boer, Jan Willem Klop, Catuscia Palami...
JAPLL
2007
78views more  JAPLL 2007»
13 years 9 months ago
Execution architectures for program algebra
We investigate the notion of an execution architecture in the setting of the program algebra PGA, and distinguish two sorts of these: analytic architectures, designed for the purp...
Jan A. Bergstra, Alban Ponse