| TI: A directly cautious theory of defeasible consequence for default logic via the notion of general extension
AU: Antonelli, G.A. | Pág. 71-109 |
| TI: Computational complexity of relating time points with intervals
AU: Jonsson, P.; Drakengren, T.; Backstrom, C. | Pág. 273-295 |
| TI: Constraint satisfaction over connected row-convex constraints
AU: Deville, Y.; Barette, O.; Van Hentenryck, P. | Pág. 243-271 |
| TI: iCTRL: Intensional conformal text representation language
AU: Redey, G. | Pág. 33-70 |
| TI: Index
AU: | Pág. 361 |
| TI: Learning by discovering concept hierarchies
AU: Zupan, B.; Bohanec, M.; Demsar, J.; Bratko, I. | Pág. 211-242 |
| TI: Modal logics, description logics and arithmetic reasoning
AU: Ohlbach, H.J.; Koehler, J. | Pág. 1-31 |
| TI: Non-uniform time sharing in the concurrent execution of constraint solving
AU: Krajcoviech, R.; Kotocova, M. | Pág. 161-185 |
| TI: Preferred answer sets for extended logic programs
AU: Brewka, G.; Eiter, T. | Pág. 297-356 |
| TI: Representation of propositional expert systems as partial functions
AU: Colomb, R.M. | Pág. 187-209 |
| TI: Using regression-match graphs to control search in planning
AU: McDermott, D. | Pág. 111-159 |