 |
|
|
|
 |  |  Generic Inference: A Unifying Theory for Automated Reasoning
Abstract mathematical structures usually have a large number of models. Algorithms
based on operations and laws of such structures therefore have an identical form:
they are generic. This means that for each particular instance of the structure, only
the basic operations have to be adapted, whereas the overall algorithm remains the... |  |  |
|
|
Result Page: 168 167 166 165 164 163 162 161 160 159 |