3690 search results - page 143 / 738 » Computation with classical sequents |
114
click to vote
SPIN
2001
Springer
15 years 2 months ago
2001
Springer
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
BIRTHDAY
2000
Springer
15 years 2 months ago
2000
Springer
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
AUSAI
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. Description logics are powerful knowledge representation systems providing well-founded and computationally tractable classification reasoning. However recognition of in...
SCALESPACE
1999
Springer
15 years 2 months ago
1999
Springer
The classical morphological segmentation paradigm is based on the watershed transform, constructed by flooding the gradient image seen as a topographic surface. For flooding a to...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...