3658 search results - page 319 / 732 » The logic of proofs, semantically |
165
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Middleware technologies, often limit the way in which object classes may be used in distributed applications due to the fixed distribution policies imposed by the Middleware system...
208
Voted
AISC
2010
Springer
15 years 10 months ago
2010
Springer
We prove formally that the first order theory of algebraically closed fields enjoy quantifier elimination, and hence is decidable. This proof is organized in two modular parts. We ...
192
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
183
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
168
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...