Citation: E. Santos, ON MULTIPLE SPLINE APPROXIMATIONS FOR BAYESIAN COMPUTATIONS, Annals of mathematics and artificial intelligence, 20(1-4), 1997, pp. 267-300
Citation: Sn. Wang et Pe. Caines, AUTOMATED REASONING WITH FUNCTION EVALUATION FOR COCOLOG, Annals of mathematics and artificial intelligence, 20(1-4), 1997, pp. 301-334
Citation: K. Hinkelmann et H. Hintze, STATE-SAVING TRANSFORMATIONS FOR EFFICIENT BOTTOM-UP EVALUATION OF LOGIC PROGRAMS AND RULE-BASED SYSTEMS, Annals of mathematics and artificial intelligence, 20(1-4), 1997, pp. 335-356
Citation: J. Franco et Rp. Swaminathan, AVERAGE-CASE RESULTS FOR SATISFIABILITY ALGORITHMS UNDER THE RANDOM-CLAUSE-WIDTH MODEL, Annals of mathematics and artificial intelligence, 20(1-4), 1997, pp. 357-391
Citation: J. Calmet et Ja. Campbell, A PERSPECTIVE ON SYMBOLIC MATHEMATICAL COMPUTING AND ARTIFICIAL-INTELLIGENCE, Annals of mathematics and artificial intelligence, 19(3-4), 1997, pp. 261-277
Citation: J. Pfalzgraf, ON GEOMETRIC AND TOPOLOGICAL REASONING IN ROBOTICS, Annals of mathematics and artificial intelligence, 19(3-4), 1997, pp. 279-318
Citation: H. Hong, HEURISTIC-SEARCH AND PRUNING IN POLYNOMIAL CONSTRAINTS SATISFACTION, Annals of mathematics and artificial intelligence, 19(3-4), 1997, pp. 319-334
Citation: J. Sellen, ON THE TOPOLOGICAL-STRUCTURE OF CONFIGURATION-SPACES, Annals of mathematics and artificial intelligence, 19(3-4), 1997, pp. 335-354
Citation: P. Struss, MODEL-BASED AND QUALITATIVE REASONING - AN INTRODUCTION, Annals of mathematics and artificial intelligence, 19(3-4), 1997, pp. 355-381
Citation: Pb. Ladkin et A. Reinefeld, FAST ALGEBRAIC METHODS FOR INTERVAL CONSTRAINT PROBLEMS, Annals of mathematics and artificial intelligence, 19(3-4), 1997, pp. 383-411
Citation: D. Pedreschi et Vs. Subrahmanian, NONDETERMINISM IN DATABASES - PREFACE, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 1-2
Citation: D. Aquilino et al., APPLYING RESTRICTION CONSTRAINTS TO DEDUCTIVE DATABASES, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 3-25
Citation: A. Brogi et al., THE LOGIC OF TOTALLY AND PARTIALLY ORDERED PLANS - A DEDUCTIVE DATABASE APPROACH, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 27-58
Citation: T. Eiter et al., ON THE PARTIAL SEMANTICS FOR DISJUNCTIVE DEDUCTIVE DATABASES, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 59-96
Citation: F. Giannotti et al., PROGRAMMING WITH NONDETERMINISM IN DEDUCTIVE DATABASES, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 97-125
Citation: S. Greco et D. Sacca, POSSIBLE IS CERTAIN IS DESIRABLE AND CAN BE EXPRESSIVE, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 147-168
Citation: S. Grumbach et Z. Lacroix, ON NONDETERMINISM IN MACHINES AND LANGUAGES, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 169-213
Citation: B. Hollunder, CONSISTENCY CHECKING REDUCED TO SATISFIABILITY OF CONCEPTS IN TERMINOLOGICAL SYSTEMS, Annals of mathematics and artificial intelligence, 18(2-4), 1996, pp. 133-157
Citation: F. Baader, USING AUTOMATA THEORY FOR CHARACTERIZING THE SEMANTICS OF TERMINOLOGICAL CYCLES, Annals of mathematics and artificial intelligence, 18(2-4), 1996, pp. 175-219
Citation: M. Kerber et Z. Pracklein, USING TACTICS TO REFORMULATE FORMULAS FOR RESOLUTION THEOREM-PROVING, Annals of mathematics and artificial intelligence, 18(2-4), 1996, pp. 221-241