4573 search results - page 630 / 915 » Automated Reasoning |
110
click to vote
CSL
2004
Springer
15 years 9 months ago
2004
Springer
The aim of this work is to give an alternative presentation for the multiplicative fragment of Yetter’s cyclic linear logic. The new presentation is inspired by the calculus of s...
114
Voted
CSL
2004
Springer
15 years 9 months ago
2004
Springer
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
118
click to vote
CSL
2004
Springer
15 years 9 months ago
2004
Springer
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
124
click to vote
DEON
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we investigate the specification and verification of information systems with an organizational structure. Such systems are modelled as a normative multia...
122
click to vote
EWCBR
2004
Springer
15 years 9 months ago
2004
Springer
The definition of similarity measures—one core component of every CBR application—leads to a serious knowledge acquisition problem if domain and application specific requirem...