skip to main content
Skip header Section
Principles of artificial intelligenceMay 1980
Publisher:
  • Morgan Kaufmann Publishers Inc.
  • 340 Pine Street, Sixth Floor
  • San Francisco
  • CA
  • United States
ISBN:978-0-934613-10-1
Published:01 May 1980
Pages:
476
Skip Bibliometrics Section
Bibliometrics
Abstract

No abstract available.

Cited By

  1. Hart F and Okhrin O (2024). Enhanced method for reinforcement learning based dynamic obstacle avoidance by assessment of collision risk, Neurocomputing, 568:C, Online publication date: 1-Feb-2024.
  2. E. Carvalho A, Ferreira J and Portugal D (2024). 3D traversability analysis and path planning based on mechanical effort for UGVs in forest environments, Robotics and Autonomous Systems, 171:C, Online publication date: 1-Jan-2024.
  3. Małkiński M and Mańdziuk J (2023). A review of emerging research directions in Abstract Visual Reasoning, Information Fusion, 91:C, (713-736), Online publication date: 1-Mar-2023.
  4. Hong S and Williams B (2023). An anytime algorithm for constrained stochastic shortest path problems with deterministic policies, Artificial Intelligence, 316:C, Online publication date: 1-Mar-2023.
  5. Cheng C and Jiang J Lifting (D)QBF preprocessing and solving techniques to (D)SSAT Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence and Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence and Thirteenth Symposium on Educational Advances in Artificial Intelligence, (3906-3914)
  6. Waardenburg L and Huysman M (2022). From coexistence to co-creation, Information and Organization, 32:4, Online publication date: 1-Dec-2022.
  7. Ahmed M, Sultan A, Hassan A, Abdulraheem A and Mahmoud M (2022). Predicting the performance of constant volume depletion tests for gas condensate reservoirs using artificial intelligence techniques, Neural Computing and Applications, 34:24, (22115-22125), Online publication date: 1-Dec-2022.
  8. Díaz-Moreno J, Medina J and Portillo J (2022). Fuzzy logic programs as hypergraphs. Termination results, Fuzzy Sets and Systems, 445:C, (22-42), Online publication date: 20-Sep-2022.
  9. Liu W, Jin J, Wu H, Gong Y, Jiang Z and Zhai J (2022). Zoro, Journal of Parallel and Distributed Computing, 166:C, (126-138), Online publication date: 1-Aug-2022.
  10. Gonzalez M, Liu W, Shirase L, Tomczak D, Lobbe C, Justenhoven R and Martin N (2022). Allying with AI? Reactions toward human-based, AI/ML-based, and augmented hiring processes, Computers in Human Behavior, 130:C, Online publication date: 1-May-2022.
  11. Liu Y, Zheng Z, Qin F, Zhang X and Yao H (2022). A residual convolutional neural network based approach for real-time path planning, Knowledge-Based Systems, 242:C, Online publication date: 22-Apr-2022.
  12. Laxmi S and Gupta S (2022). Multi-category intuitionistic fuzzy twin support vector machines with an application to plant leaf recognition, Engineering Applications of Artificial Intelligence, 110:C, Online publication date: 1-Apr-2022.
  13. Alkaya A, Yildirim S and Aksakalli V (2021). Heuristics for the Canadian traveler problem with neutralizations, Computers and Industrial Engineering, 159:C, Online publication date: 1-Sep-2021.
  14. Berlin J, Hess G, Karlsson A, Ljungbergh W, Zhang Z, Åkesson K and Götvall P Trajectory Generation for Mobile Robots in a Dynamic Environment using Nonlinear Model Predictive Control 2021 IEEE 17th International Conference on Automation Science and Engineering (CASE), (942-947)
  15. Day M and Shaw S AI Customer Service System with Pre-trained Language and Response Ranking Models for University Admissions 2021 IEEE 22nd International Conference on Information Reuse and Integration for Data Science (IRI), (395-401)
  16. Bouzar-Benlabiod L and Rubin S (2020). Heuristic Acquisition for Data Science, Information Systems Frontiers, 22:5, (1001-1007), Online publication date: 1-Oct-2020.
  17. Eckstein T and Steinbauer G Action-Based Programming with YAGI - An Update on Usability and Performance Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices, (557-569)
  18. Aggarwal S and Kumar N (2020). Path planning techniques for unmanned aerial vehicles, Computer Communications, 149:C, (270-299), Online publication date: 1-Jan-2020.
  19. Kishimoto A, Buesser B, Chen B and Botea A Depth-first proof-number search with heuristic edge cost and application to chemical synthesis planning Proceedings of the 33rd International Conference on Neural Information Processing Systems, (7226-7236)
  20. Yildirim S, Aksakalli V and Alkaya A (2019). Canadian Traveler Problem with Neutralizations, Expert Systems with Applications: An International Journal, 132:C, (151-165), Online publication date: 15-Oct-2019.
  21. Sharma O, Sahoo N and Puhan N A Survey on Smooth Path Generation Techniques for Nonholonomic Autonomous Vehicle Systems IECON 2019 - 45th Annual Conference of the IEEE Industrial Electronics Society, (5167-5172)
  22. Höser M Modeling adaptive learning agents for domain knowledge transfer Proceedings of the 22nd International Conference on Model Driven Engineering Languages and Systems, (660-665)
  23. Kishimoto A, Botea A and Marinescu R Depth-first memory-limited AND/OR search and unsolvability in cyclic search spaces Proceedings of the 28th International Joint Conference on Artificial Intelligence, (1280-1288)
  24. K. H, Balachandran A and Shah S (2022). Optimal whole-body motion planning of humanoids in cluttered environments, Robotics and Autonomous Systems, 118:C, (263-277), Online publication date: 1-Aug-2019.
  25. ACM
    Diaz J and Rudolf T Path Planning Based on an Artificial Vision System and Optical Character Recognition (OCR) Proceedings of the 2nd International Conference on Control and Computer Vision, (33-37)
  26. Sadhu A, Shukla S, Bera T and Dasgupta R Safe and Fast Path Planning in Cluttered Environment using Contiguous Free-space Partitioning 2019 International Conference on Robotics and Automation (ICRA), (6972-6978)
  27. Botea A, Kishimoto A, Nikolova E, Braghin S, Berlingerio M and Daly E (2019). Computing multi-modal journey plans under uncertainty, Journal of Artificial Intelligence Research, 65:1, (633-674), Online publication date: 1-May-2019.
  28. Liu J (2019). Using big data database to construct new GFuzzy text mining and decision algorithm for targeting and classifying customers, Computers and Industrial Engineering, 128:C, (1088-1095), Online publication date: 1-Feb-2019.
  29. Holte R and Zilles S On the optimal efficiency of cost-algebraic A* Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, (2288-2295)
  30. ACM
    Chen J and Shi D Development and Composition of Robot Architecture in Dynamic Environment Proceedings of the 2018 International Conference on Robotics, Control and Automation Engineering, (96-101)
  31. Fan X On Generating Explainable Plans with Assumption-Based Argumentation PRIMA 2018: Principles and Practice of Multi-Agent Systems, (344-361)
  32. Siemon D, Strohmann T and Robra-Bissantz S (2020). The Virtual Collaborator - A Definition and Research Agenda, International Journal of e-Collaboration, 14:4, (24-43), Online publication date: 1-Oct-2018.
  33. Marinescu R, Lee J, Dechter R and Ihler A (2019). AND/OR search for marginal MAP, Journal of Artificial Intelligence Research, 63:1, (875-921), Online publication date: 1-Sep-2018.
  34. Niewola A and Podsedkowski L (2018). L* Algorithm--A Linear Computational Complexity Graph Searching Algorithm for Path Planning, Journal of Intelligent and Robotic Systems, 91:3-4, (425-444), Online publication date: 1-Sep-2018.
  35. Hiraishi H (2018). Passenger Condition Based Route-Planning for Cognitive Vehicle System, International Journal of Software Science and Computational Intelligence, 10:2, (25-35), Online publication date: 1-Apr-2018.
  36. Sturtevant N and Felner A A brief history and recent achievements in bidirectional search Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence, (8000-8006)
  37. Grigori D and Gater A (2017). PSearch, Service Oriented Computing and Applications, 11:3, (249-264), Online publication date: 1-Sep-2017.
  38. Keren S, Pineda L, Gal A, Karpas E and Zilberstein S Equi-reward utility maximizing design in stochastic environments Proceedings of the 26th International Joint Conference on Artificial Intelligence, (4353-4360)
  39. Francès G, Ramírez M, Lipovetzky N and Geffner H Purely declarative action representations are overrated Proceedings of the 26th International Joint Conference on Artificial Intelligence, (4294-4301)
  40. Chen J, Holte R, Zilles S and Sturtevant N Front-to-end bidirectional heuristic search with near-optimal node expansions Proceedings of the 26th International Joint Conference on Artificial Intelligence, (489-495)
  41. ACM
    Nabizadeh A, Mário Jorge A and Paulo Leal J RUTICO Adjunct Publication of the 25th Conference on User Modeling, Adaptation and Personalization, (153-158)
  42. Fehér P, Asztalos M, Vajk T, Mészáros T and Lengyel L (2017). Detecting subgraph isomorphism with MapReduce, The Journal of Supercomputing, 73:5, (1810-1851), Online publication date: 1-May-2017.
  43. Flerova N, Marinescu R and Dechter R (2017). Weighted heuristic anytime search, Annals of Mathematics and Artificial Intelligence, 79:1-3, (77-128), Online publication date: 1-Mar-2017.
  44. Buşoniu L, Daniels A and Babuška R (2016). Online learning for optimistic planning, Engineering Applications of Artificial Intelligence, 55:C, (70-82), Online publication date: 1-Oct-2016.
  45. Rubin S, Bouabana-Tebibel T and Hoadjli Y (2016). On the empirical justification of theoretical heuristic transference and learning, Information Systems Frontiers, 18:5, (981-994), Online publication date: 1-Oct-2016.
  46. Kishimoto A, Botea A and Daly E Combining deterministic and nondeterministic search for optimal journey planning under uncertainty Proceedings of the Twenty-second European Conference on Artificial Intelligence, (295-303)
  47. Lam W, Kask K, Dechter R and Larrosa J On the impact of subproblem orderings on anytime AND/OR best-first search for lower bounds Proceedings of the Twenty-second European Conference on Artificial Intelligence, (1567-1568)
  48. Wiesel-Kapah I, Kaminka G, Hachmon G, Agmon N and Bachelet I Rule-based programming of molecular robot swarms for biomedical applications Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (3505-3512)
  49. Torralba Á, López C and Borrajo D Abstraction heuristics for symbolic bidirectional search Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (3272-3278)
  50. Hasidi N, Stern R, Kalech M and Reches S Anticipatory troubleshooting Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (3133-3139)
  51. Larrosa J, Rollon E and Dechter R Limited discrepancy AND/OR search and its application to optimization tasks in graphical models Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (617-623)
  52. Eggeling R and Koivisto M Pruning rules for learning parsimonious context trees Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, (152-161)
  53. Kreison O and Ruuben T Sniper Line-of Sight Calculations for Route Planning in Asymmetric Military Environments Proceedings of the Third International Workshop on Modelling and Simulation for Autonomous Systems - Volume 9991, (359-370)
  54. Hong M and Rozenblit J Modeling of a transfer task in computer assisted surgical training Proceedings of the Modeling and Simulation in Medicine Symposium, (1-6)
  55. Luque M, Nielsen T and Jensen F (2016). Anytime Decision Making Based on Unconstrained Influence Diagrams, International Journal of Intelligent Systems, 31:4, (379-398), Online publication date: 1-Apr-2016.
  56. Holte R, Felner A, Sharon G and Sturtevant N Bidirectional search that is guaranteed to meet in the middle Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, (3411-3417)
  57. Santana P, Thiébaux S and Williams B RAO* Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, (3308-3314)
  58. Lee J, Marinescu R, Dechter R and Ihler A From exact to anytime solutions for Marginal MAP Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, (3255-3262)
  59. ACM
    Bai A, Wu F and Chen X (2015). Online Planning for Large Markov Decision Processes with Hierarchical Decomposition, ACM Transactions on Intelligent Systems and Technology, 6:4, (1-28), Online publication date: 13-Aug-2015.
  60. Santana P Dynamic execution of temporal plans with sensing actions and bounded risk Proceedings of the 24th International Conference on Artificial Intelligence, (4393-4394)
  61. Marinescu R, Dechter R and Ihler A Pushing forward marginal map with best-first search Proceedings of the 24th International Conference on Artificial Intelligence, (696-702)
  62. ACM
    Frank J and Kapila V Path Bending Proceedings of the 20th International Conference on Intelligent User Interfaces, (186-190)
  63. Schmidhuber J (2015). Deep learning in neural networks, Neural Networks, 61:C, (85-117), Online publication date: 1-Jan-2015.
  64. ACM
    Chen L and Mitra T (2014). Graph Minor Approach for Application Mapping on CGRAs, ACM Transactions on Reconfigurable Technology and Systems, 7:3, (1-25), Online publication date: 1-Aug-2014.
  65. Kishimoto A and Marinescu R Recursive best-first AND/OR search for optimization in graphical models Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, (400-409)
  66. Ramirez M and Sardina S Directed fixed-point regression-based planning for non-deterministic domains Proceedings of the Twenty-Fourth International Conferenc on International Conference on Automated Planning and Scheduling, (235-243)
  67. Prieditis A and Lee M When classification becomes a problem Proceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition, (466-480)
  68. Gutenschwager K, Völker S, Radtke A and Zeller G The shortest path Proceedings of the Winter Simulation Conference, (1-12)
  69. Ghosh P, Chakrabarti P and Dasgupta P Anytime algorithms for biobjective heuristic search Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence, (230-241)
  70. Berger J, Boukhtouta A, Benmoussa A and Kettani O (2012). A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment, Computers and Operations Research, 39:12, (3420-3430), Online publication date: 1-Dec-2012.
  71. Hagen S, da Costa Cordeiro W, Gaspary L, Granville L, Seibold M and Kemper A Planning in the large Proceedings of the 8th International Conference on Network and Service Management, (108-116)
  72. ACM
    van Niekerk F, van Rooyen G, Kroon S and Inggs C Monte-Carlo tree search parallelisation for computer go Proceedings of the South African Institute for Computer Scientists and Information Technologists Conference, (129-138)
  73. Kolobov A, Dai P, Mausam and Weld D Reverse iterative deepening for finite-horizon MDPs with large branching factors Proceedings of the Twenty-Second International Conference on International Conference on Automated Planning and Scheduling, (146-154)
  74. Liu F, Narayanan A and Bai Q Effective methods for generating collision free paths for multiple robots based on collision type (demonstration) Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3, (1459-1460)
  75. Di Loreto I and Hervouet F The role of identity in agent design Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3, (1449-1450)
  76. Rioux F and Lizotte M Image-scenarization Proceedings of the Winter Simulation Conference, (271-283)
  77. Chen Y, Yang J, Xu D, Zhou Z and Tang D (2011). Inference analysis and adaptive training for belief rule based systems, Expert Systems with Applications: An International Journal, 38:10, (12845-12860), Online publication date: 15-Sep-2011.
  78. ACM
    Rabinovich E, Etzion O and Gal A Pattern rewriting framework for event processing optimization Proceedings of the 5th ACM international conference on Distributed event-based system, (101-112)
  79. Kanovich M, Rowe P and Scedrov A (2011). Collaborative Planning with Confidentiality, Journal of Automated Reasoning, 46:3-4, (389-421), Online publication date: 1-Apr-2011.
  80. ACM
    Steiner N, Wood A, Shojaei H, Couch J, Athanas P and French M Torc Proceedings of the 19th ACM/SIGDA international symposium on Field programmable gate arrays, (41-44)
  81. Lizotte M and Rioux F Image-scenarization Proceedings of the Winter Simulation Conference, (837-848)
  82. ACM
    Bryce D, Verdicchio M and Kim S (2010). Planning interventions in biological networks, ACM Transactions on Intelligent Systems and Technology, 1:2, (1-26), Online publication date: 1-Nov-2010.
  83. Warnquist H, Kvarnström J and Doherty P Iterative Bounding LAO* Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence, (341-346)
  84. ACM
    López-Nores M, Blanco-Fernändez Y, Pazos-Arias J and García-Duque J Exploring synergies between digital tv recommender systems and electronic health records Proceedings of the 8th European Conference on Interactive TV and Video, (127-136)
  85. Mekni M Hierarchical path planning for situated agents in informed virtual geographic environments Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques, (1-10)
  86. Kim D, Yun I and Lee S (2010). Attributed relational graph matching based on the nested assignment structure, Pattern Recognition, 43:3, (914-928), Online publication date: 1-Mar-2010.
  87. ACM
    Pfoser D, Efentakis A, Voisard A and Wenk C A new perspective on efficient and dependable vehicle routing Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, (388-391)
  88. Marinescu R and Dechter R (2009). Memory intensive AND/OR search for combinatorial optimization in graphical models, Artificial Intelligence, 173:16-17, (1492-1524), Online publication date: 1-Nov-2009.
  89. Marinescu R and Dechter R (2009). AND/OR Branch-and-Bound search for combinatorial optimization in graphical models, Artificial Intelligence, 173:16-17, (1457-1491), Online publication date: 1-Nov-2009.
  90. Brodt S, Bry F and Eisinger N Search for More Declarativity Proceedings of the 3rd International Conference on Web Reasoning and Rule Systems, (71-86)
  91. Lee J and Yu W A coarse-to-fine approach for fast path finding for mobile robots Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems, (5414-5419)
  92. McNaughton M and Urmson C FAHR Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems, (4893-4898)
  93. Dunn E, Berg J and Frahm J Developing visual sensing strategies through next best view planning Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems, (4001-4008)
  94. Suzuki Y, Thompson S and Kagami S High-speed planning and reducing memory usage of a precomputed search tree using pruning Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems, (3918-3923)
  95. Bromuri S, Urovi V and Stathis K (2009). Fast track article, Pervasive and Mobile Computing, 5:5, (623-638), Online publication date: 1-Oct-2009.
  96. van Otterlo M (2009). Intensional dynamic programming. A Rosetta stone for structured dynamic programming, Journal of Algorithms, 64:4, (169-191), Online publication date: 1-Oct-2009.
  97. Marinescu R Exploiting problem decomposition in multi-objective constraint optimization Proceedings of the 15th international conference on Principles and practice of constraint programming, (592-607)
  98. Bercher P and Mattmüller R Solving non-deterministic planning problems with pattern database heuristics Proceedings of the 32nd annual German conference on Advances in artificial intelligence, (57-64)
  99. Galuszka A Scoring functions of approximation of STRIPS planning by linear programming Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimization, (316-321)
  100. Galuszka A Moving containers in small terminal as STRIPS planning problem Proceedings of the 9th WSEAS international conference on Simulation, modelling and optimization, (248-253)
  101. Chunjiang Z, Huarui W and Chunjiang Z Research on the diagnosis method of crop pests and diseases based on the heuristic search Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 2, (349-356)
  102. Muggleton S, Santos J and Tamaddoni-Nezhad A ProGolem Proceedings of the 19th international conference on Inductive logic programming, (131-148)
  103. Basu S, Das N, Sarkar R, Kundu M, Nasipuri M and Basu D (2009). A hierarchical approach to recognition of handwritten Bangla characters, Pattern Recognition, 42:7, (1467-1484), Online publication date: 1-Jul-2009.
  104. Bonet B Deterministic POMDPs revisited Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, (59-66)
  105. Thakur M and Tripathi R (2009). Linear connectivity problems in directed hypergraphs, Theoretical Computer Science, 410:27-29, (2592-2618), Online publication date: 1-Jun-2009.
  106. Bidot J, Vidal T, Laborie P and Beck J (2009). A theoretic and practical framework for scheduling in a stochastic environment, Journal of Scheduling, 12:3, (315-344), Online publication date: 1-Jun-2009.
  107. Ota J (2009). Goal state optimization algorithm considering computational resource constraints and uncertainty in task execution time, Robotics and Autonomous Systems, 57:4, (403-410), Online publication date: 1-Apr-2009.
  108. Kim E, Sung C and Lee I (2009). Scheduling of parallel machines to minimize total completion time subject to s-precedence constraints, Computers and Operations Research, 36:3, (698-710), Online publication date: 1-Mar-2009.
  109. Bacchus F, Dalmao S and Pitassi T (2009). Solving #SAT and Bayesian inference with backtracking search, Journal of Artificial Intelligence Research, 34:1, (391-442), Online publication date: 1-Jan-2009.
  110. Meuleau N, Benazera E, Brafman R, Hansen E and Mausam (2009). A heuristic search approach to planning with continuous resources in stochastic domains, Journal of Artificial Intelligence Research, 34:1, (27-59), Online publication date: 1-Jan-2009.
  111. Grigori D, Corrales J and Bouzeghoub M (2008). Behavioral matchmaking for service retrieval, Information Systems, 33:7-8, (681-698), Online publication date: 1-Nov-2008.
  112. Wu J, Kalyanam R and Givan R Stochastic enforced hill-climbing Proceedings of the Eighteenth International Conference on International Conference on Automated Planning and Scheduling, (396-403)
  113. Li L and Onder N Generating plans in concurrent, probabilistic, over-subscribed domains Proceedings of the 23rd national conference on Artificial intelligence - Volume 2, (957-962)
  114. Bercher P and Mattmüller R A Planning Graph Heuristic for Forward-Chaining Adversarial Planning Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence, (921-922)
  115. Ho C Decoding of a block code by using list or listless algorithms Proceedings of the Eighth IASTED International Conference on Wireless and Optical Communications, (121-125)
  116. ACM
    Georgas J and Taylor R Policy-based self-adaptive architectures Proceedings of the 2008 international workshop on Software engineering for adaptive and self-managing systems, (105-112)
  117. Ross S, Pineau J, Paquet S and Chaib-draa B (2008). Online planning algorithms for POMDPs, Journal of Artificial Intelligence Research, 32:1, (663-704), Online publication date: 1-May-2008.
  118. Xiao Y, Wu W, Wang W and He Z Efficient algorithms for node disjoint subgraph homeomorphism determination Proceedings of the 13th international conference on Database systems for advanced applications, (452-460)
  119. Czyzowicz J, Fraczak W and Yazdani M (2008). Computing the throughput of Concatenation State Machines, Journal of Discrete Algorithms, 6:1, (28-36), Online publication date: 1-Mar-2008.
  120. Mancini T and Cadoli M (2007). Exploiting functional dependencies in declarative problem specifications, Artificial Intelligence, 171:16-17, (985-1010), Online publication date: 1-Nov-2007.
  121. Edelkamp S, Jabbar S and Bonet B External memory value iteration Proceedings of the Seventeenth International Conference on International Conference on Automated Planning and Scheduling, (128-135)
  122. Bayoudh S, Mouchère H, Miclet L and Anquetil E Learning a Classifier with Very Few Examples Proceedings of the 18th European conference on Machine Learning, (527-534)
  123. ACM
    Das D, Chakrabarti P and Kumar R (2007). Functional verification of task partitioning for multiprocessor embedded systems, ACM Transactions on Design Automation of Electronic Systems, 12:4, (44-es), Online publication date: 1-Sep-2007.
  124. Freund R and Oswald M (2007). Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode, Fundamenta Informaticae, 76:3, (305-323), Online publication date: 1-Aug-2007.
  125. ACM
    Abeysinghe S, Ju T, Chiu W and Baker M Shape modeling and matching in identifying protein structure from low-resolution images Proceedings of the 2007 ACM symposium on Solid and physical modeling, (223-232)
  126. ACM
    Sibai F (2007). Performance analysis and workload characterization of the 3DMark05 benchmark on modern parallel computer platforms, ACM SIGARCH Computer Architecture News, 35:3, (44-52), Online publication date: 1-Jun-2007.
  127. Wang J, Xu X and Chen J An approximation algorithm based on chain implication for constrained minimum vertex covers in bipartite graphs Proceedings of the 4th international conference on Theory and applications of models of computation, (760-769)
  128. Felzenszwalb P and McAllester D (2007). The generalized A* architecture, Journal of Artificial Intelligence Research, 29:1, (153-190), Online publication date: 1-May-2007.
  129. Freund R and Oswald M (2007). Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode, Fundamenta Informaticae, 76:3, (305-323), Online publication date: 1-Mar-2007.
  130. Ross S and Chaib-Draa B AEMS Proceedings of the 20th international joint conference on Artifical intelligence, (2592-2598)
  131. Meuleau N and Brafman R Hierarchical heuristic forward search in Stochastic domains Proceedings of the 20th international joint conference on Artifical intelligence, (2542-2549)
  132. Ruml W and Do M Best-first utility-guided search Proceedings of the 20th international joint conference on Artifical intelligence, (2378-2384)
  133. Bryce D and Kim S Planning for gene regulatory network intervention Proceedings of the 20th international joint conference on Artifical intelligence, (1834-1839)
  134. Schmidhuber J 2006 50 years of artificial intelligence, (29-41)
  135. ACM
    Yan X, Zhu F, Yu P and Han J (2006). Feature-based similarity search in graph structures, ACM Transactions on Database Systems, 31:4, (1418-1453), Online publication date: 1-Dec-2006.
  136. Le Saux B and Bunke H Combining SVM and graph matching in a bayesian multiple classifier system for image content recognition Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition, (696-704)
  137. Zhong Y Knowledge theory and artificial intelligence Proceedings of the First international conference on Rough Sets and Knowledge Technology, (50-56)
  138. Zhong Y and Ren F Mechanism approach to artificial intelligence and emotion research Proceedings of the 10th WSEAS international conference on Computers, (791-797)
  139. Nazarova I (2006). Models and methods for solving the problem of network vulnerability, Journal of Computer and Systems Sciences International, 45:4, (567-578), Online publication date: 1-Jul-2006.
  140. Plamondon P, Chaib-draa B and Benaskeur A An efficient resource allocation approach in real-time stochastic environment Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence, (49-60)
  141. Bonet B and Geffner H Learning depth-first search Proceedings of the Sixteenth International Conference on International Conference on Automated Planning and Scheduling, (142-151)
  142. Zou A, Hou Z, Fu S and Tan M Neural networks for mobile robot navigation Proceedings of the Third international conference on Advnaces in Neural Networks - Volume Part II, (1218-1226)
  143. Sakellariou G and Shanahan M Leaf classification using navigation-based skeletons Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy, (859-860)
  144. ACM
    van Veelen J SMDS Proceedings of the 2006 international workshop on Self-adaptation and self-managing systems, (58-64)
  145. Bryce D, Kambhampati S and Smith D (2006). Planning graph heuristics for belief space search, Journal of Artificial Intelligence Research, 26:1, (35-99), Online publication date: 1-May-2006.
  146. Bernard M, Richard N and Paquereau J Time frequency representation for complex analysis of the multidimensionality problem of cognitive task Proceedings of the 1st first visual information expert conference on Pixelization paradigm, (227-239)
  147. Duan Z, Jiang Y and Cai Z Intelligent tutorial planning based on extended knowledge structure graph Proceedings of the First international conference on Technologies for E-Learning and Digital Entertainment, (7-16)
  148. Bošnački D, Leue S and Lafuente A Partial-Order reduction for general state exploring algorithms Proceedings of the 13th international conference on Model Checking Software, (271-287)
  149. Qian K and Nymeyer A (2006). Language-Emptiness Checking of Alternating Tree Automata Using Symbolic Reachability Analysis, Electronic Notes in Theoretical Computer Science (ENTCS), 149:2, (33-49), Online publication date: 1-Feb-2006.
  150. Özkohen A and Yolum P Predicting exceptions in agent-based supply-chains Proceedings of the 6th international conference on Engineering Societies in the Agents World, (168-183)
  151. de Medeiros A, Schwabe D and Feijó B Kuaba ontology Proceedings of the 24th international conference on Conceptual Modeling, (241-255)
  152. Sierra M and Varela R Optimal scheduling with heuristic best first search Proceedings of the 9th conference on Advances in Artificial Intelligence, (173-176)
  153. Lu Q, George B and Shekhar S Capacity constrained routing algorithms for evacuation planning Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases, (291-307)
  154. ACM
    Arnt A and Zilberstein S Learning policies for sequential time and cost sensitive classification Proceedings of the 1st international workshop on Utility-based data mining, (39-45)
  155. Paritosh P and Forbus K Analysis of strategic knowledge in back of the envelope reasoning Proceedings of the 20th national conference on Artificial intelligence - Volume 2, (651-656)
  156. Bayer-Zubek V and Dietterich T (2005). Integrating learning from examples into the search for diagnostic policies, Journal of Artificial Intelligence Research, 24:1, (263-303), Online publication date: 1-Jul-2005.
  157. ACM
    Yan X, Yu P and Han J Substructure similarity search in graph databases Proceedings of the 2005 ACM SIGMOD international conference on Management of data, (766-777)
  158. Zhuge H Soft-device inheritance in the knowledge grid Proceedings of the 2005 international conference on Autonomous Intelligent Systems: agents and Data Mining, (62-78)
  159. Silver D Cooperative pathfinding Proceedings of the First AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, (117-122)
  160. Al-Ayyoub A (2005). Distributed Unidirectional and Bidirectional Heuristic Search, The Journal of Supercomputing, 32:3, (231-250), Online publication date: 1-Jun-2005.
  161. Bartlett M, Frisch A, Hamadi Y, Miguel I, Tarim S and Unsworth C The temporal knapsack problem and its solution Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, (34-48)
  162. Al-Ayyoub A (2005). Performance evaluation of parallel iterative deepening A* on clusters of workstations, Performance Evaluation, 60:1-4, (223-236), Online publication date: 1-May-2005.
  163. Yang X, Li C, Yu G and Shi L XGuard Proceedings of the 21st International Conference on Data Engineering, (1124-1125)
  164. ACM
    Westra J and Groeneveld P Is probabilistic congestion estimation worthwhile? Proceedings of the 2005 international workshop on System level interconnect prediction, (99-106)
  165. Gupta H and Mumick I (2005). Selection of Views to Materialize in a Data Warehouse, IEEE Transactions on Knowledge and Data Engineering, 17:1, (24-43), Online publication date: 1-Jan-2005.
  166. Thakur M and Tripathi R Complexity of linear connectivity problems in directed hypergraphs Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science, (481-493)
  167. ACM
    Kim D, Yun I and Lee S A comparative study on attributed relational gra matching algorithms for perceptual 3-D shape descriptor in MPEG-7 Proceedings of the 12th annual ACM international conference on Multimedia, (700-707)
  168. P. Cordella L, Foggia P, Sansone C and Vento M (2004). A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs, IEEE Transactions on Pattern Analysis and Machine Intelligence, 26:10, (1367-1372), Online publication date: 1-Oct-2004.
  169. Zamani R (2004). An Effective Near-Optimal State-Space Search Method, Artificial Intelligence Review, 22:1, (41-69), Online publication date: 1-Sep-2004.
  170. Yang X and Li C Secure XML publishing without information leakage in the presence of data inference Proceedings of the Thirtieth international conference on Very large data bases - Volume 30, (96-107)
  171. Edelkamp S, Leue S and Lluch-Lafuente A (2004). Partial-order reduction and trail improvement in directed model checking, International Journal on Software Tools for Technology Transfer (STTT), 6:4, (277-301), Online publication date: 1-Aug-2004.
  172. Bayer-Zubek V Learning diagnostic policies from examples by systematic search Proceedings of the 20th conference on Uncertainty in artificial intelligence, (27-34)
  173. Liu C, Jaeger S and Nakagawa M (2004). Online Recognition of Chinese Characters, IEEE Transactions on Pattern Analysis and Machine Intelligence, 26:2, (198-213), Online publication date: 1-Jan-2004.
  174. Martín M and Geffner H (2004). Learning Generalized Policies from Planning Examples Using Concept Languages, Applied Intelligence, 20:1, (9-19), Online publication date: 1-Jan-2004.
  175. ACM
    Ning P and Xu D Learning attack strategies from intrusion alerts Proceedings of the 10th ACM conference on Computer and communications security, (200-209)
  176. Mirolo C and Pagello E (2003). A New Cell-subdivision Approach to Plan Free Translations in Cluttered Environments, Journal of Intelligent and Robotic Systems, 38:1, (5-30), Online publication date: 1-Sep-2003.
  177. ACM
    Rosencrantz M, Gordon G and Thrun S Locating moving entities in indoor environments with teams of mobile robots Proceedings of the second international joint conference on Autonomous agents and multiagent systems, (233-240)
  178. ACM
    Stroe B and Subrahmanian V First order heterogeneous agent computations Proceedings of the second international joint conference on Autonomous agents and multiagent systems, (217-224)
  179. ACM
    De Raedt L and Kersting K (2003). Probabilistic logic learning, ACM SIGKDD Explorations Newsletter, 5:1, (31-48), Online publication date: 1-Jul-2003.
  180. Majercik S and Littman M (2003). Contingent planning under uncertainty via stochastic satisfiability, Artificial Intelligence, 147:1-2, (119-162), Online publication date: 1-Jul-2003.
  181. Castellini C, Giunchiglia E and Tacchella A (2003). SAT-based planning in complex domains, Artificial Intelligence, 147:1-2, (85-117), Online publication date: 1-Jul-2003.
  182. Conte D, Guidobaldi C and Sansone C A comparison of three maximum common subgraph algorithms on a large database of labeled graphs Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition, (130-141)
  183. Bonet B and Geffner H Labeled RTDP Proceedings of the Thirteenth International Conference on International Conference on Automated Planning and Scheduling, (12-21)
  184. Adalı S and Pigaty L (2003). The DARPA Advanced Logistics Project, Annals of Mathematics and Artificial Intelligence, 37:4, (409-452), Online publication date: 1-Apr-2003.
  185. Hadad M, Kraus S, Gal Y and Lin R (2003). Temporal Reasoning for a Collaborative Planning Agent in a Dynamic Environment, Annals of Mathematics and Artificial Intelligence, 37:4, (331-379), Online publication date: 1-Apr-2003.
  186. Liu C, Koga M and Fujisawa H (2002). Lexicon-Driven Segmentation and Recognition of Handwritten Character Strings for Japanese Address Reading, IEEE Transactions on Pattern Analysis and Machine Intelligence, 24:11, (1425-1437), Online publication date: 1-Nov-2002.
  187. Trovato K and Dorst L (2002). Differential A*, IEEE Transactions on Knowledge and Data Engineering, 14:6, (1218-1229), Online publication date: 1-Nov-2002.
  188. Crowley J, Coutaz J, Rey G and Reignier P Perceptual Components for Context Aware Computing Proceedings of the 4th international conference on Ubiquitous Computing, (117-134)
  189. Hwang E, Prabhakaran B and Subrahmanian V (2002). Presentation Planning for Distributed VoD Systems, IEEE Transactions on Knowledge and Data Engineering, 14:5, (1059-1077), Online publication date: 1-Sep-2002.
  190. Ratschan S (2002). Search Heuristics for Box Decomposition Methods, Journal of Global Optimization, 24:1, (35-49), Online publication date: 1-Sep-2002.
  191. ACM
    Federico M and Bertoldi N Statistical cross-language information retrieval using n-best query translations Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, (167-174)
  192. Geffner H Perspectives on artificial intelligence planning Eighteenth national conference on Artificial intelligence, (1013-1023)
  193. ACM
    Shasha D, Wang J and Giugno R Algorithmics and applications of tree and graph searching Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, (39-52)
  194. Khalil M, Robach C and Novak F (2002). Diagnosis Strategies for Hardware or Software Systems, Journal of Electronic Testing: Theory and Applications, 18:2, (241-251), Online publication date: 1-Apr-2002.
  195. Dasgupta P, Chakrabarti P, Dey A, Ghose S and Bibel W (2002). Solving Constraint Optimization Problems from CLP-Style Specifications Using Heuristic Search Techniques, IEEE Transactions on Knowledge and Data Engineering, 14:2, (353-368), Online publication date: 1-Mar-2002.
  196. Raphael C (2001). Coarse-to-Fine Dynamic Programming, IEEE Transactions on Pattern Analysis and Machine Intelligence, 23:12, (1379-1390), Online publication date: 1-Dec-2001.
  197. Yu T (2001). Hierarchical Processing for Evolving Recursive and Modular Programs Using Higher-Order Functions and Lambda Abstraction, Genetic Programming and Evolvable Machines, 2:4, (345-380), Online publication date: 1-Dec-2001.
  198. Fensel D and Motta E (2001). Structured Development of Problem Solving Methods, IEEE Transactions on Knowledge and Data Engineering, 13:6, (913-932), Online publication date: 1-Nov-2001.
  199. Lin F (2001). A Planner Called R, AI Magazine, 22:3, (73-76), Online publication date: 1-Sep-2001.
  200. Kijsirikul B, Sinthupinyo S and Chongkasemwongse K (2001). Approximate Match of Rules Using Backpropagation Neural Networks, Machine Language, 44:3, (273-299), Online publication date: 1-Sep-2001.
  201. Bonet B and Geffner H (2001). Planning and Control in Artificial Intelligence, Applied Intelligence, 14:3, (237-252), Online publication date: 9-May-2001.
  202. ACM
    Xing Z and Kao R A minimum cost path search algorithm through tile obstacles Proceedings of the 2001 international symposium on Physical design, (192-197)
  203. Barnicki S and Siirola J Systematic chemical process synthesis Formal engineering design synthesis, (362-390)
  204. Haddon J and Boyce J Adaptive dynamic scene analysis Imaging and vision systems, (207-234)
  205. ACM
    Shibuya T (2000). Computing the nxm shortest path efficiently, ACM Journal of Experimental Algorithmics, 5, (9-es), Online publication date: 31-Dec-2001.
  206. Geffner H Functional strips Logic-based artificial intelligence, (187-209)
  207. Minker J Introduction to logic-based artificial intelligence Logic-based artificial intelligence, (3-33)
  208. Cavazza M (2000). Al in computer games, Virtual Reality, 5:4, (223-235), Online publication date: 1-Dec-2000.
  209. Hamidzadeh B, Kit L and Lilja D (2000). Dynamic Task Scheduling Using Online Optimization, IEEE Transactions on Parallel and Distributed Systems, 11:11, (1151-1163), Online publication date: 1-Nov-2000.
  210. Sakuta M and Iida H Solving Kriegspiel-Like Problems Revised Papers from the Second International Conference on Computers and Games, (55-73)
  211. Mitra S, Avra L and McCluskey E (2000). Efficient Multiplexer Synthesis Techniques, IEEE Design & Test, 17:4, (90-97), Online publication date: 1-Oct-2000.
  212. Long D, Kautz H, Selman B, Bonet B, Geffner H, Koehler J, Brenner M, Hoffmann J, Rittinger F, Anderson C, Weld D, Smith D, Fox M and Long D (2000). The AIPS‐98 Planning Competition, AI Magazine, 21:2, (13-34), Online publication date: 1-Jun-2000.
  213. Rubinoff R (2000). Integrating text planning and linguistic choice without abandoning modularity, Computational Linguistics, 26:2, (107-138), Online publication date: 1-Jun-2000.
  214. Nourani C Intelligent Heterogeneous Multimedia and Intelligent Active Visual DB and KB Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
  215. Wang Y, Desmedt Y and Burmester M (2000). Models For Dependable Computation with Multiple Inputs and Some Hardness Results, Fundamenta Informaticae, 42:1, (61-73), Online publication date: 1-Jan-2000.
  216. Farreny H (1999). Completeness and Admissibility for General Heuristic Search Algorithms—A Theoretical Study, Journal of Heuristics, 5:3, (353-376), Online publication date: 1-Oct-1999.
  217. Prabhakaran B (1999). Collaborative Multimedia Presentations in Mobile Environments, Multimedia Tools and Applications, 9:1, (95-109), Online publication date: 1-Jul-1999.
  218. ACM
    Han J and Han I Manufacturable feature recognition and its integration with process planning Proceedings of the fifth ACM symposium on Solid modeling and applications, (108-118)
  219. ACM
    Clement B and Durfee E Top-down search for coordinating the hierarchical plans of multiple agents Proceedings of the third annual conference on Autonomous Agents, (252-259)
  220. Srinivasan A (1999). A Study of Two Sampling Methods for Analyzing Large Datasets with ILP, Data Mining and Knowledge Discovery, 3:1, (95-123), Online publication date: 1-Mar-1999.
  221. Herrero J and Mira J (1999). SCHEMA, Applied Intelligence, 10:2-3, (139-153), Online publication date: 1-Mar-1999.
  222. Renton P, Greenspan M, Elmaraghy H and Zghal H (1999). Plan-N-Scan, Journal of Intelligent and Robotic Systems, 24:3, (207-234), Online publication date: 1-Mar-1999.
  223. ACM
    Dunning L and Ramakrishnan S A heuristic cost estimation method for optimizing assignment of tasks to processors Proceedings of the 1999 ACM symposium on Applied computing, (358-364)
  224. Gu J, Gu Q and Du D (1999). On optimizing the satisfiability (SAT) problem, Journal of Computer Science and Technology, 14:1, (1-17), Online publication date: 1-Jan-1999.
  225. van Lamsweerde A and Willemet L (1998). Inferring Declarative Requirements Specifications from Operational Scenarios, IEEE Transactions on Software Engineering, 24:12, (1089-1114), Online publication date: 1-Dec-1998.
  226. A. Hearst M (1998). Information Integration, IEEE Intelligent Systems, 13:5, (12-24), Online publication date: 1-Sep-1998.
  227. Chien Y, Hudli A and Palakal M (1998). Using Many-Sorted Logic in the Object-Oriented Data Model for Fast Robot Task Planning, Journal of Intelligent and Robotic Systems, 23:1, (1-25), Online publication date: 1-Sep-1998.
  228. Sarkar S, Chakrabarti P and Ghose S (1998). A Framework for Learning in Search-Based Systems, IEEE Transactions on Knowledge and Data Engineering, 10:4, (563-575), Online publication date: 1-Jul-1998.
  229. ACM
    Cohen W (1998). Integration of heterogeneous databases without common domains using queries based on textual similarity, ACM SIGMOD Record, 27:2, (201-212), Online publication date: 1-Jun-1998.
  230. ACM
    Cohen W Integration of heterogeneous databases without common domains using queries based on textual similarity Proceedings of the 1998 ACM SIGMOD international conference on Management of data, (201-212)
  231. Schenk K, Vitalari N and Davis K (1998). Differences between novice and expert systems analysts, Journal of Management Information Systems, 15:1, (9-50), Online publication date: 1-Jun-1998.
  232. ACM
    Liu L, Tseng H and Sechen C Chip-level area routing Proceedings of the 1998 international symposium on Physical design, (197-204)
  233. Finn P, Muggleton S, Page D and Srinivasan A (1998). Pharmacophore Discovery Using the Inductive Logic Programming System PROGOL, Machine Language, 30:2-3, (241-270), Online publication date: 1-Feb-1998.
  234. Fribourg L and Olsén H (1998). A Decompositional Approach for Computing Least Fixed-Pointsof Datalog Programs with Z-Counters, Constraints, 2:3/4, (305-335), Online publication date: 1-Jan-1998.
  235. ACM
    Kato S, Seki H and Itoh H A parallel implementation of cost-based abductive reasoning Proceedings of the second international symposium on Parallel symbolic computation, (111-118)
  236. Wang Y and Waibel A Decoding algorithm in statistical machine translation Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics, (366-372)
  237. ACM
    Nicholson A and Fraser K Methodologies for teaching new programming languages Proceedings of the 2nd Australasian conference on Computer science education, (84-90)
  238. Kambhampati S (1997). Refinement Planning as a Unifying Framework for Plan Synthesis, AI Magazine, 18:2, (67-97), Online publication date: 1-Jun-1997.
  239. Rosenwald G and Liu C (1997). Rule-Based System Validation through Automatic Identification of Equivalence Classes, IEEE Transactions on Knowledge and Data Engineering, 9:1, (24-31), Online publication date: 1-Jan-1997.
  240. ACM
    Gasarch W, Kelly W and Pugh W (1996). Finding the ith largest of n for small i,n, ACM SIGACT News, 27:2, (88-96), Online publication date: 1-Jul-1996.
  241. Jung D, Krishnamoorthy M, Nagy G and Shapira A (1996). N-Tuple Features for OCR Revisited, IEEE Transactions on Pattern Analysis and Machine Intelligence, 18:7, (734-745), Online publication date: 1-Jul-1996.
  242. Gu J, Gu Q and Du D (1996). Convergence Properties of Optimization Algorithms for the SAT Problem, IEEE Transactions on Computers, 45:2, (209-218), Online publication date: 1-Feb-1996.
  243. Oommen B and de St. Croix E (1996). Graph Partitioning Using Learning Automata, IEEE Transactions on Computers, 45:2, (195-208), Online publication date: 1-Feb-1996.
  244. Wang P and Weihl W (1996). Scalable Concurrent B-Trees Using Multi-Version Memory, Journal of Parallel and Distributed Computing, 32:1, (28-48), Online publication date: 10-Jan-1996.
  245. Lee J, Lee K, Hong J, Kim W, Kim E, Choi S, Kim H, Yang O and Choi H (1995). DAS, AI Magazine, 16:4, (78-94), Online publication date: 1-Dec-1995.
  246. Muggleton S (1995). Inverse entailment and progol, New Generation Computing, 13:3-4, (245-286), Online publication date: 1-Dec-1995.
  247. ACM
    Mortensen E and Barrett W Intelligent scissors for image composition Proceedings of the 22nd annual conference on Computer graphics and interactive techniques, (191-198)
  248. Bhatnagar R (1995). Context Hypothesization Using Probabilistic Knowledge, Fundamenta Informaticae, 23:2,3,4, (225-246), Online publication date: 1-Aug-1995.
  249. Weld D (1994). An Introduction to Least Commitment Planning, AI Magazine, 15:4, (27-61), Online publication date: 1-Dec-1994.
  250. Honiden S, Nishimura K, Uchihira N and Itoh K (1994). An Application of Artificial Intelligence to Object-Oriented Performance Design for Real-Time Systems, IEEE Transactions on Software Engineering, 20:11, (849-867), Online publication date: 1-Nov-1994.
  251. Güting R GraphDB Proceedings of the 20th International Conference on Very Large Data Bases, (297-308)
  252. Musliner D Using abstraction and nondeterminism to plan reaction loops Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (1036-1041)
  253. Katukam S and Kambhampati S Learning explanation-based search control rules for partial order planning Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence, (582-587)
  254. Pimentel S and Brem L Robust planning in uncertain environments Proceedings of the Tenth international conference on Uncertainty in artificial intelligence, (463-469)
  255. Bhatnagar R Exploratory model building Proceedings of the Tenth international conference on Uncertainty in artificial intelligence, (77-85)
  256. Zukerman I and McConachy R Discourse planning as an optimization process Proceedings of the Seventh International Workshop on Natural Language Generation, (37-44)
  257. ACM
    Stuart B (1994). Connect 4 as a problem in artificial intelligence and robotics, ACM SIGCSE Bulletin, 26:2, (41-46), Online publication date: 1-Jun-1994.
  258. ACM
    Stilman B A linguistic geometry for technology transfer Proceedings of the 1994 ACM symposium on Applied computing, (281-285)
  259. Krozel J (1994). Intelligent Path Prediction for Vehicular Travel, AI Magazine, 15:1, (67-68), Online publication date: 1-Mar-1994.
  260. Mast M, Kummert F, Ehrlich U, Fink G, Kuhn T, Niemann H and Sagerer G (1994). A Speech Understanding and Dialog System with a Homogeneous Linguistic Knowledge Base, IEEE Transactions on Pattern Analysis and Machine Intelligence, 16:2, (179-194), Online publication date: 1-Feb-1994.
  261. ACM
    Anderson M A dynamic knowledge based approach to the problem of deduction on a non-statistical multilevel secure database Proceedings of the second international conference on Information and knowledge management, (154-163)
  262. ACM
    Yu E and Mylopoulos J An actor dependency model of organizational work Proceedings of the conference on Organizational computing systems, (258-268)
  263. Basaran B, Rutenbar R and Carley L Latchup-aware placement and parasitic-bounded routing of custom analog cells Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, (415-421)
  264. Barraquand J and Latombe J (1993). Nonholonomic multibody mobile robots, Algorithmica, 10:2-4, (121-155), Online publication date: 1-Oct-1993.
  265. Reinefeld A Complete solution of the eight-puzzle and the benefit of node ordering in IDA Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1, (248-253)
  266. (1993). Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems, Operations Research, 41:4, (768-776), Online publication date: 1-Aug-1993.
  267. ACM
    Rissland E, Skalak D and Friedman M BankXX Proceedings of the 4th international conference on Artificial intelligence and law, (117-124)
  268. Prieditis A and Janakiraman B Generating effective admissible heuristics by abstraction and reconstitution Proceedings of the eleventh national conference on Artificial intelligence, (743-748)
  269. Polat F and Guvenir H (1993). UVT, IEEE Expert: Intelligent Systems and Their Applications, 8:3, (69-75), Online publication date: 1-Jun-1993.
  270. ACM
    Sukaviriya P, Foley J and Griffith T A second generation user interface design environment Proceedings of the INTERACT '93 and CHI '93 Conference on Human Factors in Computing Systems, (375-382)
  271. Chaudhury A, Marinescu D and Whinston A (1993). Net-Based Computational Models of Knowledge-Processing Systems, IEEE Expert: Intelligent Systems and Their Applications, 8:2, (79-86), Online publication date: 1-Apr-1993.
  272. Gat E (1993). On the Role of Stored Internal State in the Control of Autonomous Mobile Robots, AI Magazine, 14:1, (64-73), Online publication date: 1-Mar-1993.
  273. ACM
    Ramakrishnan S, Dunning L and Nitsch T An integrated optimal task assignment policy Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (789-795)
  274. ACM
    Veezhinathan J, Kemp F and Threet J A hybrid of neural net and branch and bound techniques for seismic horizon tracking Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (173-178)
  275. ACM
    Quast K Plan recognition for context sensitive help Proceedings of the 1st international conference on Intelligent user interfaces, (89-96)
  276. ACM
    Banâtre J and Le Métayer D (1993). Programming by multiset transformation, Communications of the ACM, 36:1, (98-111), Online publication date: 1-Jan-1993.
  277. Karypis G and Kumar V Unstructured tree search on SIMD parallel computers Proceedings of the 1992 ACM/IEEE conference on Supercomputing, (453-462)
  278. Mitchell J (1992). L1 shortest paths among polygonal obstacles in the plane, Algorithmica, 8:1-6, (55-88), Online publication date: 1-Dec-1992.
  279. Chen M and Yu P (1992). Interleaving a Join Sequence with Semijoins in Distributed Query Processing, IEEE Transactions on Parallel and Distributed Systems, 3:5, (611-621), Online publication date: 1-Sep-1992.
  280. ACM
    Russo M A combined symbolic/numeric approach for the integration of stiff nonlinear systems of ODE's Papers from the international symposium on Symbolic and algebraic computation, (80-88)
  281. Regan P and Holtzman S R&D analyst Proceedings of the Eighth international conference on Uncertainty in artificial intelligence, (259-267)
  282. Greiner R and Jurišica I A statistical approach to solving the EBL utility problem Proceedings of the tenth national conference on Artificial intelligence, (241-248)
  283. Palczewski M Plane parallel a maze router and its application to FPGAs Proceedings of the 29th ACM/IEEE Design Automation Conference, (691-697)
  284. ACM
    Greiner R Learning efficient query processing strategies Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, (33-46)
  285. ACM
    Garg P and Bhansali S Process programming by hindsight Proceedings of the 14th international conference on Software engineering, (280-293)
  286. ACM
    Becker L and Güting R (1992). Rule-based optimization and query processing in an extensible geometric database system, ACM Transactions on Database Systems, 17:2, (247-303), Online publication date: 1-Jun-1992.
  287. Catsimpoolas N and Marti J Scripting highly autonomous simulation behavior using case-based reasoning Proceedings of the 25th annual symposium on Simulation, (13-19)
  288. Kenny P, Hollan R, Boulianne G, Garudadri H, Lennig M and O'Shaughnessy D An A* algorithm for very large vocabulary continuous speech recognition Proceedings of the workshop on Speech and Natural Language, (333-338)
  289. Dickinson S, Pentland A and Rosenfeld A (1992). 3-D Shape Recovery Using Distributed Aspect Matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, 14:2, (174-198), Online publication date: 1-Feb-1992.
  290. ACM
    Gu J (1992). Efficient local search for very large-scale satisfiability problems, ACM SIGART Bulletin, 3:1, (8-12), Online publication date: 1-Jan-1992.
  291. Frincke D, Archer M and Levitt K CTPLAN Proceedings of the 6th International Conference on Knowledge-Based Software Engineering, (151-160)
  292. ACM
    Kaindl H and Snaprud M Hypertext and structured object representation Proceedings of the third annual ACM conference on Hypertext, (345-358)
  293. Shin D and Irani K (1991). Fragmenting Relations Horizontally Using a Knowledge-Based Approach, IEEE Transactions on Software Engineering, 17:9, (872-883), Online publication date: 1-Sep-1991.
  294. ACM
    Rodohan D and Glover R (1991). An overview of the A architecture for optimisation problems in a logic programming environment, ACM SIGARCH Computer Architecture News, 19:4, (124-131), Online publication date: 1-Jul-1991.
  295. ACM
    Hoebel L (1991). Book review: Readings in Planning Edited by James Allen, James Hendler, and Austin Tate (Morgan Kaufmann, San Mateo, CA, 1990), ACM SIGART Bulletin, 2:4, (185-186), Online publication date: 1-Jul-1991.
  296. Ishida T (1991). Parallel Rule Firing in Production Systems, IEEE Transactions on Knowledge and Data Engineering, 3:1, (11-17), Online publication date: 1-Mar-1991.
  297. Basnet C, Farrington P, Pratt D, Kamath M, Karacal S and Beaumariage T Experiences in developing in object-oriented modeling environment for manufacturing systems Proceedings of the 22nd conference on Winter simulation, (477-481)
  298. Franke D (1990). Imbedding Rule Inferencing in Applications, IEEE Expert: Intelligent Systems and Their Applications, 5:6, (8-14), Online publication date: 1-Dec-1990.
  299. ACM
    Sukaviriya P and Foley J Coupling a UI framework with automatic generation of context-sensitive animated help Proceedings of the 3rd annual ACM SIGGRAPH symposium on User interface software and technology, (152-166)
  300. Lennig M, Gupta V, Kenny P, Mermelstein P and O'Shaughnessy D An 86,000-word recognizer based on phonemic models Proceedings of the workshop on Speech and Natural Language, (391-396)
  301. Pieraccini R, Lee C, Giachin E and Rabiner L Implementation aspects of large vocabulary recognition based on intraword and interword phonetic units Proceedings of the workshop on Speech and Natural Language, (311-318)
  302. Chitrao M and Grishman R Statistical parsing of messages Proceedings of the workshop on Speech and Natural Language, (263-266)
  303. Kwee T (1990). Review of "Natural language processing in LISP, Computational Linguistics, 16:2, (116-120), Online publication date: 1-Jun-1990.
  304. ACM
    Sarma D and Wu C Pipelined OR-parallelism architecture for parallel execution of Prolog Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2, (864-873)
  305. ACM
    Chang K and Day W Adaptive multiagent planning in a distributed environment Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2, (828-837)
  306. ACM
    Zhao S and Shen S The consistency problem of knowledge bases Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2, (745-750)
  307. ACM
    Chen H and Chen K A model-directed image understanding system for computer vision Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1, (191-195)
  308. ACM
    You I, Chu C and Kashyap R Knowledge representation and control structure based on three-dimensional symbolic skeletons for CAD/CAM integration Proceedings of the 3rd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1, (357-364)
  309. Sellis T and Ghosh S (1990). On the Multiple-Query Optimization Problem, IEEE Transactions on Knowledge and Data Engineering, 2:2, (262-266), Online publication date: 1-Jun-1990.
  310. ACM
    Osborne R Speculative computation in multilisp Proceedings of the 1990 ACM conference on LISP and functional programming, (198-208)
  311. Wu J Automatic knowledge acquisition in a digital circuit design system Proceedings of the conference on European design automation, (180-184)
  312. ACM
    Wang J, Dobbs V and Davis H Using focusing search algorithms and a strong heuristic to solve the findpath problem in robotics Proceedings of the 1990 ACM annual conference on Cooperation, (63-69)
  313. Shin K and Chen M (1990). On the Number of Acceptable Task Assignments in Distributed Computing Systems, IEEE Transactions on Computers, 39:1, (99-110), Online publication date: 1-Jan-1990.
  314. ACM
    Yue K (1989). Using the game cube-4 as an example in an introductory artificial intelligence course, ACM SIGCSE Bulletin, 21:3, (8-10), Online publication date: 1-Sep-1989.
  315. Mostow J and Prieditis A Discovering admissible heuristics by abstracting and optimizing Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1, (701-707)
  316. ACM
    Evett M, Spector L and Hendler J Knowledge representation on the connection machine Proceedings of the 1989 ACM/IEEE conference on Supercomputing, (283-293)
  317. ACM
    Beusmans J and Wieckert K (1989). Computing, research, and war: if knowledge is power, where is responsibility?, Communications of the ACM, 32:8, (939-951), Online publication date: 1-Aug-1989.
  318. Hulin G Parallel processing of recursive queries in distributed architectures Proceedings of the 15th international conference on Very large data bases, (87-96)
  319. Güting R Gral: an extensible relational database system for geometric applications Proceedings of the 15th international conference on Very large data bases, (33-44)
  320. ACM
    Lizotte M and Moulin B SAIRVO: a temporal planning system Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1, (382-392)
  321. ACM
    Laurent J, Lanusse A and Panet B Distributed artificial intelligence: a necessary paradigm for supervising production management activities Proceedings of the 2nd international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1, (326-335)
  322. ACM
    Schlobohm D and McCarty L EPS II: estate planning with prototypes Proceedings of the 2nd international conference on Artificial intelligence and law, (1-10)
  323. Pinkowski B A rule-based approach for simulation errors in discrete sequential processes Proceedings of the 22nd annual symposium on Simulation, (145-152)
  324. Peterka G and Murata T (1989). Proof Procedure and Answer Extraction in Petri Net Model of Logic Programs, IEEE Transactions on Software Engineering, 15:2, (209-217), Online publication date: 1-Feb-1989.
  325. ACM
    Lamont G and Shakley D Parallel expert system search techniques for a real-time application Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2, (1352-1359)
  326. (1988). An Expert System for Scheduling Satellite Supports, Interfaces, 18:6, (28-34), Online publication date: 1-Dec-1988.
  327. ACM
    Rozenblit J, Kim T and Zeigler B Towards an implementation of a knowledge-based system design and simulation environment Proceedings of the 20th conference on Winter simulation, (226-230)
  328. Young M and Taylor R (1988). Combining Static Concurrency Analysis with Symbolic Execution, IEEE Transactions on Software Engineering, 14:10, (1499-1511), Online publication date: 1-Oct-1988.
  329. Shekhar S, Srivastava J and Dutta S A Formal Model of Trade-off between Optimization and Execution Costs in Semantic Query Optimization Proceedings of the 14th International Conference on Very Large Data Bases, (457-467)
  330. Rosenthal A and Chakravarthy U Anatomy of a Mudular Multiple Query Optimizer Proceedings of the 14th International Conference on Very Large Data Bases, (230-239)
  331. Shimazu H, Takashima Y and Tomono M Understanding of stories for animation Proceedings of the 12th conference on Computational linguistics - Volume 2, (620-625)
  332. Swartout W (1988). DARPA Santa Cruz Workshop on Planning, AI Magazine, 9:2, (115-131), Online publication date: 1-Jun-1988.
  333. ACM
    Abbott R Resourceful systems and software fault tolerance Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 2, (992-1000)
  334. ACM
    Dobbs V, Davis H and Lizza C An application of heuristic search techniques to the problem of flight path generation in a military hostile environment Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1, (273-280)
  335. ACM
    Barthes C and Glize P Planning in an expert system for automated information retrieval Proceedings of the 11th annual international ACM SIGIR conference on Research and development in information retrieval, (535-550)
  336. ACM
    Harel D (1988). On visual formalisms, Communications of the ACM, 31:5, (514-530), Online publication date: 1-May-1988.
  337. ACM
    Mazer M (1988). Problems in modelling tasks and task views, ACM SIGOIS Bulletin, 9:2-3, (38-45), Online publication date: 1-Apr-1988.
  338. ACM
    Mazer M Problems in modelling tasks and task views Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems, (38-45)
  339. ACM
    Choi B and Lee D (1988). Book review: Parallel Execution of Logic Programs by John S. Conery (Kluwer Academic Publiishers 1987), ACM SIGART Bulletin:104, (14), Online publication date: 1-Apr-1988.
  340. Murata T and Zhang D (1988). A Predicate-Transition Net Model for Parallel Interpretation of Logic Programs, IEEE Transactions on Software Engineering, 14:4, (481-497), Online publication date: 1-Apr-1988.
  341. Newman P Combinatorial disambiguation Proceedings of the second conference on Applied natural language processing, (243-252)
  342. ACM
    Whitlock D, Dey P and Hyatt R A parallel best-first search Proceedings of the 1988 ACM sixteenth annual conference on Computer science
  343. ACM
    Srinivasan S, Dey P and Hayashi Y A flexible interactive control structure for rule-based systems Proceedings of the 1988 ACM sixteenth annual conference on Computer science, (447-453)
  344. ACM
    Chakrabarti P, Ghose S and DeSarkar S Best first search in and/or graphs Proceedings of the 1988 ACM sixteenth annual conference on Computer science, (256-261)
  345. ACM
    Kleyn M and Chakravarty I EDGE - a graph based tool for specifying interaction Proceedings of the 1st annual ACM SIGGRAPH symposium on User Interface Software, (1-14)
  346. ACM
    Kwa J (1988). On the consistency assumption, monotone criterion and the monotone restriction, ACM SIGART Bulletin:103, (29-31), Online publication date: 3-Jan-1988.
  347. ACM
    Walters M Expert systems development in LISP and Ada Proceedings of the 1987 annual ACM SIGAda international conference on Ada, (111-115)
  348. Park J and Teorey T A knowledge-based approach to multiple query processing in distributed database system Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow, (461-468)
  349. ACM
    Rozenblit J and Huang Y Constraint-driven generation of model structures Proceedings of the 19th conference on Winter simulation, (604-611)
  350. Crowley J Coordination of action and perception in a surveillance robot Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2, (793-796)
  351. Minton S and Carbonell J Strategies for learning search control rules Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1, (228-235)
  352. Kedar-Cabelli S Formulating concepts according to purpose Proceedings of the sixth National conference on Artificial intelligence - Volume 2, (477-481)
  353. ACM
    Brown J and Guerreiro R (1987). APL2 implementations of unification, ACM SIGAPL APL Quote Quad, 17:4, (216-225), Online publication date: 1-May-1987.
  354. Fordyce K, Norden P and Sullivan G (1987). Review of Expert Systems for the Management Science Practitioner, Interfaces, 17:2, (64-77), Online publication date: 1-Apr-1987.
  355. (1987). HEURISTICS, AI Magazine, 8:1, (81-99), Online publication date: 1-Mar-1987.
  356. ACM
    Kohli M, Giuliano M and Minker J (1987). An overview of the PRISM project, ACM SIGARCH Computer Architecture News, 15:1, (35-42), Online publication date: 1-Mar-1987.
  357. ACM
    Martin H and Seethoff T On optimal algorithms for solving bi-valued game trees Proceedings of the 15th annual conference on Computer Science, (254-260)
  358. ACM
    Mahanti A and Ray K Heuristic search in networks with modifiable estimate Proceedings of the 15th annual conference on Computer Science, (166-174)
  359. ACM
    Kautzmann F A methodology for multiple rule system integration and resolutions within a singular knowledge base Proceedings of the 15th annual conference on Computer Science, (16-26)
  360. ACM
    Brown J and Guerreiro R APL2 implementations of unification Proceedings of the international conference on APL: APL in transition, (216-225)
  361. ACM
    Brown J, Cook J, Groner L and Eusebi E Logic programming in APL2 Proceedings of the international conference on APL, (282-288)
  362. ACM
    Gold E (1986). Envoys in electronic mail systems, ACM SIGOIS Bulletin, 7:2-3, (2-10), Online publication date: 1-Dec-1986.
  363. ACM
    Gold E Envoys in electronic mail systems Proceedings of the third ACM-SIGOIS conference on Office information systems, (2-10)
  364. ACM
    Kundu S Tree resolution and generalized semantic tree Proceedings of the ACM SIGART international symposium on Methodologies for intelligent systems, (270-278)
  365. Miura H, Imai M, Yamashita M and Ibaraki T Implemention of parallel Prolog on tree machines Proceedings of 1986 ACM Fall joint computer conference, (287-296)
  366. Snyers D and Thayse A (1986). Algorithmic State Machine Design and Automatic Theorem Proving, IEEE Transactions on Computers, 35:10, (853-861), Online publication date: 1-Oct-1986.
  367. Fisher E (1986). An AI‐Based Methodology for Factory Design, AI Magazine, 7:4, (72-85), Online publication date: 1-Sep-1986.
  368. Tanaka H DCKR Proceedings of the 11th coference on Computational linguistics, (222-225)
  369. Birmingham W, Joobbani R and Kim J Knowlege-based expert systems and their application(tutorial session Proceedings of the 23rd ACM/IEEE Design Automation Conference, (531-539)
  370. ACM
    Brown J, Cook J, Groner L and Eusebi E (1986). Logic programming in APL2, ACM SIGAPL APL Quote Quad, 16:4, (282-288), Online publication date: 1-May-1986.
  371. ACM
    Quinn L and Russell D Intelligent interfaces: user models and planners Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, (314-320)
  372. ACM
    Quinn L and Russell D (1986). Intelligent interfaces: user models and planners, ACM SIGCHI Bulletin, 17:4, (314-320), Online publication date: 1-Apr-1986.
  373. Ahuja S and Reggia J Using abductive inferencing to derive complex error classifications for discrete sequential processes Proceedings of the 19th annual symposium on Simulation, (207-225)
  374. ACM
    Bagchi A and Sen A Heuristic search in general tree structures Proceedings of the 1986 ACM fourteenth annual conference on Computer science, (309-318)
  375. ACM
    Davis H, Pollack R and Golden D A technique for comparing search algorithm run-times Proceedings of the 1986 ACM fourteenth annual conference on Computer science, (301-308)
  376. ACM
    Woo N The architecture of the hardware unification unit and an implementation Proceedings of the 18th annual workshop on Microprogramming, (89-98)
  377. ACM
    Woo N (1985). The architecture of the hardware unification unit and an implementation, ACM SIGMICRO Newsletter, 16:4, (89-98), Online publication date: 1-Dec-1985.
  378. ACM
    Yasdi R Formal representation of a conceptual knowledge model for a database based expert system Proceedings of the twenty-first annual conference on Computer personnel research, (11-23)
  379. Hall R and Kibler D (1985). Differing Methodological Perspectives in Artificial Intelligence Research, AI Magazine, 6:3, (166-178), Online publication date: 1-Sep-1985.
  380. ACM
    Slagle J and Hamburger H (1985). An expert system for a resource allocation problem, Communications of the ACM, 28:9, (994-1004), Online publication date: 1-Sep-1985.
  381. ACM
    Ullman J (1985). Implementation of logical query languages for databases, ACM Transactions on Database Systems, 10:3, (289-321), Online publication date: 1-Sep-1985.
  382. Motteler H and Kanal L The complexity of searching several classes of AND/OR graphs Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2, (1083-1085)
  383. Tovey C (1985). Hill Climbing with Multiple Local Optima, SIAM Journal on Algebraic and Discrete Methods, 6:3, (384-393), Online publication date: 1-Jul-1985.
  384. ACM
    Defude B Different levels of expertise for an expert system in information retrieval Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval, (147-153)
  385. Wunderlich H PROTEST Proceedings of the 22nd ACM/IEEE Design Automation Conference, (204-211)
  386. ACM
    Sellis T and Shapiro L (1985). Optimization of extended database query languages, ACM SIGMOD Record, 14:4, (424-436), Online publication date: 1-May-1985.
  387. ACM
    Sellis T and Shapiro L Optimization of extended database query languages Proceedings of the 1985 ACM SIGMOD international conference on Management of data, (424-436)
  388. Izumida Y, Ishikawa H, Yoshino T, Hoshiai T and Makinouchi A A natural language interface using a world model Proceedings of the second conference on European chapter of the Association for Computational Linguistics, (205-212)
  389. ACM
    Yasdi R Modelling database based expert systems at the conceptual level Proceedings of the 1985 ACM thirteenth annual conference on Computer Science, (400-413)
  390. Papachriston C and Reuter J Microassembly and area reduction techniques for PLA microcode Proceedings of the 17th annual workshop on Microprogramming, (86-94)
  391. ACM
    Papachriston C and Reuter J (1984). Microassembly and area reduction techniques for PLA microcode, ACM SIGMICRO Newsletter, 15:4, (86-94), Online publication date: 1-Dec-1984.
  392. ACM
    Marcus R (1984). An application of artificial intelligence to operations research, Communications of the ACM, 27:10, (1044-1047), Online publication date: 1-Oct-1984.
  393. Smith R (1984). On the Development of Commercial Expert Systems, AI Magazine, 5:3, (61-73), Online publication date: 1-Sep-1984.
  394. ACM
    Grant J (1984). A course in applied logic, ACM SIGCSE Bulletin, 16:3, (26-28), Online publication date: 1-Sep-1984.
  395. Kelly V The CRITTER system Proceedings of the 21st Design Automation Conference, (419-425)
  396. Roach J The rectangle placement language Proceedings of the 21st Design Automation Conference, (405-411)
  397. Palczewski M Performance of algorithms for initial placement Proceedings of the 21st Design Automation Conference, (399-404)
  398. ACM
    Wah B, Li G and Yu C (1984). The status of manip - a multicomputer architecture for solving, combinatorial extremum-search problems, ACM SIGARCH Computer Architecture News, 12:3, (56-63), Online publication date: 1-Jun-1984.
  399. Garcia-Molina H, Lipton R and Valdes J (1984). A Massive Memory Machine, IEEE Transactions on Computers, 33:5, (391-399), Online publication date: 1-May-1984.
  400. Reggia J and Ahuja S Simulation of phonemic errors using artificial intelligence symbol processing techniques Proceedings of the 17th annual symposium on Simulation, (49-64)
  401. Mayer R and Young R Automation of simulation model generation from system specifications Proceedings of the 16th conference on Winter simulation, (570-574)
  402. ACM
    Kumar V Integrating knowledge in problem solving search procedures Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge, (5-10)
  403. ACM
    Wah B, Li G and Yu C The status of manip - a multicomputer architecture for solving, combinatorial extremum-search problems Proceedings of the 11th annual international symposium on Computer architecture, (56-63)
  404. ACM
    Lewis J An effective graphics user interface for rules and inference mechanisms Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, (139-143)
  405. ACM
    Bibel W (1983). Matings in matrices, Communications of the ACM, 26:11, (844-852), Online publication date: 1-Nov-1983.
  406. Bolo L, Kochut K, Leśniewski A and Strzałkowski T Natural, language information retrieval system dialog Proceedings of the first conference on European chapter of the Association for Computational Linguistics, (196-203)
  407. Allen J and Koomen J Planning using a temporal world model Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2, (741-747)
  408. ACM
    DeJong G Artificial intelligence implications for information retrieval Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval, (10-17)
  409. ACM
    DeJong G (1983). Artificial intelligence implications for information retrieval, ACM SIGIR Forum, 17:4, (10-17), Online publication date: 1-Jun-1983.
  410. ACM
    Jarke M and Koch J Range nesting Proceedings of the 1983 ACM SIGMOD international conference on Management of data, (196-206)
  411. ACM
    Bonczek R, Ghiaseddin N, Holsapple C and Whinston A The DSS development system Proceedings of the May 16-19, 1983, national computer conference, (421-435)
  412. ACM
    Jarke M and Koch J (1983). Range nesting, ACM SIGMOD Record, 13:4, (196-206), Online publication date: 1-May-1983.
  413. Lucas P and Risch T Representation of factual information by equations and their evaluation Proceedings of the 6th international conference on Software engineering, (367-376)
  414. Agusa K, Ohnishi A and Ohno Y Verification system for formal requirements description Proceedings of the 6th international conference on Software engineering, (120-126)
  415. ACM
    Brandin D (1982). ACM president's letter: the challenge of the fifth generation, Communications of the ACM, 25:8, (509-510), Online publication date: 1-Aug-1982.
  416. ACM
    Ganapathy S and Dennehy T A new general triangulation method for planar contours Proceedings of the 9th annual conference on Computer graphics and interactive techniques, (69-75)
  417. ACM
    Ganapathy S and Dennehy T (1982). A new general triangulation method for planar contours, ACM SIGGRAPH Computer Graphics, 16:3, (69-75), Online publication date: 1-Jul-1982.
  418. Allen J and Frisch A What's in a semantic network? Proceedings of the 20th annual meeting on Association for Computational Linguistics, (19-27)
  419. Chu K and Fu K VLSI architectures for high speed recognition of context-free languages and finite-state languages Proceedings of the 9th annual symposium on Computer Architecture, (43-49)
  420. ACM
    Chu K and Fu K (1982). VLSI architectures for high speed recognition of context-free languages and finite-state languages, ACM SIGARCH Computer Architecture News, 10:3, (43-49), Online publication date: 1-Apr-1982.
  421. Newell A (1981). Presidential Address, American Association for Artificial Intelligence AAAI80, Stanford University, 19 Aug 1980, AI Magazine, 2:2, (1-33), Online publication date: 1-Dec-1981.
  422. ACM
    Rychener M (1981). Knowledge-based expert systems, ACM SIGART Bulletin:78, (17-18), Online publication date: 1-Oct-1981.
  423. ACM
    Gumb R (1981). Reasonable breadth-biased, ACM SIGART Bulletin:78, (12-13), Online publication date: 1-Oct-1981.
  424. ACM
    Dunlavey M and Miller L (1981). Technical corrections, Communications of the ACM, 24:9, (608-609), Online publication date: 1-Sep-1981.
  425. ACM
    Gupta G (1981). Technical correspondence, Communications of the ACM, 24:9, (607-608), Online publication date: 1-Sep-1981.
  426. ACM
    Winterton J (1981). Technical correspondence, Communications of the ACM, 24:9, (606), Online publication date: 1-Sep-1981.
  427. Riesbeck C Perspectives on parsing issues Proceedings of the 19th annual meeting on Association for Computational Linguistics, (105-106)
  428. Gardner A (1981). Search, AI Magazine, 2:1, (2-23), Online publication date: 1-Jun-1981.
  429. ACM
    Patterson D, Goodell R, Poe M and Steely S V-Compiler Proceedings of the May 4-7, 1981, national computer conference, (103-109)
  430. ACM
    McKay D and Shapiro S MULTI - a LISP based multiprocessing system Proceedings of the 1980 ACM conference on LISP and functional programming, (29-37)
Contributors
  • Stanford Engineering

Recommendations

Doris C. Appleby

Artificial Intelligence (AI) is, or at least has been, a hot topic at colleges, universities, and industrial laboratories. Students are eager to enroll in courses with AI in the title, and even some strictly undergraduate schools have developed liaisons with local industry involved in its applications. Thus, it would seem that a large number of undergraduate texts would be available. However, the six considered below pretty much cover the market. The books by Nilsson and Winston are largely theoretical in nature, written by major researchers in the field. The first is directed to the mathematically adept, while the second is intended for those in related fields. The texts by Charniak and McDermott and by Tanimoto are intended for beginners and include LISP programming with applications. Rich's uneven text attempts to combine clarity and complete explanations, with some success. Banerji's book assumes the the perils of AI applications can best be avoided through adherence to the methods of strict mathematical proof. Taken together, the books leave me somewhat uneasy. Although there seems to be agreement on which topics make up AI (see table 2), as one- or two-semester undergraduate offerings, the texts do not hang together very well. Charniak and McDermott address this issue in their preface, noting “how hard it is to extract coherent and lasting theories from a field developing as rapidly as AI” (p. viii). Winston excludes topics that are well-developed fields in and of themselves. Rather than being solid introductions to a well-defined field of knowledge, the books resemble those texts for liberal arts students that are intended to give the flavor of a technical field without requiring too much background. Interestingly, Fischler and Firschein's Intelligence: The Eye, the Brain, and the Computer [1], a book at the level of Scientific American, is being adopted as the primary text at a number of colleges. [For a review of this book, see , Rev. 8707-0538.] If one is looking for a text providing the necessary foundation material for work in AI, a better choice than any of these would be Genesereth and Nilsson's Logical Foundations for Artificial Intelligence [2], which assumes that an informed acquaintance with ideas expressed in mathematical form and with symbolic logic is necessary for further work. [For a review of this book, see , Rev. 8805-0321.] The six texts considered here paint the field with a broad brush, and as such are useful for a computer science student choosing an area for concentration or for a researcher in some other field who wants to survey Artificial Intelligence. Banerji [I hold to] the viewpoint that the field of Artificial Intelligence, like many fields of science, can and should be discussed with mathematical precision. . . . Much of the mathematical material is in the Appendix and. . . . the flavor of the arguments remains informal. . . . I have not assumed that the reader has more than a passing acquaintance with discrete mathematics. . . . This book can be used as a text in a second course in Artificial Intelligence (pp. ix–x). Given the intended audience, the number of errors in the second printing is unforgivable. If one follows through some of the complex diagrams, such as those on pages 33 and 177, one finds both typographical errors and incompleteness sufficient to confuse even the most diligent undergraduate. On pages 10 and 11, a formal statement is truncated so that the reader cannot possibly know what is intended unless he or she understood the matter beforehand. The diagram that follows, intended to illustrate the statement, is mislabeled in column-major rather than row-major form, so it is of no help at all. Nonetheless, this book is neatly organized to promote a valid position: that successful AI projects of any sort of generality need to be based firmly in correct mathematics. Banerji considers heuristics based on Newell, Shaw, and Simon's General Problem Solver [3]. This is followed by search reductions using notions from graph theory and concepts of machine learning based on the theories of Bruner [4] and their implementation by Pennypacker [5]. These topics lead nicely to the properties necessary for any language suitable for developing learning programs. Of the 36 exercises, 13 are theoretical, of the “prove that. . . .” type. The book would probably be best suited for use in part of a seminar or possibly for independent study. Charniak and McDermott [An AI textbook should] :9Binclude those aspects of the field that we felt would prove to be enduring. . . . present AI as a coherent body of ideas and methods. . . . of the last twenty years. acquaint the student not only with the classical programs of the field, but the underlying theory as well. . . . Our solution [to serving a diverse student population] has been to try to explain everything (pp. vii–viii). In trying to explain everything the authors have written excellent minitutorials on LISP, Bayesian statistics, the predicate calculus, quantification and skolemization, lambda-expressions, nonmonotonic logic, unification, resolution, and Gaussian convolutions. They do not try to summarize the calculus and list those sections and exercises requiring it as optional. However, do not be misled into choosing this as an elementary text for average students. Although little specific knowledge is assumed, a student will have to understand rapidly notions that are often developed throughout an entire course. For example, the reader, depending on his or her prior knowledge of statistics, may not understand the multivariate version of Bayes' theorem after seven pages of (admittedly well done) explanation. For the clever undergraduate, this book cannot be beat. It contains fascinating, up-to-date material, written in a clear and lively style, with compelling exercises at the end of each chapter. The authors also make reference to the relevant literature throughout the narrative and provide notes as well as a complete bibliography. The movement back and forth from theory to application, with excursions into the history of AI, is masterful. The book could serve equally well in a seminar, with students presenting material from the references; in a first AI course, with students completing substantial individual or team programming projects; or as a survey of AI concepts and realizations. As a reference, it provides introductory material on a wide variety of AI topics, with guides to the literature. Nilsson I have attempted here to describe fundamental AI ideas that underlie many of these applications. My organization of these ideas is not, then, based on the subject matter of their application, but is, instead, based on general computational concepts involving the kinds of data structures used, the types of operations performed on these data structures, and the properties of control structures used by AI systems (p. xi). Even though this is an old book on a rapidly changing subject, it is still worth owning, reading, selecting as a text in a graduate seminar, or using as a research sourcebook. The bibliography and notes are outstanding, as is the list of journals. This volume is theoretical, but it is not as basic as the one by Banerji. It does not attempt formal proofs in correct mathematical style, but it does explain in clear English how and why things work as they do. It also discusses why certain modes of thought are important and to which application areas they might lead. The exercises follow the presentation style, with instructions like “draw a sketch . . . ,” “explain why . . . ,” “find a counterexample . . . ,” and “write simple English sentences that express the meaning of . . . .” This book would be a good choice for a seminar, augmented by the assignment of journal papers. It would also make a good sourcebook in a course with a lab or programming component, although the instructor would be on his or her own here in devising suitable projects. Clearly, in this book Nilsson has collected some of the important notions an AI researcher must understand. In his preface, he invites readers to contact him with corrections or suggestions for the second edition, which, unfortunately, has not been forthcoming. An updated text and bibliography from this major researcher would be welcomed by many. Rich The goal of this book is to provide programmers and computer scientists with a readable introduction to the problems and techniques of artificial intelligence. . . . The references to the source literature guarantee that students have access to not just one approach, but to as many as possible of those whose eventual success still needs to be determined by further research (pp. xi–xii). This text was the first, to my knowledge, to present a loosely defined collection of the topics known as AI in a clear and interesting way, assuming little prior knowledge on the part of the reader. It was designed for an introductory graduate course, in conjunction with readings from original sources. In a previous review [8406-0422] the book was criticized for using examples from the early 1970s, with little mention of current issues. Its strengths include readability, well-executed diagrams, good problems and project suggestions, and an up-to-date (as of 1983) and thorough bibliography. It is a pleasure to read, and it explains in detail some of the concepts covered briefly in the Nilsson or Winston books, the only others that were available when this appeared. Although intended for graduate students then, it is probably more suitable for the knowledgeable undergraduates of today. The publisher indicates that a second edition may be forthcoming, but no publication date has been announced at this writing. I eagerly await a new edition. Tanimoto This book grew out of the perception that hands-on experimentation coordinated with textbook explanations of principles and of actual programs can provide an ideal learning combination for students of artificial intelligence. . . . [The text] integrates the presentation of principles with actual runnable LISP illustrations (p. vii). This text is intended for a two- or three-quarter course combining LISP language instruction with AI applications and principles. Many instructors follow this guideline, selecting a language manual separate from the AI text. Tanimoto claims that this book is for undergraduates, while Charniak and McDermott's is more suitable for graduate students. Yet he assumes prior courses in logic, calculus, and probability. Rumors from the front have it that students are having a lot of trouble with both texts. However, given three quarters or two semesters, upper-level students should do nicely with this. If only one semester is available, they will be frustrated. Previous reviewers have been at odds concerning its worth. Pollack [ , Rev. 8710-0831] found that it “fulfills its purpose quite well,” while Lee [ SIGART Newsl. 103 (Jan. 1988)] “cannot recommend this book as it stands for student use.” The problem seems to be that the author attempts to combine difficult concepts with programming exercises, sometimes within the same paragraph. Nonetheless, it is up-to-date, interesting, inclusive, and readable. The hands-on, laboratory approach may well be appreciated by undergraduates, who often miss the fine points of theory the first time around. Winston The central goals of Artificial Intelligence are to make computers more useful and to understand the principles which make intelligence possible. . . . The purpose of this book is to provide [psychologists, philosophers, linguists, and other people] with a picture of what is going on. Thankfully no special background is required, not even computer programming experience or sophisticated mathematical training (p. 1). To understand the ideas introduced in the first nine chapters in depth, there is a need to see some of them embodied in program form. A study of LISP, with examples drawn from the earlier material, addresses that need (p. 5). Winston's book is intended to introduce workers in fields other than computer science to AI. In particular, it is aimed at the non-mathematically oriented whose disciplines “intersect the natural concerns of people doing Artificial Intelligence” (p. 5). Riesbeck [ , Rev. 8409-0703] cautions that this text will not provide the necessary background for doing AI, but that it can provide an understanding of some topics. Winston avoids stressing linguistics, pattern recognition, decision theory, or automatic theorem proving, which require more mathematical background than the addressed audience has. Extensive, well-annotated references provide direction for further study. Concepts are presented in the first nine chapters, and an elementary LISP tutorial with examples from these makes up chapters 10–16. This is a thorough update of an enormously popular first edition. Coded algorithms have been successfully rewritten in English and will be more accessible for the non-technical reader. Exercises are collected in the final chapter. These range from thought questions, “find the bug,” and the programming of simple LISP functions to the writing of a compiler and interpreter for augmented transition networks. Several of the exercises have been supplied by other writers. Webber and Nilsson As can be seen in table 1, all the texts considered include extensive annotated bibliographies. These are hard to keep current in a field as active as AI. Thus, a collection of readings, such as that of Webber and Nilsson, could serve a wide audience if updated regularly—say every two years. As the authors note, many of the papers included are hard to come by, having previously been published only in limited-edition conference proceedings. This volume includes 31 titles in five categories: Search and Search Representation, Deduction, Problem-Solving and Planning, Expert Systems and AI Applications, and Advanced Topics. This last includes material on frames, nonmonotonic reasoning, and speech. Interestingly, there are no papers on vision or robotics, topics that are included in many AI texts.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.