3255 search results - page 423 / 651 » Combination of Abstractions in the ASTR |
205
click to vote
ECSQARU
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Given several Dempster-Shafer belief functions, the framework of valuation networks describes an efficient method for computing the marginal of the combined belief functi...
158
click to vote
HYBRID
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. Hybrid cc is a constraint programming language suitable for modeling, controlling and simulating hybrid systems, i.e. systems with continuous and discrete state changes. ...
136
click to vote
KBSE
1997
IEEE
15 years 11 months ago
1997
IEEE
Abstract: This paper describes some tools to support formal methods, and conversely some formal methods for developing such tools. We focus on distributed cooperative proving over ...
168
click to vote
LOPSTR
1994
Springer
15 years 10 months ago
1994
Springer
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
140
Voted
CTCS
1989
Springer
15 years 10 months ago
1989
Springer
We combine the principles of the Floyd-Warshall-Kleene algorithm, enriched categories, and Birkhoff arithmetic, to yield a useful class of algebras of transitive vertex-labeled s...