Digital Library
Close Browse articles from a journal
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             651 results found
no title author magazine year volume issue page(s) type
1 Abstracting soft constraints: Framework, properties, examples Bistarelli, Stefano
2002
199-200 2 p. 175-211
37 p.
article
2 A chronology of computer chess and its literature Berliner, Hans J.
1978
199-200 2 p. 201-214
14 p.
article
3 A circumscriptive calculus of events Shanahan, Murray
1995
199-200 2 p. 249-284
36 p.
article
4 A circumscriptive theorem prover Ginsberg, Matthew L.
1989
199-200 2 p. 209-230
22 p.
article
5 A comparative runtime analysis of heuristic algorithms for satisfiability problems Zhou, Yuren
2009
199-200 2 p. 240-257
18 p.
article
6 A comparative study of open default theories Kaminski, Michael
1995
199-200 2 p. 285-319
35 p.
article
7 A comparison and evaluation of three machine learning procedures as applied to the game of checkers Griffith, Arnold K.
1974
199-200 2 p. 137-148
12 p.
article
8 A comparison of structural CSP decomposition methods Gottlob, Georg
2000
199-200 2 p. 243-282
40 p.
article
9 A complete anytime algorithm for number partitioning Korf, Richard E.
1998
199-200 2 p. 181-203
23 p.
article
10 A complete classification of tractability in Allen's algebra relative to subsets of basic relations Drakengren, Thomas
1998
199-200 2 p. 205-219
15 p.
article
11 A computational approach to George Boole's discovery of mathematical logic de Ledesma, Luis
1997
199-200 2 p. 281-307
27 p.
article
12 A computational model for process-grammar Lin, Wei-Chung
1989
199-200 2 p. 207-224
18 p.
article
13 A computer model of child language learning Selfridge, Mallory
1986
199-200 2 p. 171-216
46 p.
article
14 A context sensitive line finder for recognition of polyhedra Shirai, Yoshiaki
1973
199-200 2 p. 95-119
25 p.
article
15 Acquiring search-control knowledge via static analysis Etzioni, Oren
1993
199-200 2 p. 255-301
47 p.
article
16 Active surface estimation: integrating coarse-to-fine image acquisition and estimation from multiple cues Das, Subhodev
1996
199-200 2 p. 241-266
26 p.
article
17 Adaptation-guided retrieval: questioning the similarity assumption in reasoning Smyth, Barry
1998
199-200 2 p. 249-293
45 p.
article
18 Adaptive regularization parameter selection method for enhancing generalization capability of neural networks Leung, Chi-Tat
1999
199-200 2 p. 347-356
10 p.
article
19 A dictionary based on concept coherence Alterman, Richard
1985
199-200 2 p. 153-186
34 p.
article
20 A differential semantics for jointree algorithms Park, James D.
2004
199-200 2 p. 197-216
20 p.
article
21 A framework for explaining decision-theoretic advice Klein, David A
1994
199-200 2 p. 201-243
43 p.
article
22 A game tree with distinct leaf values which is easy for the alpha-beta algorithm Althöfer, Ingo
1991
199-200 2 p. 183-190
8 p.
article
23 Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results Laborie, Philippe
2003
199-200 2 p. 151-188
38 p.
article
24 Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search Chakrabarti, P.P.
1994
199-200 2 p. 329-345
17 p.
article
25 Algorithms for the coalitional manipulation problem Zuckerman, Michael
2009
199-200 2 p. 392-412
21 p.
article
26 A logical framework for depiction and image interpretation Reiter, Raymond
1989
199-200 2 p. 125-155
31 p.
article
27 A logical theory of robot problem solving Štěpánková, Olga
1976
199-200 2 p. 129-161
33 p.
article
28 A logic-based model of intention formation and action for multi-agent subcontracting Grant, John
2005
199-200 2 p. 163-201
39 p.
article
29 A logic of time, chance, and action for representing plans Haddawy, Peter
1996
199-200 2 p. 243-308
66 p.
article
30 A mechanical solution of Schubert's Steamroller by many-sorted resolution Walther, Christoph
1985
199-200 2 p. 217-224
8 p.
article
31 A metatheory of a mechanized object theory Giunchiglia, Fausto
1996
199-200 2 p. 197-241
45 p.
article
32 A minimax algorithm better than alpha-beta? Stockman, G.C.
1979
199-200 2 p. 179-196
18 p.
article
33 A model of belief Paris, J.B.
1993
199-200 2 p. 197-241
45 p.
article
34 A multi-level perception approach to reading cursive script Srihari, Sargur N.
1987
199-200 2 p. 217-255
39 p.
article
35 An admissible and optimal algorithm for searching AND/OR graphs Chang, C.L.
1971
199-200 2 p. 117-128
12 p.
article
36 Analogical representations of naive physics Gardin, Francesco
1989
199-200 2 p. 139-159
21 p.
article
37 Analysis and empirical studies of derivational analogy Blumenthal, Brad
1994
199-200 2 p. 287-327
41 p.
article
38 An analytical comparison of some rule-learning programs Bundy, Alan
1985
199-200 2 p. 137-181
45 p.
article
39 An assumption-based TMS de Kleer, Johan
1986
199-200 2 p. 127-162
36 p.
article
40 An automatic proof of Gödel's incompleteness theorem Ammon, Kurt
1993
199-200 2 p. 291-306
16 p.
article
41 An efficient algorithm for optimal pruning of decision trees Almuallim, Hussein
1996
199-200 2 p. 347-362
16 p.
article
42 An empirical analysis of terminological representation systems Heinsohn, Jochen
1994
199-200 2 p. 367-397
31 p.
article
43 An epistemological science of common sense Giunchiglia, Fausto
1995
199-200 2 p. 371-392
22 p.
article
44 A new representation and associated algorithms for generalized planning Srivastava, Siddharth
2011
199-200 2 p. 615-647
33 p.
article
45 An experimental logic based on the fundamental deduction principle Brown, Frank M.
1986
199-200 2 p. 117-263
147 p.
article
46 An experiment in knowledge-based automatic programming Barstow, David R.
1979
199-200 2 p. 73-119
47 p.
article
47 An extension of pointwise circumscription Iwanuma, Koji
1996
199-200 2 p. 391-402
12 p.
article
48 An extension of QSIM with qualitative curvature Hossain, Abul
1997
199-200 2 p. 303-350
48 p.
article
49 An interactive system for finding complementary literatures: a stimulus to scientific discovery Swanson, Don R.
1997
199-200 2 p. 183-203
21 p.
article
50 Announcement 1995
199-200 2 p. 393-394
2 p.
article
51 Announcement 1995
199-200 2 p. 373-
1 p.
article
52 Announcement 1995
199-200 2 p. 395-
1 p.
article
53 Announcement 1994
199-200 2 p. 377-380
4 p.
article
54 Announcement 1993
199-200 2 p. 359-361
3 p.
article
55 Announcement 1994
199-200 2 p. 409-410
2 p.
article
56 Announcement 1989
199-200 2 p. 253-254
2 p.
article
57 Announcement 1989
199-200 2 p. 253-254
2 p.
article
58 Announcement 1977
199-200 2 p. 239-
1 p.
article
59 Announcement 1980
199-200 2 p. 204-
1 p.
article
60 Announcement 1990
199-200 2 p. 267-268
article
61 Announcements 1993
199-200 2 p. 357-359
3 p.
article
62 Announcements 1993
199-200 2 p. 383-386
4 p.
article
63 Announcements 1987
199-200 2 p. 267-268
2 p.
article
64 Announcements 1989
199-200 2 p. 279-280
2 p.
article
65 Announcements 1988
199-200 2 p. 269-272
4 p.
article
66 Announcements 1988
199-200 2 p. 271-275
5 p.
article
67 Announcements 1988
199-200 2 p. 277-283
7 p.
article
68 Announcements 1993
199-200 2 p. 355-358
4 p.
article
69 Announcements 1991
199-200 2 p. 285-
1 p.
article
70 A nonstandard approach to the logical omniscience problem Fagin, Ronald
1995
199-200 2 p. 203-240
38 p.
article
71 An optimal coarse-grained arc consistency algorithm Bessière, Christian
2005
199-200 2 p. 165-185
21 p.
article
72 An organization of knowledge for problem solving and language comprehension Rieger, Chuck
1976
199-200 2 p. 89-127
39 p.
article
73 A note on non-monotonic modal logic Stalnaker, Robert
1993
199-200 2 p. 183-196
14 p.
article
74 A note on the stable model semantics for logic programs Kaminski, Michael
1997
199-200 2 p. 467-479
13 p.
article
75 An overview of incentive contracting Kraus, Sarit
1996
199-200 2 p. 297-346
50 p.
article
76 A paradigm for reasoning by analogy Kling, Robert E.
1971
199-200 2 p. 147-178
32 p.
article
77 Approximations for efficient computation in the theory of evidence Tessem, Bj∅rnar
1993
199-200 2 p. 315-329
15 p.
article
78 A practical guide to designing expert systems Dym, Clive L.
1985
199-200 2 p. 238-239
2 p.
article
79 A practically efficient and almost linear unification algorithm Escalada-Imaz, Gonzalo
1988
199-200 2 p. 249-263
15 p.
article
80 A problem-decomposition method using differences or equivalence relations between states Niizuma, Seizaburo
1985
199-200 2 p. 117-151
35 p.
article
81 A procedure for adaptive control of the interaction between acoustic classification and linguistic decoding in automatic recognition of continuous speech Tappert, C.C.
1974
199-200 2 p. 95-113
19 p.
article
82 A process-grammar for shape Leyton, Michael
1988
199-200 2 p. 213-247
35 p.
article
83 A program that computes limits using heuristics to evaluate the indeterminate forms Laurent, Jean-Pierre
1973
199-200 2 p. 69-94
26 p.
article
84 A rational reconstruction of nonmonotonic truth maintenance systems Elkan, Charles
1990
199-200 2 p. 219-234
article
85 Arc and path consistency revisited Mohr, Roger
1986
199-200 2 p. 225-233
9 p.
article
86 Arc-consistency for continuous variables Faltings, Boi
1994
199-200 2 p. 363-376
14 p.
article
87 A refined architecture for terminological systems: Terminology = Schema + Views Buchheit, M.
1998
199-200 2 p. 209-260
52 p.
article
88 A resolution principle for constrained logics Bürckert, Hans-Jürgen
1994
199-200 2 p. 235-271
37 p.
article
89 Artificial intelligence Shapiro, Stuart C.
1976
199-200 2 p. 199-201
3 p.
article
90 As advertised: A review of The MIT Encyclopedia of the Cognitive Sciences ☆ ☆ MIT Press, Cambridge, MA, 1999. 1312 pages. Price US$ 149.95 (Cloth). ISBN 0-262-23200-6. CD-ROM. Price US$ 149.95. ISBN 0-262-73124-X. Lakoff, George
2001
199-200 2 p. 195-209
15 p.
article
91 A SIMD approach to parallel heuristic search Mahanti, Ambuj
1993
199-200 2 p. 243-282
40 p.
article
92 A simplified problem reduction format Plaisted, David A.
1982
199-200 2 p. 227-261
35 p.
article
93 Association for automated reasoning 1983
199-200 2 p. 212-214
3 p.
article
94 Association for computational linguistics European chapter second conference 1985
199-200 2 p. 242-243
2 p.
article
95 Asymptotic properties of minimax trees and game-searching procedures Pearl, Judea
1980
199-200 2 p. 113-138
26 p.
article
96 A theory and methodology of inductive learning Michalski, Ryszard S.
1983
199-200 2 p. 111-161
51 p.
article
97 A theory of measurement in diagnosis from first principles Hou, Aimin
1994
199-200 2 p. 281-328
48 p.
article
98 A typed resolution principle for deduction with conditional typing theory Wang, Tie-Cheng
1995
199-200 2 p. 161-194
34 p.
article
99 Author Index—Volume 130 (2001) 2001
199-200 2 p. 237-238
2 p.
article
100 Author Index—Volume 132 (2001) 2001
199-200 2 p. 239-
1 p.
article
101 Author Index—Volume 127 (2001) 2001
199-200 2 p. 277-
1 p.
article
102 Author Index—Volume 143 (2003) 2003
199-200 2 p. 267-
1 p.
article
103 Author Index—Volume 146 (2003) 2003
199-200 2 p. 235-
1 p.
article
104 Author Index—Volume 149 (2003) 2003
199-200 2 p. 271-
1 p.
article
105 Author Index—Volume 136 (2002) 2002
199-200 2 p. 255-
1 p.
article
106 Author index—Volume 75 (1995) 1995
199-200 2 p. 381-382
2 p.
article
107 Author index—Volume 86 (1996) 1996
199-200 2 p. 407-408
2 p.
article
108 Author index—Volume 83 (1996) 1996
199-200 2 p. 383-384
2 p.
article
109 Author index—Volume 80 (1996) 1996
199-200 2 p. 367-368
2 p.
article
110 Author Index—Volume 139 (2002) 2002
199-200 2 p. 273-
1 p.
article
111 Author Index—Volume 142 (2002) 2002
199-200 2 p. 289-290
2 p.
article
112 Author index—Volume 95 (1997) 1997
199-200 2 p. 443-444
2 p.
article
113 Author index—Volume 96 (1997) 1997
199-200 2 p. 487-
1 p.
article
114 Author index—Volume 91 (1997) 1997
199-200 2 p. 313-314
2 p.
article
115 Author index—Volume 106 (1998) 1998
199-200 2 p. 363-364
2 p.
article
116 Author index—volume 102 (1998) 1998
199-200 2 p. 345-346
2 p.
article
117 Author index—volume 107 (1999) 1999
199-200 2 p. 361-
1 p.
article
118 Author index—Volume 79 (1995) 1995
199-200 2 p. 401-402
2 p.
article
119 Author index—Volume 74 (1994) 1995
199-200 2 p. 401-402
2 p.
article
120 Author index—Volume 77 (1995) 1995
199-200 2 p. 401-402
2 p.
article
121 Author index—Volume 60 (1993) 1993
199-200 2 p. 363-364
2 p.
article
122 Author index—Volume 61 (1993) 1993
199-200 2 p. 367-368
2 p.
article
123 Author index-Volume 71 (1994) 1994
199-200 2 p. 417-418
2 p.
article
124 Author index—Volume 68 (1994) 1994
199-200 2 p. 417-
1 p.
article
125 Author index—Volume 62 (1993) 1993
199-200 2 p. 391-392
2 p.
article
126 Author index—Volume 64 (1993) 1993
199-200 2 p. 363-364
2 p.
article
127 Author Index—Volume 165 (2005) 2005
199-200 2 p. 267-268
2 p.
article
128 Author Index—Volume 163 (2005) 2005
199-200 2 p. 269-
1 p.
article
129 Author Index—Volume 169 (2005) 2005
199-200 2 p. 211-212
2 p.
article
130 Author Index—Volume 152 (2004) 2004
199-200 2 p. 279-
1 p.
article
131 Author Index—Volume 158 (2004) 2004
199-200 2 p. 219-
1 p.
article
132 Author Index—Volume 156 (2004) 2004
199-200 2 p. 221-
1 p.
article
133 Author index—Volume 67 (1994)ce systems 1994
199-200 2 p. 413-
1 p.
article
134 Author index—Volume 99 (1998) functions 1998
199-200 2 p. 361-
1 p.
article
135 Author index—Volume 65 (1994)on 1994
199-200 2 p. 383-384
2 p.
article
136 Author index—Volume 66 (1994)op on Case-Based 1994
199-200 2 p. 413-414
2 p.
article
137 Autocircumscription Perlis, Donald
1988
199-200 2 p. 223-236
14 p.
article
138 Automated model selection for simulation based on relevance reasoning Levy, Alon Y.
1997
199-200 2 p. 351-394
44 p.
article
139 Automatically generating abstractions for planning Knoblock, Craig A
1994
199-200 2 p. 243-302
60 p.
article
140 Automatic interpretation of loosely encoded input Fan, James
2009
199-200 2 p. 197-220
24 p.
article
141 Automatic knowledge base refinement for classification systems Ginsberg, Allen
1988
199-200 2 p. 197-226
30 p.
article
142 A versatile system for computer-controlled assembly Ambler, A.P.
1975
199-200 2 p. 129-156
28 p.
article
143 Awards: IJCAI-85 1985
199-200 2 p. 241-242
2 p.
article
144 Awards: IJCAI-87 1986
199-200 2 p. 237-238
2 p.
article
145 Awards: IJCAI-87 International joint conference on artificial intelligence 1986
199-200 2 p. 268-269
2 p.
article
146 Backgammon computer program beats world champion Berliner, Hans J.
1980
199-200 2 p. 205-220
16 p.
article
147 Backjump-based backtracking for constraint satisfaction problems Dechter, Rina
2002
199-200 2 p. 147-188
42 p.
article
148 Bargaining with limited computation: Deliberation equilibrium Larson, Kate
2001
199-200 2 p. 183-217
35 p.
article
149 Basic theoretical results for expert systems. Application to the supervision of adaptation transients in planar robots De la Sen, M.
2004
199-200 2 p. 173-211
39 p.
article
150 Bayesian and non-bayesian evidential updating 1988
199-200 2 p. 265-266
2 p.
article
151 Bayesian network modelling through qualitative patterns Lucas, Peter J.F.
2005
199-200 2 p. 233-263
31 p.
article
152 Behaviorist intelligence and the scaling problem Tsotsos, John K.
1995
199-200 2 p. 135-160
26 p.
article
153 Belief as defeasible knowledge Moses, Yoram
1993
199-200 2 p. 299-321
23 p.
article
154 Believing others: Pros and cons Sen, Sandip
2002
199-200 2 p. 179-203
25 p.
article
155 Benefits of using multivalued functions for minimaxing Scheucher, Anton
1998
199-200 2 p. 187-208
22 p.
article
156 BIDA∗: an improved perimeter search algorithm Manzini, Giovanni
1995
199-200 2 p. 347-360
14 p.
article
157 B. Jähne, H. Haussecker, and P. Geissler, eds., Handbook of Computer Vision and Applications. 1. Sensors and Imaging. 2. Signal Processing and Pattern Recognition. 3. Systems and Applications Rosenfeld, Azriel
2000
199-200 2 p. 271-273
3 p.
article
158 Books received 1989
199-200 2 p. 273-274
2 p.
article
159 Books received 1986
199-200 2 p. 265-266
2 p.
article
160 Books received 1985
199-200 2 p. 227-230
4 p.
article
161 Books received 1988
199-200 2 p. 267-269
3 p.
article
162 Books received 1986
199-200 2 p. 223-224
2 p.
article
163 Books received 1987
199-200 2 p. 257-258
2 p.
article
164 Books received 1991
199-200 2 p. 241-244
4 p.
article
165 Books received 1988
199-200 2 p. 249-250
2 p.
article
166 Books received 1993
199-200 2 p. 379-381
3 p.
article
167 Bounded approximate decentralised coordination via the max-sum algorithm Rogers, A.
2011
199-200 2 p. 730-759
30 p.
article
168 Building agent teams using an explicit teamwork model and learning Tambe, Milind
1999
199-200 2 p. 215-239
25 p.
article
169 Call for papers: AAAI-83 1983
199-200 2 p. 211-212
2 p.
article
170 Call for papers: Annual meeting of the society for philosophy and psychology 1985
199-200 2 p. 249-
1 p.
article
171 Call for papers: Compeuro 87 international conference on VLSI in computing systems 1985
199-200 2 p. 250-
1 p.
article
172 Call for papers: First international logic programming conference 1982
199-200 2 p. 265-266
2 p.
article
173 Call for papers: GWAI-82 sixth german workshop on artificial intelligence 1982
199-200 2 p. 267-
1 p.
article
174 Call for papers: ICCV-87 First international conference on computer vision 1986
199-200 2 p. 267-268
2 p.
article
175 Call for papers: Second international workshop on natural language understanding and logic programming 1987
199-200 2 p. 264-265
2 p.
article
176 Call for papers: XIth international conference on computational linguistics 1985
199-200 2 p. 251-
1 p.
article
177 Canadian artificial intelligence conference: AI86 1986
199-200 2 p. 241-242
2 p.
article
178 Change of Editor for Research Notes Section 1999
199-200 2 p. 143-
1 p.
article
179 Characterising tractable constraints Cooper, Martin C.
1994
199-200 2 p. 347-361
15 p.
article
180 Circumscribing with sets Perlis, Donald
1987
199-200 2 p. 201-211
11 p.
article
181 Circumscription Jaeger, Manfred
1993
199-200 2 p. 293-301
9 p.
article
182 Closed-world databases and circumscription Lifschitz, Vladimir
1985
199-200 2 p. 229-235
7 p.
article
183 Cognitive Science: Real or Imaginary?: Review of The MIT Encyclopedia of The Cognitive Sciences edited by Robert A. Wilson and Frank C. Keil ☆ ☆ MIT Press, Cambridge, MA, 1999. 1312 pages. Price US$ 149.95 (Cloth). ISBN 0-262-23200-6. CD-ROM. Price US$ 149.95. ISBN 0-262- 73124-X. Husbands, Phil
2001
199-200 2 p. 191-194
4 p.
article
184 Collaborative plans for complex group action Grosz, Barbara J.
1996
199-200 2 p. 269-357
89 p.
article
185 Combining interval-based temporal reasoning with general TBoxes Lutz, Carsten
2004
199-200 2 p. 235-274
40 p.
article
186 Comparative envisionment construction: A technique for the comparative analysis of dynamical systems de Jong, Hidde
1999
199-200 2 p. 145-214
70 p.
article
187 Compiling constraint satisfaction problems Weigel, Rainer
1999
199-200 2 p. 257-287
31 p.
article
188 Complexity results for standard benchmark domains in planning Helmert, Malte
2003
199-200 2 p. 219-262
44 p.
article
189 Composing cardinal direction relations Skiadopoulos, Spiros
2004
199-200 2 p. 143-171
29 p.
article
190 Computation and cognition: Toward a foundation of cognitive science Stefik, Mark
1989
199-200 2 p. 241-247
7 p.
article
191 Computation and cognition: Toward a fundation for cognitive science Mackworth, Alan K.
1989
199-200 2 p. 239-240
2 p.
article
192 Computer chess move-ordering schemes using move influence Greer, Kieran
2000
199-200 2 p. 235-250
16 p.
article
193 Computers and musical style, the computer music and digital audio series, volume 6 Berger, Jonathan
1995
199-200 2 p. 343-348
6 p.
article
194 Computer systems that learn Segre, Alberto
1993
199-200 2 p. 363-378
16 p.
article
195 Computing a representation of the local environment Yeap, Wai K.
1999
199-200 2 p. 265-301
37 p.
article
196 Computing leximin-optimal solutions in constraint networks Bouveret, Sylvain
2009
199-200 2 p. 343-364
22 p.
article
197 Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure Gerevini, Alfonso E.
2011
199-200 2 p. 556-585
30 p.
article
198 Concept teaching Self, John A.
1977
199-200 2 p. 197-221
25 p.
article
199 Conceptual inductive learning Kubat, Miroslav
1991
199-200 2 p. 169-182
14 p.
article
200 Conceptual structures: Information processing in mind and machine Smoliar, Stephen W.
1987
199-200 2 p. 259-266
8 p.
article
201 Conference on the philosophy of Donald Davidson 1984
199-200 2 p. 227-
1 p.
article
202 Conjecturing hidden entities by means of simplicity and conservation laws Valdés-Pérez, Raúl E.
1994
199-200 2 p. 247-280
34 p.
article
203 Connections and symbols Derthick, Mark
1990
199-200 2 p. 251-265
article
204 Consciousness explained O'Rourke, Joseph
1993
199-200 2 p. 303-312
10 p.
article
205 Consistency-based diagnosis of configuration knowledge bases Felfernig, Alexander
2004
199-200 2 p. 213-234
22 p.
article
206 Constraint relaxation may be perfect Montanari, Ugo
1991
199-200 2 p. 143-170
28 p.
article
207 Controlling backward inference Smith, David E.
1989
199-200 2 p. 145-208
64 p.
article
208 Controlling cooperative problem solving in industrial multi-agent systems using joint intentions Jennings, N.R.
1995
199-200 2 p. 195-240
46 p.
article
209 Conversational language comprehension using integrated pattern-matching and parsing Parkinson, Roger C.
1977
199-200 2 p. 111-134
24 p.
article
210 Cooperation without deliberation: A minimal behavior-based approach to multi-robot teams Werger, Barry Brian
1999
199-200 2 p. 293-320
28 p.
article
211 Cooperative behavior acquisition for mobile robots in dynamically changing real worlds via vision-based reinforcement learning and development Asada, Minoru
1999
199-200 2 p. 275-292
18 p.
article
212 Cooperative responses from a portable natural language query system Kaplan, S.Jerrold
1982
199-200 2 p. 165-187
23 p.
article
213 Cortical hierarchies, sleep, and the extraction of knowledge from memory McNaughton, Bruce L.
2010
199-200 2 p. 205-214
10 p.
article
214 Cost-based abduction and MAP explanation Charniak, Eugene
1994
199-200 2 p. 345-374
30 p.
article
215 Credal networks Cozman, Fabio G.
2000
199-200 2 p. 199-233
35 p.
article
216 Cumulative default logic Brewka, Gerhard
1991
199-200 2 p. 183-205
23 p.
article
217 Decision making on the sole basis of statistical likelihood Giang, Phan H.
2005
199-200 2 p. 137-163
27 p.
article
218 Default reasoning and possibility theory Dubois, Didier
1988
199-200 2 p. 243-257
15 p.
article
219 Default reasoning from conditional knowledge bases: Complexity and tractable cases Eiter, Thomas
2000
199-200 2 p. 169-241
73 p.
article
220 Defection-free exchange mechanisms based on an entry fee imposition Matsubara, Shigeo
2002
199-200 2 p. 265-286
22 p.
article
221 Defining operationality for explanation-based learning Keller, Richard M.
1988
199-200 2 p. 227-241
15 p.
article
222 Deliberation scheduling for problem solving in time-constrained environments Boddy, Mark
1994
199-200 2 p. 245-285
41 p.
article
223 DENDRAL: A case study of the first expert system for scientific hypothesis formation Lindsay, Robert K.
1993
199-200 2 p. 209-261
53 p.
article
224 Depth-first heuristic search on a SIMD machine Powley, Curt
1993
199-200 2 p. 199-242
44 p.
article
225 Detection of surface orientation and motion from texture by a stereological technique Kanatani, Ken-ichi
1984
199-200 2 p. 213-237
25 p.
article
226 Dialectic proof procedures for assumption-based, admissible argumentation Dung, P.M.
2006
199-200 2 p. 114-159
46 p.
article
227 Discovering patterns in sequences of events Dietterich, Thomas G.
1985
199-200 2 p. 187-232
46 p.
article
228 Discovering simple rules in complex data: A meta-learning algorithm and some surprising musical discoveries Widmer, Gerhard
2003
199-200 2 p. 129-148
20 p.
article
229 Distributed revision of composite beliefs Pearl, Judea
1987
199-200 2 p. 173-215
43 p.
article
230 Doing arithmetic without diagrams Malloy Brown, F.
1977
199-200 2 p. 175-200
26 p.
article
231 Dynamic backward reasoning systems Ligęza, Antoni
1990
199-200 2 p. 127-152
article
232 Dynamic belief revision operators Nayak, Abhaya C.
2003
199-200 2 p. 193-228
36 p.
article
233 Edge detection using Walsh functions O'Gorman, Frank
1978
199-200 2 p. 215-223
9 p.
article
234 Editorial Durfee, Ed
2002
199-200 2 p. 95-97
3 p.
article
235 Editorial Board 2009
199-200 2 p. IFC-
1 p.
article
236 Editorial Board 2003
199-200 2 p. IFC-
1 p.
article
237 Editorial Board 2003
199-200 2 p. IFC-
1 p.
article
238 Editorial Board 2003
199-200 2 p. IFC-
1 p.
article
239 Editorial Board 2002
199-200 2 p. IFC-
1 p.
article
240 Editorial Board 2010
199-200 2 p. IFC-
1 p.
article
241 Editorial Board 2011
199-200 2 p. IFC-
1 p.
article
242 Editorial Board 2006
199-200 2 p. CO2-
1 p.
article
243 Editorial Board 2005
199-200 2 p. CO2-
1 p.
article
244 Editorial Board 2005
199-200 2 p. CO2-
1 p.
article
245 Editorial Board 2005
199-200 2 p. CO2-
1 p.
article
246 Editorial Board 2004
199-200 2 p. IFC-
1 p.
article
247 Editorial Board 2004
199-200 2 p. IFC-
1 p.
article
248 Editorial Board 2004
199-200 2 p. IFC-
1 p.
article
249 Editorial introduction Bobrow, Daniel G.
1993
199-200 2 p. 197-
1 p.
article
250 Editor's note Bobrow, Daniel G.
1982
199-200 2 p. 133-
1 p.
article
251 Efficient algorithms for qualitative reasoning about time Gerevini, Alfonso
1995
199-200 2 p. 207-248
42 p.
article
252 Efficient compositional modeling for generating causal explanations Nayak, P.Pandurang
1996
199-200 2 p. 193-227
35 p.
article
253 Efficient retrieval from sparse associative memory Greene, Ronald L.
1994
199-200 2 p. 395-410
16 p.
article
254 Embracing causality in default reasoning Pearl, Judea
1988
199-200 2 p. 259-271
13 p.
article
255 Epistemic entrenchment and possibilistic logic Dubois, Didier
1991
199-200 2 p. 223-239
17 p.
article
256 Epistemology and cognition Smoliar, Stephen W.
1988
199-200 2 p. 251-264
14 p.
article
257 Erratum 1985
199-200 2 p. 248-
1 p.
article
258 Erratum 1982
199-200 2 p. 263-
1 p.
article
259 Evaluating new options in the context of existing plans Horty, John F.
2001
199-200 2 p. 199-220
22 p.
article
260 Evidential reasoning using stochastic simulation of causal models Pearl, Judea
1987
199-200 2 p. 245-257
13 p.
article
261 Expanding the book reviews Stefik, Mark J.
1985
199-200 2 p. 225-
1 p.
article
262 Experimental evaluation of preprocessing algorithms for constraint satisfaction problems Dechter, Rina
1994
199-200 2 p. 211-241
31 p.
article
263 Expert critiquing systems: Practice-based medical consultation by computer Wellman, Michael P.
1988
199-200 2 p. 273-276
4 p.
article
264 Expert database systems: Proceedings from the second international conference McLeod, Dennis
1991
199-200 2 p. 245-252
8 p.
article
265 Expressiveness of concept expressions in first-order description logics Kurtonina, Natasha
1999
199-200 2 p. 303-333
31 p.
article
266 Extended causal theories Bell, John
1991
199-200 2 p. 211-224
14 p.
article
267 Extended person-machine interface Reichman-Adar, Rachel
1984
199-200 2 p. 157-218
62 p.
article
268 Extending abstract argumentation systems theory Baroni, P.
2000
199-200 2 p. 251-270
20 p.
article
269 Extending the ATMS de Kleer, Johan
1986
199-200 2 p. 163-196
34 p.
article
270 Extending the expressive power of semantic networks Schubert, L.K.
1976
199-200 2 p. 163-198
36 p.
article
271 Filtering algorithms for the multiset ordering constraint Frisch, Alan M.
2009
199-200 2 p. 299-328
30 p.
article
272 Finding MAPs for belief networks is NP-hard Shimony, Solomon Eyal
1994
199-200 2 p. 399-410
12 p.
article
273 Fixed points in the propositional nonmonotonic logic Shvarts, Grigory F.
1989
199-200 2 p. 199-206
8 p.
article
274 Floating conclusions and zombie paths: Two deep difficulties in the “directly skeptical” approach to defeasible inheritance nets Makinson, David
1991
199-200 2 p. 199-209
11 p.
article
275 Formalizing common sense: Papers by John McCarthy Akman, Varol
1995
199-200 2 p. 359-369
11 p.
article
276 Formal methods in the design of question-answering systems Sandewall, Erik
1971
199-200 2 p. 129-145
17 p.
article
277 Formal semantics for mutual belief Colombetti, Marco
1993
199-200 2 p. 341-353
13 p.
article
278 Forthcoming Papers 2001
199-200 2 p. 233-236
4 p.
article
279 Forthcoming Papers 2001
199-200 2 p. 235-238
4 p.
article
280 Forthcoming Papers 2003
199-200 2 p. 263-266
4 p.
article
281 Forthcoming Papers 2003
199-200 2 p. 229-233
5 p.
article
282 Forthcoming Papers 2003
199-200 2 p. 267-270
4 p.
article
283 Forthcoming Papers 2001
199-200 2 p. 273-275
3 p.
article
284 Forthcoming Papers 2002
199-200 2 p. 287-
1 p.
article
285 Forthcoming papers 1996
199-200 2 p. 361-366
6 p.
article
286 Forthcoming papers 1996
199-200 2 p. 379-382
4 p.
article
287 Forthcoming papers 1996
199-200 2 p. 403-406
4 p.
article
288 Forthcoming Papers 2002
199-200 2 p. 269-272
4 p.
article
289 Forthcoming Papers 2002
199-200 2 p. 251-254
4 p.
article
290 Forthcoming papers 1997
199-200 2 p. 441-442
2 p.
article
291 Forthcoming papers 1997
199-200 2 p. 309-311
3 p.
article
292 Forthcoming papers 1998
199-200 2 p. 339-344
6 p.
article
293 Forthcoming papers 1998
199-200 2 p. 357-359
3 p.
article
294 Forthcoming papers 1998
199-200 2 p. 359-361
3 p.
article
295 Forthcoming papers 1997
199-200 2 p. 481-485
5 p.
article
296 Forthcoming Papers 1995
199-200 2 p. 395-400
6 p.
article
297 Forthcoming papers 1995
199-200 2 p. 399-400
2 p.
article
298 Forthcoming papers 1995
199-200 2 p. 375-379
5 p.
article
299 Forthcoming papers 1995
199-200 2 p. 397-399
3 p.
article
300 Forthcoming papers 1991
199-200 2 p. 257-259
3 p.
article
301 Forthcoming papers 1993
199-200 2 p. 363-365
3 p.
article
302 Forthcoming papers 1994
199-200 2 p. 413-415
3 p.
article
303 Forthcoming papers 1991
199-200 2 p. 287-288
2 p.
article
304 Forthcoming papers 1994
199-200 2 p. 411-412
2 p.
article
305 Forthcoming papers 1987
199-200 2 p. 269-270
2 p.
article
306 Forthcoming papers 1987
199-200 2 p. 279-280
2 p.
article
307 Forthcoming papers 1989
199-200 2 p. 255-256
2 p.
article
308 Forthcoming papers 1994
199-200 2 p. 409-411
3 p.
article
309 Forthcoming papers 1993
199-200 2 p. 359-361
3 p.
article
310 Forthcoming papers 1985
199-200 2 p. 253-254
2 p.
article
311 Forthcoming papers 1988
199-200 2 p. 277-278
2 p.
article
312 Forthcoming papers 1988
199-200 2 p. 273-274
2 p.
article
313 Forthcoming papers 1984
199-200 2 p. 245-246
2 p.
article
314 Forthcoming papers 1989
199-200 2 p. 255-256
2 p.
article
315 Forthcoming papers 1989
199-200 2 p. 281-282
2 p.
article
316 Forthcoming papers) (1985) 65–74] 1985
199-200 2 p. 249-
1 p.
article
317 Forthcoming papers 1986
199-200 2 p. 239-240
2 p.
article
318 Forthcoming papers 1994
199-200 2 p. 381-382
2 p.
article
319 Forthcoming papers 1988
199-200 2 p. 285-286
2 p.
article
320 Forthcoming papers 1993
199-200 2 p. 387-390
4 p.
article
321 Forthcoming papers 1993
199-200 2 p. 361-362
2 p.
article
322 Forthcoming papers 1986
199-200 2 p. 271-
1 p.
article
323 Forthcoming papers 1991
199-200 2 p. 219-220
2 p.
article
324 Forthcoming papers 1994
199-200 2 p. 411-416
6 p.
article
325 Forthcoming Papers 2005
199-200 2 p. 265-267
3 p.
article
326 Forthcoming Papers 2005
199-200 2 p. 265-266
2 p.
article
327 Forthcoming Papers 2004
199-200 2 p. 217-219
3 p.
article
328 Forthcoming Papers 2004
199-200 2 p. 215-218
4 p.
article
329 Forthcoming Papers 2004
199-200 2 p. 275-278
4 p.
article
330 Forthcoming papers 1990
199-200 2 p. 269-270
article
331 Forthcoming papers École Polytechnique de Montréal, Montréal, Canada 1986
199-200 2 p. 243-
1 p.
article
332 Forthcoming papersosis 1987
199-200 2 p. 269-270
2 p.
article
333 Forthcoming papers1984, Rutgers University, New Brunswick, NJ, U.S.A. 1984
199-200 2 p. 229-230
2 p.
article
334 Forthcoming papers5, University of Geneva, Switzerland 1985
199-200 2 p. 245-246
2 p.
article
335 Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis Stallman, Richard M.
1977
199-200 2 p. 135-196
62 p.
article
336 Foundations of a functional approach to knowledge representation Levesque, Hector J.
1984
199-200 2 p. 155-212
58 p.
article
337 Free at last! Free at last! Thank evolution, free at last! McDermott, Drew
2005
199-200 2 p. 165-173
9 p.
article
338 From Bidirectional Associative Memory to a noise-tolerant, robust Protein Processor Associative Memory Qadir, Omer
2011
199-200 2 p. 673-693
21 p.
article
339 From environments to representations—a mathematical theory of artificial perceptions Arzi-Gonczarowski, Z.
1998
199-200 2 p. 187-247
61 p.
article
340 From ordering-based nonmonotonic reasoning to conditional logics del Cerro, Luis Fariñas
1994
199-200 2 p. 375-393
19 p.
article
341 From the Semantic Web to social machines: A research challenge for AI on the World Wide Web Hendler, Jim
2010
199-200 2 p. 156-161
6 p.
article
342 Fuzzy sets and applications: Selected papers by L.A. Zadeh Shen, Zuliang
1993
199-200 2 p. 351-358
8 p.
article
343 Generalization as search Mitchell, Tom M.
1982
199-200 2 p. 203-226
24 p.
article
344 Generalized subsumption and its applications to induction and redundancy Buntine, Wray
1988
199-200 2 p. 149-176
28 p.
article
345 Generating and generalizing models of visual objects Connell, Jonathan H.
1987
199-200 2 p. 159-183
25 p.
article
346 Generating context-sensitive responses to object-related misconceptions McCoy, Kathleen F.
1989
199-200 2 p. 157-195
39 p.
article
347 Geometric reasoning about mechanical assembly Wilson, Randall H.
1994
199-200 2 p. 371-396
26 p.
article
348 Grammatically biased learning: Learning logic programs using an explicit antecedent description language Cohen, William W
1994
199-200 2 p. 303-366
64 p.
article
349 Growing methods for constructing recursive deterministic perceptron neural networks and knowledge extraction Tajine, M.
1998
199-200 2 p. 295-322
28 p.
article
350 GUS, a frame-driven dialog system Bobrow, Daniel G.
1977
199-200 2 p. 155-173
19 p.
article
351 Hawkins on intelligence: Fascination and frustration Perlis, Donald
2005
199-200 2 p. 184-191
8 p.
article
352 Heuristic search in restricted memory Chakrabarti, P.P.
1989
199-200 2 p. 197-221
25 p.
article
353 Hidden semi-Markov models Yu, Shun-Zheng
2010
199-200 2 p. 215-243
29 p.
article
354 Higher order rule characterization of heuristics for compass and straight edge constructions in geometry Scandura, Joseph M.
1974
199-200 2 p. 149-183
35 p.
article
355 How to build a person: A prolegomenon Smoliar, Stephen W.
1991
199-200 2 p. 253-256
4 p.
article
356 Hybrid reasoning using universal attachment Myers, Karen L.
1994
199-200 2 p. 329-375
47 p.
article
357 Hypothesis generation by machine Morgan, Charles G.
1971
199-200 2 p. 179-187
9 p.
article
358 IJCAI-83: International joint conference on artificial intelligence 1982
199-200 2 p. 268-
1 p.
article
359 Implicit parallelism in genetic algorithms Bertoni, Alberto
1993
199-200 2 p. 307-314
8 p.
article
360 Improved methods of estimating shape from shading using the light source coordinate system Lee, Chia-Hoang
1985
199-200 2 p. 125-143
19 p.
article
361 Independence and Bayesian updating methods Johnson, Rodney W.
1986
199-200 2 p. 217-222
6 p.
article
362 Index 1999
199-200 2 p. 293-
1 p.
article
363 Index 1999
199-200 2 p. 329-338
10 p.
article
364 Index 1999
199-200 2 p. 339-343
5 p.
article
365 Index 2000
199-200 2 p. 281-290
10 p.
article
366 Index 2000
199-200 2 p. 291-294
4 p.
article
367 Index 2000
199-200 2 p. 293-
1 p.
article
368 Index 2000
199-200 2 p. 279-
1 p.
article
369 Index 2000
199-200 2 p. 313-
1 p.
article
370 Index 1999
199-200 2 p. 327-328
2 p.
article
371 Induction and the discovery of the causes of scurvy: a computational reconstruction Corruble, Vincent
1997
199-200 2 p. 205-223
19 p.
article
372 Induction: Process of inference, learning and discovery Shrager, Jeff
1989
199-200 2 p. 249-252
4 p.
article
373 Inferring the positions of bodies from specified spatial relationships Ambler, A.P.
1975
199-200 2 p. 157-174
18 p.
article
374 Influence-based model decomposition for reasoning about spatially distributed physical systems Bailey-Kellogg, Chris
2001
199-200 2 p. 125-166
42 p.
article
375 Integration of weighted knowledge bases Lin, Jinxin
1996
199-200 2 p. 363-378
16 p.
article
376 Intelligent tutoring systems Stefik, Mark
1985
199-200 2 p. 238-245
8 p.
article
377 Intelligent tutoring systems Auguste, Donna
1985
199-200 2 p. 233-238
6 p.
article
378 Interactive music systems: Machine listening and composing Handelman, Eliot
1995
199-200 2 p. 349-359
11 p.
article
379 Interactive semantics Zhuge, Hai
2010
199-200 2 p. 190-204
15 p.
article
380 Interactive transfer of expertise: Acquisition of new inference rules Davis, Randall
1979
199-200 2 p. 121-157
37 p.
article
381 Interact '87—Second IFIP international conference on human-computer interaction 1987
199-200 2 p. 265-266
2 p.
article
382 Internal reinforcement in a connectionist genetic programming approach Teller, Astro
2000
199-200 2 p. 165-198
34 p.
article
383 International conference on data bases in the humanities and social sciences 1983
199-200 2 p. 214-
1 p.
article
384 Interpreting image curve from multiframes Lee, Chia-Hoang
1988
199-200 2 p. 145-163
19 p.
article
385 Interpreting pictures of polyhedral scenes Macworth, A.K.
1973
199-200 2 p. 121-137
17 p.
article
386 Interventions and belief change in possibilistic graphical models Benferhat, Salem
2010
199-200 2 p. 177-189
13 p.
article
387 Introduction to the Special Review Issue Perlis, Don
2005
199-200 2 p. 103-
1 p.
article
388 Justification and defeat Pollock, John L
1994
199-200 2 p. 377-407
31 p.
article
389 Knowledge and reasoning in program synthesis Manna, Zohar
1975
199-200 2 p. 175-208
34 p.
article
390 Knowledge caching for sensor-based systems Roth, Yuval
1994
199-200 2 p. 257-280
24 p.
article
391 La Jolla Conference on Cognitive Science 1979
199-200 2 p. 203-
1 p.
article
392 Lambda-Calculus Conference 1979
199-200 2 p. 205-
1 p.
article
393 Languages with self-reference II Perlis, Donald
1988
199-200 2 p. 179-212
34 p.
article
394 Lattice-theoretic models of conjectures, hypotheses and consequences Ying, Mingsheng
2002
199-200 2 p. 253-267
15 p.
article
395 Learning by creatifying transfer frames Winston, Patrick H.
1978
199-200 2 p. 147-172
26 p.
article
396 Learning cost-sensitive active classifiers ☆ ☆ This extends the short conference paper [19]. Greiner, Russell
2002
199-200 2 p. 137-174
38 p.
article
397 Least third-order cumulant method with adaptive regularization parameter selection for neural networks Leung, Chi-Tat
2001
199-200 2 p. 169-197
29 p.
article
398 Letters on reviews 1985
199-200 2 p. 231-
1 p.
article
399 Letter to the editor Brüning, S.
1993
199-200 2 p. 353-354
2 p.
article
400 Levesque's axiomatization of only knowing is incomplete Halpern, Joseph Y.
1995
199-200 2 p. 381-387
7 p.
article
401 Lexicographic priorities in default logic Rintanen, Jussi
1998
199-200 2 p. 221-265
45 p.
article
402 Limited reasoning in first-order knowledge bases Lakemeyer, Gerhard
1994
199-200 2 p. 213-255
43 p.
article
403 1987 Linguistic institute 1987
199-200 2 p. 263-264
2 p.
article
404 Local Models Semantics, or contextual reasoning=locality+compatibility ☆ ☆ This paper is a substantially revised and extended version of a paper with the same title presented at the 1998 Knowledge Representation and Reasoning Conference (KR'98). The order of the names is alphabetical. Ghidini, Chiara
2001
199-200 2 p. 221-259
39 p.
article
405 Local search characteristics of incomplete SAT procedures Schuurmans, Dale
2001
199-200 2 p. 121-150
30 p.
article
406 Logical analysis of binary data with missing bits Boros, Endre
1999
199-200 2 p. 219-263
45 p.
article
407 Long-distance mutual exclusion for planning Chen, Yixin
2009
199-200 2 p. 365-391
27 p.
article
408 Loop formulas for circumscription Lee, Joohyung
2006
199-200 2 p. 160-185
26 p.
article
409 Low overhead alternatives to SSS∗ Marsland, T.A.
1987
199-200 2 p. 185-199
15 p.
article
410 Machine learning: An artificial intelligence approach Stefik, Mark J.
1985
199-200 2 p. 236-238
3 p.
article
411 Machine learning: An artificial intelligence approach VanLehn, Kurt
1985
199-200 2 p. 233-236
4 p.
article
412 Making compromises among antagonist constraints in a planner Descotte, Yannick
1985
199-200 2 p. 183-217
35 p.
article
413 Master Index—Volumes 121–130 2001
199-200 2 p. 239-246
8 p.
article
414 Master index—Volumes 71–80 1996
199-200 2 p. 369-380
12 p.
article
415 Master index—Volumes 51–60 1993
199-200 2 p. 365-377
13 p.
article
416 Mechanism design for automated negotiation, and its application to task oriented domains Zlotkin, Gilad
1996
199-200 2 p. 195-244
50 p.
article
417 Metacognition in computation: A selected research review Cox, Michael T.
2005
199-200 2 p. 104-141
38 p.
article
418 Minds, machines, and evolution Stefik, Mark J.
1985
199-200 2 p. 237-245
9 p.
article
419 Miracles in formal theories of action Lifschitz, Vladimir
1989
199-200 2 p. 225-237
13 p.
article
420 Model-based reasoning about learner behaviour de Koning, Kees
2000
199-200 2 p. 173-229
57 p.
article
421 Modeling a dynamic environment using a Bayesian multiple hypothesis approach Cox, Ingemar J.
1994
199-200 2 p. 311-344
34 p.
article
422 Modeling belief in dynamic systems, part I: Foundations Friedman, Nir
1997
199-200 2 p. 257-316
60 p.
article
423 Modelling student's problem solving Sleeman, D.H.
1981
199-200 2 p. 171-187
17 p.
article
424 Model simplification by asymptotic order of magnitude reasoning Yip, Kenneth Man-kam
1996
199-200 2 p. 309-348
40 p.
article
425 Multiagent control of self-reconfigurable robots Bojinov, Hristo
2002
199-200 2 p. 99-120
22 p.
article
426 Multiagent learning using a variable learning rate Bowling, Michael
2002
199-200 2 p. 215-250
36 p.
article
427 Multiagent negotiation under time constraints Kraus, Sarit
1995
199-200 2 p. 297-345
49 p.
article
428 Multilevel counterfactuals for generalizations of relational concepts and productions Vere, Steven A.
1980
199-200 2 p. 139-164
26 p.
article
429 Multi-modal diagnosis combining case-based and model-based reasoning: a formal and experimental analysis Portinale, Luigi
2004
199-200 2 p. 109-153
45 p.
article
430 Music and connectionism Garton, Brad
1995
199-200 2 p. 387-398
12 p.
article
431 Music, mind and machine: Studies in computer music, music cognition and artificial intelligence Smoliar, Stephen W.
1995
199-200 2 p. 361-371
11 p.
article
432 Naming and identity in epistemic logic part II: a first-order logic for naming Grove, Adam J.
1995
199-200 2 p. 311-350
40 p.
article
433 Narrative prose generation Callaway, Charles B.
2002
199-200 2 p. 213-252
40 p.
article
434 NATO symposium on artificial and human intelligence 1981
199-200 2 p. 223-224
2 p.
article
435 Natural and artificial intelligence (conceptual approach) — materials of the Fourth International Joint Conference on Artificial Intelligence Schukin, Yefim
1977
199-200 2 p. 233-238
6 p.
article
436 Natural language processing Grosz, Barbara J.
1982
199-200 2 p. 131-136
6 p.
article
437 Navigational strategies in behaviour modelling Dee, Hannah M.
2009
199-200 2 p. 329-342
14 p.
article
438 Nested abnormality theories Lifschitz, Vladimir
1995
199-200 2 p. 351-365
15 p.
article
439 Neural network ensembles: evaluation of aggregation algorithms Granitto, P.M.
2005
199-200 2 p. 139-162
24 p.
article
440 Nonmonotonic inconsistency Cross, Charles B.
2003
199-200 2 p. 161-178
18 p.
article
441 Nonmonotonic inference based on expectations Gärdenfors, Peter
1994
199-200 2 p. 197-245
49 p.
article
442 Notes on “a clash of intuitions” Neufeld, Eric
1991
199-200 2 p. 225-240
16 p.
article
443 [No title] Anderson, Michael L.
2010
199-200 2 p. 152-154
3 p.
article
444 [No title] Goebel, R.G.
2010
199-200 2 p. 155-
1 p.
article
445 [No title] Murphy, Kevin
2010
199-200 2 p. 145-146
2 p.
article
446 [No title] Xiang, Yang
2010
199-200 2 p. 147-151
5 p.
article
447 [No title] Roth-Berghofer, Thomas
2010
199-200 2 p. 143-144
2 p.
article
448 [No title] Benferhat, Salem
2010
199-200 2 p. 134-139
6 p.
article
449 [No title] Sierra, Carles
2010
199-200 2 p. 140-142
3 p.
article
450 [No title] Blum, Christian
2005
199-200 2 p. 261-264
4 p.
article
451 [No title] Hawkins, Jeff
2005
199-200 2 p. 196-200
5 p.
article
452 [No title] Pearl, Judea
2005
199-200 2 p. 180-
1 p.
article
453 [No title] Barták, Roman
2005
199-200 2 p. 142-145
4 p.
article
454 [No title] Davis, Martin
2005
199-200 2 p. 209-210
2 p.
article
455 [No title] Oates, Tim
2005
199-200 2 p. 146-149
4 p.
article
456 [No title] Taylor, John G.
2005
199-200 2 p. 192-195
4 p.
article
457 [No title] Kyburg Jr., Henry E.
2005
199-200 2 p. 174-179
6 p.
article
458 Objective probabilities in expert systems Sucar, L.E.
1993
199-200 2 p. 187-208
22 p.
article
459 Off-line reasoning for on-line efficiency: knowledge bases Moses, Yoram
1996
199-200 2 p. 229-239
11 p.
article
460 On agent-based software engineering Jennings, Nicholas R.
2000
199-200 2 p. 277-296
20 p.
article
461 On calibrating computer controlled cameras for perceiving 3-D scenes Sobel, Irwin
1974
199-200 2 p. 185-198
14 p.
article
462 On computation and cognition: Toward a foundation of cognitive science Pylyshyn, Zenon
1989
199-200 2 p. 248-251
4 p.
article
463 On conjectures in orthocomplemented lattices Trillas, Enric
2000
199-200 2 p. 255-275
21 p.
article
464 On embedding default logic into Moore's autoepistemic logic Schwarz, Grigori
1996
199-200 2 p. 349-359
11 p.
article
465 On Epistemology and cognition Goldman, Alvin I.
1988
199-200 2 p. 265-267
3 p.
article
466 On intelligence as memory Feldman, Jerome A.
2005
199-200 2 p. 181-183
3 p.
article
467 Online planning for multi-agent systems with bounded communication Wu, Feng
2011
199-200 2 p. 487-511
25 p.
article
468 On machine intelligence Lee, R.C.T.
1975
199-200 2 p. 213-214
2 p.
article
469 On prediction in theorist Thielscher, Michael
1993
199-200 2 p. 283-292
10 p.
article
470 On Sandewall's paper: Nonmonotonic inference rules for multiple inheritance with exceptions Simonet, Geneviève
1996
199-200 2 p. 359-374
16 p.
article
471 On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games Dung, Phan Minh
1995
199-200 2 p. 321-357
37 p.
article
472 On the branching factor of the alpha-beta pruning algorithm Baudet, Gérard M.
1978
199-200 2 p. 173-199
27 p.
article
473 On the complexity of inference about probabilistic relational models Jaeger, Manfred
2000
199-200 2 p. 297-308
12 p.
article
474 On the computational complexity of querying bounds on differences constraints Brusoni, Vittorio
1995
199-200 2 p. 367-379
13 p.
article
475 On the consistency of defeasible databases Goldszmidt, Moisés
1991
199-200 2 p. 121-149
29 p.
article
476 On the existence of nonterminating queries for a restricted class of PROLOG-clauses de Schreye, Danny
1989
199-200 2 p. 237-248
12 p.
article
477 On the independence assumption underlying subjective bayesian updating Pednault, E.P.D.
1981
199-200 2 p. 213-222
10 p.
article
478 On the justification of Dempster's rule of combination Voorbraak, Frans
1991
199-200 2 p. 171-197
27 p.
article
479 On the logic of causal explanation Lifschitz, Vladimir
1997
199-200 2 p. 451-465
15 p.
article
480 On the origin of objects Loui, R.P.
1998
199-200 2 p. 353-358
6 p.
article
481 On the range of applicability of an artificial intelligence machine Shaw, David Elliot
1987
199-200 2 p. 151-172
22 p.
article
482 Ontic: A knowledge representation system for mathematics Shankar, Natarajan
1993
199-200 2 p. 355-362
8 p.
article
483 On understanding computers and cognition: A new foundation for design Winograd, Terry
1987
199-200 2 p. 250-261
12 p.
article
484 Ordered binary decision diagrams as knowledge-bases Horiyama, Takashi
2002
199-200 2 p. 189-213
25 p.
article
485 Ordering conjunctive queries Smith, David E.
1985
199-200 2 p. 171-215
45 p.
article
486 Order-sorted logic programming with predicate hierarchy Kaneiwa, Ken
2004
199-200 2 p. 155-188
34 p.
article
487 ORIA 87—Artificial intelligence and sea 1987
199-200 2 p. 263-
1 p.
article
488 Pattern classification and scene analysis 1973
199-200 2 p. 139-143
5 p.
article
489 Pattern-directed inference systems Young, Richard
1979
199-200 2 p. 197-202
6 p.
article
490 Pattern knowledge and search:The SUPREM architecture Berliner, Hans
1989
199-200 2 p. 161-198
38 p.
article
491 Performance of linear-space search algorithms Zhang, Weixiong
1995
199-200 2 p. 241-292
52 p.
article
492 Phase transitions in artificial intelligence systems Huberman, Bernardo A.
1987
199-200 2 p. 155-171
17 p.
article
493 Plan coordination by revision in collective agent based systems Tonino, Hans
2002
199-200 2 p. 121-145
25 p.
article
494 Planning and meta-planning (MOLGEN: Part 2) Stefik, Mark
1981
199-200 2 p. 141-169
29 p.
article
495 Planning and understanding: A computational approach to human reasoning Berlin, Daniel
1984
199-200 2 p. 242-244
3 p.
article
496 Planning and understanding: A computational approach to human reasoning Russell, Daniel M.
1984
199-200 2 p. 239-242
4 p.
article
497 Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP Do, Minh Binh
2001
199-200 2 p. 151-182
32 p.
article
498 Planning in a hierarchy of abstraction spaces Sacerdoti, Earl D.
1974
199-200 2 p. 115-135
21 p.
article
499 Planning parallel actions Lingard, A.R.
1998
199-200 2 p. 261-324
64 p.
article
500 Planning routes through uncertain territory McDermott, Drew
1984
199-200 2 p. 107-156
50 p.
article
501 Planning with constraints (MOLGEN: Part 1) Stefik, Mark
1981
199-200 2 p. 111-139
29 p.
article
502 Point algebras for temporal reasoning: Algorithms and complexity Broxvall, Mathias
2003
199-200 2 p. 179-220
42 p.
article
503 Possible world semantics and autoepistemic reasoning Li, Liwu
1994
199-200 2 p. 281-320
40 p.
article
504 Pragmatics and natural language generation Hovy, Eduard H.
1990
199-200 2 p. 153-197
article
505 Preface Kitano, Hiroaki
1999
199-200 2 p. 189-191
3 p.
article
506 Principles of human—computer collaboration for knowledge discovery in science Valdés-Pérez, Raúl E.
1999
199-200 2 p. 335-346
12 p.
article
507 Problem difficulty for tabu search in job-shop scheduling Watson, Jean-Paul
2003
199-200 2 p. 189-217
29 p.
article
508 Problem solving with the ATMS de Kleer, Johan
1986
199-200 2 p. 197-224
28 p.
article
509 Procedural control in production systems Georgeff, M.P.
1982
199-200 2 p. 175-201
27 p.
article
510 Processing of semantic nets on dataflow architectures Bic, Lubomir
1985
199-200 2 p. 219-227
9 p.
article
511 Prolog and natural-language analysis Shankar, C.Ravi
1989
199-200 2 p. 275-278
4 p.
article
512 Proof by consistency Kapur, Deepak
1987
199-200 2 p. 125-157
33 p.
article
513 Prototypical knowledge for expert systems Aikins, Janice S.
1983
199-200 2 p. 163-210
48 p.
article
514 Proving properties of states in the situation calculus Reiter, Raymond
1993
199-200 2 p. 337-351
15 p.
article
515 Pruning algorithms for multi-model adversary search Carmel, David
1998
199-200 2 p. 325-355
31 p.
article
516 Qualitative and quantitative simulation: bridging the gap Berleant, Daniel
1997
199-200 2 p. 215-255
41 p.
article
517 Qualitatively faithful quantitative prediction Šuc, Dorian
2004
199-200 2 p. 189-214
26 p.
article
518 Qualitative representation of positional information Clementini, Eliseo
1997
199-200 2 p. 317-356
40 p.
article
519 Quantifying inductive bias: AI learning algorithms and Valiant's learning framework Haussler, David
1988
199-200 2 p. 177-221
45 p.
article
520 Quantum computation, quantum theory and AI Ying, Mingsheng
2010
199-200 2 p. 162-176
15 p.
article
521 Ranking games Brandt, Felix
2009
199-200 2 p. 221-239
19 p.
article
522 Rationality, transitivity, and contraposition Freund, Michael
1991
199-200 2 p. 191-203
13 p.
article
523 Reasoning about action I Ginsberg, Matthew L.
1988
199-200 2 p. 165-195
31 p.
article
524 Reasoning about truth Priest, G.
1989
199-200 2 p. 231-244
14 p.
article
525 Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge Pinkas, Gadi
1995
199-200 2 p. 203-247
45 p.
article
526 Reasoning with minimal models: efficient algorithms and applications Ben-Eliyahu-Zohary, Rachel
1997
199-200 2 p. 421-449
29 p.
article
527 Reducing reexpansions in iterative-deepening search by controlling cutoff bounds Sarkar, U.K.
1991
199-200 2 p. 207-221
15 p.
article
528 Reduction rules for resolution-based systems Eisinger, Norbert
1991
199-200 2 p. 141-181
41 p.
article
529 Redundancy in logic I: CNF propositional formulae Liberatore, Paolo
2005
199-200 2 p. 203-232
30 p.
article
530 Refinements to depth-first iterative-deepening search in automatic theorem proving Nie, Xumin
1989
199-200 2 p. 223-235
13 p.
article
531 Relation algebras of intervals Hirsch, Robin
1996
199-200 2 p. 267-295
29 p.
article
532 Removing redundancy from a clause Gottlob, Georg
1993
199-200 2 p. 263-289
27 p.
article
533 Π-representation: A clause representation for parallel search Fishman, Daniel H.
1975
199-200 2 p. 103-127
25 p.
article
534 Representing action: indeterminacy and ramifications Giunchiglia, Enrico
1997
199-200 2 p. 409-438
30 p.
article
535 ReTAX: a step in the automation of taxonomic revision Alberdi, Eugenio
1997
199-200 2 p. 257-279
23 p.
article
536 Revenue monotonicity in deterministic, dominant-strategy combinatorial auctions Rastegari, Baharak
2011
199-200 2 p. 441-456
16 p.
article
537 Review of Natural Language Processing in R.A. Wilson and F.C. Keil (Eds.), The MIT Encyclopedia of the Cognitive Sciences ☆ ☆ MIT Press, Cambridge, MA, 1999. CD-ROM. Price US$ 149.95. ISBN 0-262-73124-X. 1312 pages. Price US$ 149.95 (Cloth). ISBN 0-262-23200-6. Dorr, Bonnie Jean
2001
199-200 2 p. 185-189
5 p.
article
538 Review of R.A. Wilson and F.C. Keil (Eds.), The MIT Encyclopedia of the Cognitive Sciences ☆ ☆ MIT Press, Cambridge, MA, 1999. 1312 pages. Price US$ 149.95 (Cloth). ISBN 0-262-23200-6. CD-ROM. Price US$ 149.95. ISBN 0-262-73124-X. Okamoto, Yoshi
2001
199-200 2 p. 211-212
2 p.
article
539 Rippling: A heuristic for guiding inductive proofs Bundy, Alan
1993
199-200 2 p. 185-253
69 p.
article
540 RoboCup: Today and tomorrow—What we have learned Asada, Minoru
1999
199-200 2 p. 193-214
22 p.
article
541 Robotics Lozano-Perez, Tomas
1982
199-200 2 p. 137-143
7 p.
article
542 Robot introspection through learned hidden Markov models Fox, Maria
2006
199-200 2 p. 59-113
55 p.
article
543 Robot shaping: developing autonomous agents through learning Dorigo, Marco
1994
199-200 2 p. 321-370
50 p.
article
544 Robust combinatorial auction protocol against false-name bids Yokoo, Makoto
2001
199-200 2 p. 167-181
15 p.
article
545 Robust logics Valiant, Leslie G.
2000
199-200 2 p. 231-253
23 p.
article
546 Robust reasoning: integrating rule-based and similarity-based reasoning Sun, Ron
1995
199-200 2 p. 241-295
55 p.
article
547 Rough approximation quality revisited Gediga, Günther
2001
199-200 2 p. 219-234
16 p.
article
548 SampleSearch: Importance sampling in presence of determinism Gogate, Vibhav
2011
199-200 2 p. 694-729
36 p.
article
549 Scientific discovery and simplicity of method Simon, Herbert A.
1997
199-200 2 p. 177-181
5 p.
article
550 Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems Baroni, Pietro
2005
199-200 2 p. 187-259
73 p.
article
551 Semantic interpretation and ambiguity Hirst, Graeme
1988
199-200 2 p. 131-177
47 p.
article
552 Semantics and cognition Kleiman, Ruben J.
1986
199-200 2 p. 225-235
11 p.
article
553 Shading into texture Pentland, Alex P.
1986
199-200 2 p. 147-170
24 p.
article
554 Shape from fractal geometry Chen, Susan S.
1990
199-200 2 p. 199-218
article
555 Shape from texture and contour by weak isotropy Gårding, Jonas
1993
199-200 2 p. 243-297
55 p.
article
556 Similarities and distinctions in sampling strategies for Genetic Algorithms Reynolds, David
1996
199-200 2 p. 375-390
16 p.
article
557 Similarity of personal preferences: Theoretical foundations and empirical analysis Ha, Vu
2003
199-200 2 p. 149-173
25 p.
article
558 Simple environments fail as illustrations of intelligence: A review of R. Pfeifer and C. Scheier, Understanding Intelligence ☆ ☆ MIT Press, Cambridge, MA, 1999. 700 pages. Price US$ 63.00 (cloth). ISBN 0-262-16181-8. Lane, Peter C.R.
2001
199-200 2 p. 261-267
7 p.
article
559 Sixth conference on automated deduction courant institute of mathematical sciences 1982
199-200 2 p. 265-
1 p.
article
560 Sloman's view of Gödel's sentence Bojadžiev, Damjan
1995
199-200 2 p. 389-393
5 p.
article
561 Some fundamental properties of local constraint propagation Güsgen, Hans-Werner
1988
199-200 2 p. 237-247
11 p.
article
562 Some improvements to the Shenoy-Shafer and Hugin architectures for computing marginals Schmidt, Tuija
1998
199-200 2 p. 323-333
11 p.
article
563 Some quantifiers require two-predicate scopes Cushing, Steven
1987
199-200 2 p. 259-267
9 p.
article
564 Sound and complete qualitative simulation is impossible Say, A.C.Cem
2003
199-200 2 p. 251-266
16 p.
article
565 Spatial reasoning in a fuzzy region connection calculus Schockaert, Steven
2009
199-200 2 p. 258-298
41 p.
article
566 Special issue of Artificial Intelligence on applications of AI 1997
199-200 2 p. 439-440
2 p.
article
567 Special Issue of the journal Artificial Intelligence on “AI & Law” Rissland, Edwina L.
2001
199-200 2 p. 271-272
2 p.
article
568 Special Issue of the journal Artificial Intelligence on “Fuzzy Set and Possibility Theory-Based Methods in Artificial Intelligence” Dubois, Didier
2001
199-200 2 p. 269-270
2 p.
article
569 Special Issue of the journal Artificial Intelligence on Reformulation Ellman, Thomas
2001
199-200 2 p. 231-232
2 p.
article
570 Special issue on computational tradeoffs under bounded resources 1998
199-200 2 p. 337-338
2 p.
article
571 Special issue on intelligent internet systems 1998
199-200 2 p. 335-
1 p.
article
572 Speech understanding systems: Final report of a study group Kassler, Michael
1975
199-200 2 p. 209-
1 p.
article
573 Speech-understanding systems: Final report of a study group Kassler, Michael
1975
199-200 2 p. 209-
1 p.
article
574 Subject Index—Volumes 121–130 2001
199-200 2 p. 247-250
4 p.
article
575 Surplus equivalence of leveled commitment contracts Sandholm, Tuomas
2002
199-200 2 p. 239-264
26 p.
article
576 Tail uncertainty analysis in complex systems Castillo, Enrique
1997
199-200 2 p. 395-419
25 p.
article
577 Task decomposition, dynamic role assignment, and low-bandwidth communication for real-time strategic teamwork Stone, Peter
1999
199-200 2 p. 241-273
33 p.
article
578 Task modeling with reusable problem-solving methods Eriksson, Henrik
1995
199-200 2 p. 293-326
34 p.
article
579 TEAM: An experiment in the design of transportable natural-language interfaces Grosz, Barbara J.
1987
199-200 2 p. 173-243
71 p.
article
580 Terminological reasoning is inherently intractable Nebel, Bernhard
1990
199-200 2 p. 235-249
article
581 The architecture of cognition VanLehn, Kurt
1986
199-200 2 p. 235-240
6 p.
article
582 The art of the metaobject protocol Gabriel, Richard P.
1993
199-200 2 p. 331-342
12 p.
article
583 The automated understanding of simple bar charts Elzer, Stephanie
2011
199-200 2 p. 526-555
30 p.
article
584 The B∗ tree search algorithm—New results Palay, Andrew J.
1982
199-200 2 p. 145-163
19 p.
article
585 The catalogue of artificial intelligence techniques 1987
199-200 2 p. 275-277
3 p.
article
586 The Cognitive Sciences: A comment on 6 reviews of The MIT Encyclopedia of the Cognitive Sciences Wilson, R.A
2001
199-200 2 p. 223-229
7 p.
article
587 The common order-theoretic structure of version spaces and ATMSs Gunter, Carl A.
1997
199-200 2 p. 357-407
51 p.
article
588 The complexity of achievement and maintenance problems in agent-based systems Stewart, Iain A.
2003
199-200 2 p. 175-191
17 p.
article
589 The complexity of approximating MAPs for belief networks with bounded probabilities Abdelbar, Ashraf M.
2000
199-200 2 p. 283-288
6 p.
article
590 The complexity of constraint satisfaction problems for small relation algebras Cristani, M.
2004
199-200 2 p. 177-196
20 p.
article
591 The complexity of path-based defeasible inheritance Selman, Bart
1993
199-200 2 p. 303-339
37 p.
article
592 The complexity of some polynomial network consistency algorithms for constraint satisfaction problems 1985
199-200 2 p. 247-
1 p.
article
593 The complexity of theory revision Greiner, Russell
1999
199-200 2 p. 175-217
43 p.
article
594 The computer revolution in science: steps towards the realization of computer-supported discovery environments de Jong, Hidde
1997
199-200 2 p. 225-256
32 p.
article
595 The description identification problem Mellish, Chris
1991
199-200 2 p. 151-167
17 p.
article
596 The ecology of computation Wellman, Michael P.
1991
199-200 2 p. 205-218
14 p.
article
597 The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic Halpern, Joseph Y.
1995
199-200 2 p. 361-372
12 p.
article
598 The efficiency of the alpha-beta search on trees with branch-dependent terminal node scores Newborn, M.M.
1977
199-200 2 p. 137-153
17 p.
article
599 The expanding breadth of artificial intelligence research Goebel, Randy
2010
199-200 2 p. 133-
1 p.
article
600 The extended global cardinality constraint: An empirical survey Nightingale, Peter
2011
199-200 2 p. 586-614
29 p.
article
601 The fifth generation: Artificial intelligence and Japan's computer challenge to the world de Kleer, Johan
1984
199-200 2 p. 222-226
5 p.
article
602 The fifth generation: Artificial intelligence and Japan's computer challenge to the world Stefik, Mark
1984
199-200 2 p. 219-222
4 p.
article
603 The importance of open and recursive circumscription Besnard, Philippe
1989
199-200 2 p. 251-262
12 p.
article
604 The influence of social norms and social consciousness on intention reconciliation Grosz, Barbara J.
2002
199-200 2 p. 147-177
31 p.
article
605 The invention of memory: A new view of the brain Clancey, William J.
1991
199-200 2 p. 241-284
44 p.
article
606 The logical foundations of goal-regression planning in autonomous agents Pollock, John L.
1998
199-200 2 p. 267-334
68 p.
article
607 The mind's new labels?: Review of R.A. Wilson and F.C. Keil (Eds.), The MIT Encyclopedia of the Cognitive Sciences ☆ ☆ MIT Press, Cambridge, MA, 1999. 1312 pages. Price US$ 149.95 (Cloth). ISBN 0-262-23200-6. CD-ROM. Price US$ 149.95. ISBN 0-262-73124-X. Peterson, Donald M.
2001
199-200 2 p. 213-216
4 p.
article
608 The MIT Encyclopedia of the Cognitive Sciences, edited by Robert Wilson and Frank Keil ☆ ☆ MIT Press, Cambridge, MA, 1999. 1312 pages. Price US$ 149.95. ISBN 0-262-23200-6. CD-ROM. Price US$ 149.95. ISBN 0-262-73124-X. Carr, Catherine
2001
199-200 2 p. 183-184
2 p.
article
609 The multi-player version of minimax displays game-tree pathology Mutchler, David
1993
199-200 2 p. 323-336
14 p.
article
610 The music collection Smoliar, Stephen W.
1995
199-200 2 p. 341-342
2 p.
article
611 The nature of heuristics Lenat, Douglas B.
1982
199-200 2 p. 189-249
61 p.
article
612 The organization of expert systems, a tutorial Stefik, Mark
1982
199-200 2 p. 135-173
39 p.
article
613 Theory refinement combining analytical and empirical methods Ourston, Dirk
1994
199-200 2 p. 273-309
37 p.
article
614 Theory revision with queries: Horn, read-once, and parity formulas Goldsmith, Judy
2004
199-200 2 p. 139-176
38 p.
article
615 The prize of symbiosis 1987
199-200 2 p. 266-268
3 p.
article
616 The scope of the cognitive sciences: Reply to 6 reviews of The MIT Encyclopedia of the Cognitive Sciences Keil, F.C.
2001
199-200 2 p. 217-221
5 p.
article
617 The strange, familiar, and forgotten: An anatomy of consciousness Clancey, William J.
1993
199-200 2 p. 313-356
44 p.
article
618 The transferable belief model Smets, Philippe
1994
199-200 2 p. 191-234
44 p.
article
619 Third Advanced Course on Foundations of Computer Science 1978
199-200 2 p. 224-
1 p.
article
620 Time-efficient state space search Reinefeld, Alexander
1994
199-200 2 p. 397-408
12 p.
article
621 Towards a general theory of action and time Allen, James F.
1984
199-200 2 p. 123-154
32 p.
article
622 Tractable constraints on ordered domains Jeavons, Peter G.
1995
199-200 2 p. 327-339
13 p.
article
623 Tractable reasoning via approximation Schaerf, Marco
1995
199-200 2 p. 249-310
62 p.
article
624 Truth and meaning Perlis, Donald
1989
199-200 2 p. 245-250
6 p.
article
625 Two party immediate response disputes: Properties and efficiency Dunne, Paul E.
2003
199-200 2 p. 221-250
30 p.
article
626 Uncovering trees in constraint networks Meiri, Itay
1996
199-200 2 p. 245-267
23 p.
article
627 Undecidability of subsumption in NIKL Patel-Schneider, Peter F.
1989
199-200 2 p. 263-272
10 p.
article
628 Understanding computers and cognition: A new foundation for design Stefik, Mark J.
1987
199-200 2 p. 220-226
7 p.
article
629 Understanding computers and cognition: A new foundation for design Clancey, William J.
1987
199-200 2 p. 232-250
19 p.
article
630 Understanding computers and cognition: A new foundation for design Suchman, Lucy A.
1987
199-200 2 p. 227-232
6 p.
article
631 Understanding computers and cognition: A new foundation for design Vellino, André
1987
199-200 2 p. 213-220
8 p.
article
632 Understanding computers and cognition: A new foundation for design Stefik, Mark J.
1987
199-200 2 p. 213-
1 p.
article
633 Understanding image intensities Horn, Berthold K.P.
1977
199-200 2 p. 201-231
31 p.
article
634 Understanding music with AI—Perspectives on cognitive musicology Wiggins, Geraint A.
1995
199-200 2 p. 373-385
13 p.
article
635 Understanding objects with curved surfaces from a single perspective view of boundaries Lee, Shih Jong
1985
199-200 2 p. 145-169
25 p.
article
636 Universal subgoaling and chunking: The automatic generation and learning of goal hierarchies Shrager, Jeff
1987
199-200 2 p. 269-273
5 p.
article
637 Using Grice's maxim of Quantity to select the content of plan descriptions Young, R.Michael
1999
199-200 2 p. 215-256
42 p.
article
638 Using meta-level inference for selective application of multiple rewrite rule sets in algebraic manipulation Bundy, Alan
1981
199-200 2 p. 189-211
23 p.
article
639 Using patterns and plans in chess Wilkins, David
1980
199-200 2 p. 165-203
39 p.
article
640 Using rewriting rules for connection graphs to prove theorems Chang, C.L.
1979
199-200 2 p. 159-178
20 p.
article
641 Using similarity criteria to make issue trade-offs in automated negotiations Faratin, P.
2002
199-200 2 p. 205-237
33 p.
article
642 Value minimization in circumscription Baral, China
1998
199-200 2 p. 163-186
24 p.
article
643 Variable precision logic Michalski, Ryszard S.
1986
199-200 2 p. 121-146
26 p.
article
644 Vehicles: Experiments in synthetic psychology Stefik, Mark J.
1985
199-200 2 p. 246-248
3 p.
article
645 Version spaces and the consistency problem Hirsh, Haym
2004
199-200 2 p. 115-138
24 p.
article
646 What does a conditional knowledge base entail? Lehmann, D
1994
199-200 2 p. 411-
1 p.
article
647 What's in a linkage? Review of: Glenn Kramer, solving geometric constraint systems Sacks, Elisha P.
1993
199-200 2 p. 343-349
7 p.
article
648 Why is AI so scary? Anderson, Michael L.
2005
199-200 2 p. 201-208
8 p.
article
649 Will it reach the top? Prediction in the mechanics world Bundy, Alan
1978
199-200 2 p. 129-146
18 p.
article
650 Wolfram's New Science: A New Start? Hennacy, Ken
2005
199-200 2 p. 150-164
15 p.
article
651 Worst-case analysis of the perception and exponentiated update algorithms Bylander, Tom
1998
199-200 2 p. 335-352
18 p.
article
                             651 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands