default search action
Electronic Transactions on Artificial Intelligence (ETAI), Volume 4
Volume 4, Section A, 2000
- Richard Washington, Keith Golden, John L. Bresina:
Plan Execution, Monitoring, and Adaptation for Planetary Rovers. 3-21 - Massimo Paolucci, Onn Shehory, Katia P. Sycara:
Interleaving Planning and Execution in a Multiagent Team Planning Environment. 23-43
Volume 4, Section B, 2000
- Donald Michie:
It Takes Two (At Least) to Tango. 1-19 - John W. Lloyd:
Predicate Construction in Higher-order Logic. 21-51 - Makoto Haraguchi, Yoshiaki Okubo, Tokuyasu Kakuta:
A Logical Foundation of Metaphoric Search Based on Abstraction Approach. 53-81 - Ken Ueno, Koichi Furukawa, Michael Bain:
Motor Skill as Dynamic Constraint Satisfaction. 83-96 - Simon Colton:
An Application-based Comparison of Automated Theory Formation and Inductive Logic Programming. 97-117 - Marcel Turcotte, Stephen H. Muggleton, Michael J. E. Sternberg:
Use of Inductive Logic Programming to Learn Principles of Protein Structure. 119-124 - Dorian Suc, Ivan Bratko:
Qualitative Trees Applied to Bicycle Riding. 125-140 - Stephen H. Muggleton:
Learning Stochastic Logic Programs. 141-153 - Simon White, Derek H. Sleeman:
A Constraint-Based Approach to the Description and Detection of Fitness-for-Purpose. 155-183
Volume 4, Section C, 2000
- Guy W. Mineau, Akshay Bissoon, Robert Godin:
Simple Pre- and Post-Pruning Techniques for Large Conceptual Clustering Structures. 1-20 - Uta Priss:
Faceted Knowledge Representation. 21-33 - Martin F. van Bommel, T. J. Beck:
Incremental Encoding of Multiple Inheritance Hierarchies Supporting Lattice Operations. 35-49 - Peter W. Eklund, Richard J. Cole II:
A Knowledge Representation for Information Filtering Using Formal Concept Analysis. 51-61
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.