1237 search results - page 132 / 248 » Abstract shade trees |
112
click to vote
RR
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed searc...
120
click to vote
CL
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
134
click to vote
CAV
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. In this paper we extend one of the main tools used in veri cation of discrete systems, namely Binary Decision Diagrams (BDD), to treat probabilistic transition systems. W...
145
click to vote
ECSQARU
1999
Springer
15 years 7 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...
157
click to vote
TOOLS
1998
IEEE
15 years 7 months ago
1998
IEEE
There are a number of programmable macro systems such as Lisp's. While they can handle complex program transformation, they still have difficulty in handling some kinds of tr...