AAAAAA

   
Results: 1-25 | 26-50 | 51-75 | 76-100 | >>
Results: 51-75/171

Authors: SANTOS E
Citation: E. Santos, ON MULTIPLE SPLINE APPROXIMATIONS FOR BAYESIAN COMPUTATIONS, Annals of mathematics and artificial intelligence, 20(1-4), 1997, pp. 267-300

Authors: WANG SN CAINES PE
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

Authors: HINKELMANN K HINTZE H
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

Authors: FRANCO J SWAMINATHAN RP
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

Authors: PURDOM PW
Citation: Pw. Purdom, BACKTRACKING AND RANDOM CONSTRAINT SATISFACTION, Annals of mathematics and artificial intelligence, 20(1-4), 1997, pp. 393-410

Authors: CALMET J CAMPBELL JA
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

Authors: PFALZGRAF J
Citation: J. Pfalzgraf, ON GEOMETRIC AND TOPOLOGICAL REASONING IN ROBOTICS, Annals of mathematics and artificial intelligence, 19(3-4), 1997, pp. 279-318

Authors: HONG H
Citation: H. Hong, HEURISTIC-SEARCH AND PRUNING IN POLYNOMIAL CONSTRAINTS SATISFACTION, Annals of mathematics and artificial intelligence, 19(3-4), 1997, pp. 319-334

Authors: SELLEN J
Citation: J. Sellen, ON THE TOPOLOGICAL-STRUCTURE OF CONFIGURATION-SPACES, Annals of mathematics and artificial intelligence, 19(3-4), 1997, pp. 335-354

Authors: STRUSS P
Citation: P. Struss, MODEL-BASED AND QUALITATIVE REASONING - AN INTRODUCTION, Annals of mathematics and artificial intelligence, 19(3-4), 1997, pp. 355-381

Authors: LADKIN PB REINEFELD A
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

Authors: PEDRESCHI D SUBRAHMANIAN VS
Citation: D. Pedreschi et Vs. Subrahmanian, NONDETERMINISM IN DATABASES - PREFACE, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 1-2

Authors: AQUILINO D ASIRELLI P RENSO C TURINI F
Citation: D. Aquilino et al., APPLYING RESTRICTION CONSTRAINTS TO DEDUCTIVE DATABASES, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 3-25

Authors: BROGI A SUBRAHMANIAN VS ZANIOLO C
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

Authors: EITER T LEONE N SACCA D
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

Authors: GIANNOTTI F GRECO S SACCA D ZANIOLO C
Citation: F. Giannotti et al., PROGRAMMING WITH NONDETERMINISM IN DEDUCTIVE DATABASES, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 97-125

Authors: DONG GZ SU JW
Citation: Gz. Dong et Jw. Su, DETERMINISTIC FOIES ARE STRICTLY WEAKER, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 127-146

Authors: GRECO S SACCA D
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

Authors: GRUMBACH S LACROIX Z
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

Authors: VIANU V
Citation: V. Vianu, RULE-BASED LANGUAGES, Annals of mathematics and artificial intelligence, 19(1-2), 1997, pp. 215-259

Authors: BURCKERT HJ HOLLUNDER B LAUX A
Citation: Hj. Burckert et al., ON SKOLEMIZATION IN CONSTRAINED LOGICS, Annals of mathematics and artificial intelligence, 18(2-4), 1996, pp. 95-131

Authors: HOLLUNDER B
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

Authors: STARK RF
Citation: Rf. Stark, MULTIVALUED AUTOEPISTEMIC LOGIC, Annals of mathematics and artificial intelligence, 18(2-4), 1996, pp. 159-174

Authors: BAADER F
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

Authors: KERBER M PRACKLEIN Z
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
Risultati: 1-25 | 26-50 | 51-75 | 76-100 | >>