265 search results - page 5 / 53 » Weakly Algebraizable Logics |
149
Voted
CONCUR
2003
Springer
15 years 11 months ago
2003
Springer
d Abstract) Christel Baier1 , Holger Hermanns2,3 , Joost-Pieter Katoen2 , and Verena Wolf1 1 Institut f¨ur Informatik I, University of Bonn R¨omerstraße 164, D-53117 Bonn, Germa...
167
click to vote
CADE
2004
Springer
15 years 11 months ago
2004
Springer
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
127
click to vote
CADE
2006
Springer
16 years 6 months ago
2006
Springer
It is well-known that the connection refinement of clause tableaux with paramodulation is incomplete (even with weak connections). In this paper, we present a new connection tablea...
174
click to vote
CALCO
2005
Springer
15 years 11 months ago
2005
Springer
Every endofunctor B on the category Set can be lifted to a fibred functor on the category (fibred over Set) of equivalence relations and relation-preserving functions. In this pa...
132
click to vote
CONCUR
2005
Springer
15 years 11 months ago
2005
Springer
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...