1. Jeffrey Bradshaw. Software Agents. MIT Press, 1997.
   Keywords: agents, honours reading.
   

   @Book{Bradshaw1997,
   author = "Jeffrey Bradshaw",
   title = "Software Agents",
   publisher = "MIT Press",
   keywords = "agents, honours reading",
   year = "1997",
   
   }
   




2. Eyal Kushilevitz and Noam Nisan. Communication complexity. Cambridge University Press, New York, 1997.
   Note: 96012840 96012840 Eyal Kushilevitz, Noam Nisan. Includes bibliographical references (p. 176-185) and index. 1. Basics -- 2. More on Covers -- 3. Randomization -- 4. Advanced Topics -- 5. The Communication Complexity of Relations -- 6. Multiparty Communication Complexity -- 7. Variable Partition Models -- 8. Networks, Communication, and VLSI -- 9. Decision Trees and Data Structures -- 10. Boolean Circuit Depth -- 11. More Boolean Circuit Lower Bounds -- 12. Time and Space -- 13. Randomness -- 14. Further Topics -- Index of Notation -- A. Mathematical Background.
   Keywords: Computational complexity, computational complexity, honours reading.
   
   

   Abstract:

   "Many aspects of the internal and external workings of computers can be viewed, at different levels, as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It extends Shannon's information theory, allowing two-way communication and arbitrary processes. This book surveys the mathematical theory, concentrating on the question of how much communication is necessary for any particular process. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks, VLSI, and information theory."

   
   

   @Book{Kushilevitz1997,
   author = "Eyal Kushilevitz and Noam Nisan",
   title = "Communication complexity",
   publisher = "Cambridge University Press",
   address = "New York",
   note = "96012840 96012840 Eyal Kushilevitz, Noam Nisan. Includes bibliographical references (p. 176-185) and index. 1. Basics -- 2. More on Covers -- 3. Randomization -- 4. Advanced Topics -- 5. The Communication Complexity of Relations -- 6. Multiparty Communication Complexity -- 7. Variable Partition Models -- 8. Networks, Communication, and VLSI -- 9. Decision Trees and Data Structures -- 10. Boolean Circuit Depth -- 11. More Boolean Circuit Lower Bounds -- 12. Time and Space -- 13. Randomness -- 14. Further Topics -- Index of Notation -- A. Mathematical Background.",
   abstract = "Many aspects of the internal and external workings of computers can be viewed, at different levels, as a series of communication processes. Communication complexity is the mathematical theory of such communication processes. It extends Shannon's information theory, allowing two-way communication and arbitrary processes. This book surveys the mathematical theory, concentrating on the question of how much communication is necessary for any particular process. This is an essential resource for graduate students and researchers in theoretical computer science, circuits, networks, VLSI, and information theory.",
   keywords = "Computational complexity, computational complexity, honours reading",
   year = "1997",
   
   }
   




3. Tom M. Mitchell. Machine Learning. McGraw-Hill, New York, 1997.
   Note: Tom M. Mitchell. Includes bibliographical references and indexes. 1. Introduction -- 2. Concept Learning and the General-to-Specific Ordering -- 3. Decision Tree Learning -- 4. Artificial Neural Networks -- 5. Evaluating Hypotheses -- 6. Bayesian Learning -- 7. Computational Learning Theory -- 8. Instance-Based Learning -- 9. Genetic Algorithms -- 10. Learning Sets of Rules -- 11. Analytical Learning -- 12. Combining Inductive and Analytical Learning -- 13. Reinforcement Learning.
   Keywords: machine learning, honours reading.
   

   @Book{Mitchell1997,
   author = "Tom M. Mitchell",
   title = "Machine Learning",
   publisher = "McGraw-Hill",
   address = "New York",
   note = "Tom M. Mitchell. Includes bibliographical references and indexes. 1. Introduction -- 2. Concept Learning and the General-to-Specific Ordering -- 3. Decision Tree Learning -- 4. Artificial Neural Networks -- 5. Evaluating Hypotheses -- 6. Bayesian Learning -- 7. Computational Learning Theory -- 8. Instance-Based Learning -- 9. Genetic Algorithms -- 10. Learning Sets of Rules -- 11. Analytical Learning -- 12. Combining Inductive and Analytical Learning -- 13. Reinforcement Learning.",
   keywords = "machine learning, honours reading",
   year = "1997",
   
   }
   




4. Anil Nerode and Richard A. Shore. Logic for applications, Graduate texts in computer science.. Springer, New York, 2nd edition, 1997.
   Note: 96043297 Anil Nerode, Richard A. Shore. Includes bibliographical references (p. [409]-438) and indexes. I. Propositional Logic -- II. Predicate Logic -- III. Prolog -- IV. Modal Logic -- V. Intuitionistic Logic -- VI. Elements of Set Theory -- Appendix A. An Historical Overview -- Appendix B. A Genealogical Database. Graduate texts in computer science (Springer-Verlag New York Inc.).
   Keywords: proof theory, honours reading.
   
   

   Abstract:

   "This textbook provides a first introduction to mathematical logic which is closely attuned to the applications of logic in computer science. In it the authors emphasize the notion that deduction is a form of computation. While all the traditional subjects of logic are covered thoroughly - syntax, semantics, completeness, and compactness - much of the book deals with less traditional topics such as resolution theorem proving, logic programming, and non-classical logics - modal and intuitionistic - which are becoming increasingly important in computer science. The book also provides a systematic treatment of the elements of set theory, a historical overview of its subjects, and an extensive annotated bibliography. No previous exposure to logic is assumed, and so this will be suitable for upper level undergraduate or beginning graduate students in computer science or mathematics."

   
   

   @Book{Nerode1997,
   author = "Anil Nerode and Richard A. Shore",
   title = "Logic for applications",
   publisher = "Springer",
   address = "New York",
   edition = "2nd",
   series = "Graduate texts in computer science.",
   note = "96043297 Anil Nerode, Richard A. Shore. Includes bibliographical references (p. [409]-438) and indexes. I. Propositional Logic -- II. Predicate Logic -- III. Prolog -- IV. Modal Logic -- V. Intuitionistic Logic -- VI. Elements of Set Theory -- Appendix A. An Historical Overview -- Appendix B. A Genealogical Database. Graduate texts in computer science (Springer-Verlag New York Inc.)",
   abstract = "This textbook provides a first introduction to mathematical logic which is closely attuned to the applications of logic in computer science. In it the authors emphasize the notion that deduction is a form of computation. While all the traditional subjects of logic are covered thoroughly - syntax, semantics, completeness, and compactness - much of the book deals with less traditional topics such as resolution theorem proving, logic programming, and non-classical logics - modal and intuitionistic - which are becoming increasingly important in computer science. The book also provides a systematic treatment of the elements of set theory, a historical overview of its subjects, and an extensive annotated bibliography. No previous exposure to logic is assumed, and so this will be suitable for upper level undergraduate or beginning graduate students in computer science or mathematics.",
   keywords = "proof theory, honours reading",
   year = "1997",
   
   }
   




5. Shan-Hwei Nienhuys-Cheng and Ronald de Wolf. Foundations of Inductive Logic Programming. Springer-Verlag, New York, 1997.
   Keywords: inductive logic programming, honours reading.
   

   @Book{Nienhuys-Cheng1997,
   author = "Shan-Hwei Nienhuys-Cheng and Ronald de Wolf",
   title = "Foundations of Inductive Logic Programming",
   publisher = "Springer-Verlag",
   address = "New York",
   keywords = "inductive logic programming, honours reading",
   year = "1997",
   
   }
   




6. Michael Sipser. Introduction to the theory of computation. PWS Pub., Boston, 1997.
   Note: 96035322 Michael Sipser. Includes bibliographical references (p. - ) and index. Pt. 1. Automata and Languages. 1. Regular Languages. 2. Context-Free Languages -- Pt. 2. Computability Theory. 3. The Church-Turing Thesis. 4. Decidability. 5. Reducibility. 6. Advanced Topics in Computability Theory -- Pt. 3. Complexity Theory. 7. Time Complexity. 8. Space Complexity. 9. Intractability. 10. Advanced topics in complexity theory.
   Keywords: computational complexity, honours reading.
   

   @Book{Sipser1997,
   author = "Michael Sipser",
   title = "Introduction to the theory of computation",
   publisher = "PWS Pub.",
   address = "Boston",
   note = "96035322 Michael Sipser. Includes bibliographical references (p. - ) and index. Pt. 1. Automata and Languages. 1. Regular Languages. 2. Context-Free Languages -- Pt. 2. Computability Theory. 3. The Church-Turing Thesis. 4. Decidability. 5. Reducibility. 6. Advanced Topics in Computability Theory -- Pt. 3. Complexity Theory. 7. Time Complexity. 8. Space Complexity. 9. Intractability. 10. Advanced topics in complexity theory.",
   keywords = "computational complexity, honours reading",
   year = "1997",
   
   }
   

1. A. R. Pearce and T. Caelli. Relational Evidence Theory and Schematic Interpretation. In T. Caelli and W. F. Bischof, editors,Machine Learning and Image Interpretation, pages 67--118. New York, USA, 1997.
   Keywords: graph theory, inductive logic programming, agentlab. [download paper ]
   

   @InCollection{Pearce1997b,
   author = "A. R. Pearce and T. Caelli",
   title = "Relational Evidence Theory and Schematic Interpretation",
   booktitle = "Machine Learning and Image Interpretation",
   editor = "T. Caelli and W. F. Bischof",
   address = "New York, USA",
   pages = "67--118",
   URL = "http://www.agentlab.unimelb.edu.au/papers/pearce1997b.pdf",
   keywords = "graph theory, inductive logic programming, agentlab",
   year = "1997",
   
   }
   




2. R. A. Bazzi and G. Neiger. The Complexity of Almost-Optimal Simultaneous Coordination. Algorithmica, 17:308--321, 1997.
   Keywords: multiagent coordination, modal logic, honours reading.
   

   @Article{Bazzi1997,
   author = "R. A. Bazzi and G. Neiger",
   title = "The Complexity of Almost-Optimal Simultaneous Coordination",
   journal = "Algorithmica",
   volume = "17",
   pages = "308--321",
   keywords = "multiagent coordination, modal logic, honours reading",
   year = "1997",
   
   }
   




3. Antonio Brogi, Evelina Lamma, Paolo Mancarella, and Paola Mello. A Unifying View for Logic Programming with Non-Monotonic Reasoning. Theoretical Computer Science, 184(1-2):1--59, 1997.
   Keywords: logic programming, nonmonotonic logic, honours reading.
   

   @Article{Brogi1997,
   author = "Antonio Brogi and Evelina Lamma and Paolo Mancarella and Paola Mello",
   title = "A Unifying View for Logic Programming with Non-Monotonic Reasoning",
   journal = "Theoretical Computer Science",
   volume = "184",
   number = "1-2",
   pages = "1--59",
   keywords = "logic programming, nonmonotonic logic, honours reading",
   year = "1997",
   
   }
   




4. Marcos A. Castilho, Luis Farinas del Cerro, Olivier Gasquet, and Andreas Herzig. Modal Tableaux with Propagation Rules and Structural Rules. Fundamenta Informaticae, 32(3-4):281--297, 1997.
   Keywords: modal logic, model theory, honours reading.
   

   @Article{Castilho1997,
   author = "Marcos A. Castilho and Luis Fari\H{n}as del Cerro and Olivier Gasquet and Andreas Herzig",
   title = "Modal Tableaux with Propagation Rules and Structural Rules",
   journal = "Fundamenta Informaticae",
   volume = "32",
   number = "3-4",
   pages = "281--297",
   keywords = "modal logic, model theory, honours reading",
   year = "1997",
   
   }
   




5. Philip W. Dart, Lorraine Johnston, Cameron Schmidt, and Liz Sonenberg. Developing an Accredited Software Engineering Program. IEEE Software, 14(6):66--70, 1997.
   Keywords: agentlab.
   

   @Article{Dart1997,
   author = "Philip W. Dart and Lorraine Johnston and Cameron Schmidt and Liz Sonenberg",
   title = "Developing an Accredited Software Engineering Program",
   journal = "IEEE Software",
   volume = "14",
   number = "6",
   pages = "66--70",
   keywords = "agentlab",
   year = "1997",
   
   }
   




6. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Knowledge-based programs. Distributed Computing, 10(4):199--225, 1997.
   Note: Publisher: Springer-Verlag, Germany.
   Keywords: epistemic logic, agent programming languages, modal logic, honours reading.
   
   

   Abstract:

   "Reasoning about activities in a distributed computer system at the level of the knowledge of individuals and groups allows one to abstract away from many concrete details of the system being considered. The authors make use of two notions introduced in their recent book to facilitate designing and reasoning about systems in terms of knowledge. The first notion is that of a knowledge-based program. A knowledge-based program is a syntactic object: a program with tests for knowledge. The second notion is that of a context, which captures the setting in which a program is to be executed. In a given context, a standard program (one without tests for knowledge) is represented by (i.e. corresponds in a precise sense to) a unique system. A knowledge-based program, on the other hand, may be represented by no system, one system, or many systems. They provide a sufficient condition for a knowledge-based program to be represented in a unique way in a given context. This condition applies to many cases of interest, and covers many of the knowledge-based programs considered in the literature. They also completely characterize the complexity of determining whether a given knowledge-based program has a unique representation, or any representation at all, in a given finite-state context. (35 References)."

   
   

   @Article{Fagin1997,
   author = "R. Fagin and J. Y. Halpern and Y. Moses and M. Y. Vardi",
   title = "Knowledge-based programs",
   journal = "Distributed Computing",
   volume = "10",
   number = "4",
   pages = "199--225",
   note = "Publisher: Springer-Verlag, Germany.",
   abstract = "Reasoning about activities in a distributed computer system at the level of the knowledge of individuals and groups allows one to abstract away from many concrete details of the system being considered. The authors make use of two notions introduced in their recent book to facilitate designing and reasoning about systems in terms of knowledge. The first notion is that of a knowledge-based program. A knowledge-based program is a syntactic object: a program with tests for knowledge. The second notion is that of a context, which captures the setting in which a program is to be executed. In a given context, a standard program (one without tests for knowledge) is represented by (i.e. corresponds in a precise sense to) a unique system. A knowledge-based program, on the other hand, may be represented by no system, one system, or many systems. They provide a sufficient condition for a knowledge-based program to be represented in a unique way in a given context. This condition applies to many cases of interest, and covers many of the knowledge-based programs considered in the literature. They also completely characterize the complexity of determining whether a given knowledge-based program has a unique representation, or any representation at all, in a given finite-state context. (35 References).",
   keywords = "epistemic logic, agent programming languages, modal logic, honours reading",
   year = "1997",
   
   }
   




7. H. Kitano, M. Asada, Y. Kuniyoshi, I. Noda, E. Osawa, and H. Matsubara. RoboCup: a challenge problem for AI. AI Magazine, 18(1):73--85, 1997.
   Note: Publisher: American Assoc. Artificial Intelligence, USA.
   Keywords: agent-oriented software engineering, honours reading.
   
   

   Abstract:

   "The RoboCup (Robot World-Cup Soccer) is an attempt to foster AI and intelligent robotics research by providing a standard problem where a wide range of technologies can be integrated and examined. The first RoboCup competition will be held at the Fifteenth International Joint Conference on Artificial Intelligence in Nagoya, Japan. A robot team must actually perform a soccer game, incorporating various technologies, including design principles of autonomous agents, multiagent collaboration, strategy acquisition, real-time reasoning, robotics, and sensor fusion. RoboCup is a task for a team of multiple fast-moving robots under a dynamic environment. Although RoboCup's final target is a world cup with real robots, RoboCup offers a software platform for research on the software aspects of RoboCup. This article describes technical challenges involved in RoboCup, rules, and the simulation environment. (35 References)."

   
   

   @Article{Kitano1997,
   author = "H. Kitano and M. Asada and Y. Kuniyoshi and I. Noda and E. Osawa and H. Matsubara",
   title = "RoboCup: a challenge problem for {AI}",
   journal = "AI Magazine",
   volume = "18",
   number = "1",
   pages = "73--85",
   note = "Publisher: American Assoc. Artificial Intelligence, USA.",
   abstract = "The RoboCup (Robot World-Cup Soccer) is an attempt to foster AI and intelligent robotics research by providing a standard problem where a wide range of technologies can be integrated and examined. The first RoboCup competition will be held at the Fifteenth International Joint Conference on Artificial Intelligence in Nagoya, Japan. A robot team must actually perform a soccer game, incorporating various technologies, including design principles of autonomous agents, multiagent collaboration, strategy acquisition, real-time reasoning, robotics, and sensor fusion. RoboCup is a task for a team of multiple fast-moving robots under a dynamic environment. Although RoboCup's final target is a world cup with real robots, RoboCup offers a software platform for research on the software aspects of RoboCup. This article describes technical challenges involved in RoboCup, rules, and the simulation environment. (35 References).",
   keywords = "agent-oriented software engineering, honours reading",
   year = "1997",
   
   }
   




8. H. J. Levesque, R. Reiter, Y. Lesperance, F. Lin, and R. B. Scherl. GOLOG: A logic programming language for dynamic domains. Journal of Logic Programming, 31:59--84, 1997.
   Keywords: honours reading, situation calculus, modal logic, model theory, GOLOG.
   

   @Article{Levesque1997,
   author = "H. J. Levesque and R. Reiter and Y. Lesperance and F. Lin and R. B. Scherl",
   title = "{GOLOG}: {A} logic programming language for dynamic domains",
   journal = "Journal of Logic Programming",
   volume = "31",
   pages = "59--84",
   keywords = "honours reading, situation calculus, modal logic, model theory, GOLOG",
   year = "1997",
   
   }
   




9. R. J. Mooney. Inductive logic programming for natural language processing. Inductive Logic Programming, 1314:3--22, 1997.
   Note: Times Cited: 1 Lecture Notes in Artificial Intelligence Article English Cited References Count: 63 Bn72g.
   Keywords: inductive logic programming, computational linguistics, honours reading.
   
   

   Abstract:

   "This paper reviews our recent work on applying inductive logic programming to the construction of natural language processing systems. We have developed a system, CHILL, that learns a parser from a training corpus of parsed sentences by inducing heuristics that control an initial overly-general shift-reduce parser. CHILL learns syntactic parsers as well as ones that translate English database queries directly into executable logical form. The ATIS corpus of airline information queries was used to test the acquisition of syntactic parsers, and CHILL performed competitively with recent statistical methods. English queries to a small database on U.S. geography were used to test the acquisition of a complete natural language interface, and the parser that CHILL acquired was more accurate than an existing hand-coded system. The paper also includes a discussion of several issues this work has raised regarding the capabilities and testing of ILP systems as well as a summary of our current research directions."

   [download paper ]
   

   @Article{Mooney1997,
   author = "R. J. Mooney",
   title = "Inductive logic programming for natural language processing",
   journal = "Inductive Logic Programming",
   volume = "1314",
   pages = "3--22",
   note = "Times Cited: 1 Lecture Notes in Artificial Intelligence Article English Cited References Count: 63 Bn72g",
   abstract = "This paper reviews our recent work on applying inductive logic programming to the construction of natural language processing systems. We have developed a system, CHILL, that learns a parser from a training corpus of parsed sentences by inducing heuristics that control an initial overly-general shift-reduce parser. CHILL learns syntactic parsers as well as ones that translate English database queries directly into executable logical form. The ATIS corpus of airline information queries was used to test the acquisition of syntactic parsers, and CHILL performed competitively with recent statistical methods. English queries to a small database on U.S. geography were used to test the acquisition of a complete natural language interface, and the parser that CHILL acquired was more accurate than an existing hand-coded system. The paper also includes a discussion of several issues this work has raised regarding the capabilities and testing of ILP systems as well as a summary of our current research directions.",
   URL = "://000082727500001",
   keywords = "inductive logic programming, computational linguistics, honours reading",
   year = "1997",
   
   }
   




10. D. Poole. The independent choice logic for modelling multiple agents under uncertainty. Artificial Intelligence, 94(1-2):7--56, 1997.
    Note: Publisher: Elsevier, Netherlands.
    Keywords: Markov theory, agents, game theory, honours reading.
    
    

    Abstract:

    "Inspired by game theory representations, Bayesian networks, influence diagrams, structured Markov decision process models, logic programming, and work in dynamical systems, the independent choice logic (ICL) is a semantic framework that allows for independent choices (made by various agents, including nature) and a logic program that gives the consequence of choices. This representation can be used as a specification for agents that act in a world, make observations of that world and have memory, as well as a modelling tool for dynamic environments with uncertainty. The rules specify the consequences of an action, what can be sensed and the utility of outcomes. This paper presents a possible-worlds semantics for ICL, and shows how to embed influence diagrams, structured Markov decision processes, and both the strategic (normal) form and extensive (game-tree) form of games within the ICL. It is argued that the ICL provides a natural and concise representation for multi-agent decision-making under uncertainty that allows for the representation of structured probability tables, the dynamic construction of networks (through the use of logical variables) and a way to handle uncertainty and decisions in a logical representation. (57 References)."

    
    

    @Article{Poole1997,
    author = "D. Poole",
    title = "The independent choice logic for modelling multiple agents under uncertainty",
    journal = "Artificial Intelligence",
    volume = "94",
    number = "1-2",
    pages = "7--56",
    note = "Publisher: Elsevier, Netherlands.",
    abstract = "Inspired by game theory representations, Bayesian networks, influence diagrams, structured Markov decision process models, logic programming, and work in dynamical systems, the independent choice logic (ICL) is a semantic framework that allows for independent choices (made by various agents, including nature) and a logic program that gives the consequence of choices. This representation can be used as a specification for agents that act in a world, make observations of that world and have memory, as well as a modelling tool for dynamic environments with uncertainty. The rules specify the consequences of an action, what can be sensed and the utility of outcomes. This paper presents a possible-worlds semantics for ICL, and shows how to embed influence diagrams, structured Markov decision processes, and both the strategic (normal) form and extensive (game-tree) form of games within the ICL. It is argued that the ICL provides a natural and concise representation for multi-agent decision-making under uncertainty that allows for the representation of structured probability tables, the dynamic construction of networks (through the use of logical variables) and a way to handle uncertainty and decisions in a logical representation. (57 References).",
    keywords = "Markov theory, agents, game theory, honours reading",
    year = "1997",
    
    }
    




11. S. J. Russell. Rationality and intelligence. Artificial Intelligence, 94(1-2):57--77, 1997.
    Note: Publisher: Elsevier, Netherlands.
    Keywords: artificial intelligence, honours reading.
    
    

    Abstract:

    "The long-term goal of our field is the creation and understanding of intelligence. Productive research in AI, both practical and theoretical, benefits from a notion of intelligence that is precise enough to allow the cumulative development of robust systems and general results. The concept of rational agency has long been considered a leading candidate to fulfil this role. This paper outlines a gradual evolution in the formal conception of rationality that brings it closer to our informal conception of intelligence and simultaneously reduces the gap between theory and practice. Some directions for future research are indicated. (52 References)."

    
    

    @Article{Russell1997,
    author = "S. J. Russell",
    title = "Rationality and intelligence",
    journal = "Artificial Intelligence",
    volume = "94",
    number = "1-2",
    pages = "57--77",
    note = "Publisher: Elsevier, Netherlands.",
    abstract = "The long-term goal of our field is the creation and understanding of intelligence. Productive research in AI, both practical and theoretical, benefits from a notion of intelligence that is precise enough to allow the cumulative development of robust systems and general results. The concept of rational agency has long been considered a leading candidate to fulfil this role. This paper outlines a gradual evolution in the formal conception of rationality that brings it closer to our informal conception of intelligence and simultaneously reduces the gap between theory and practice. Some directions for future research are indicated. (52 References).",
    keywords = "artificial intelligence, honours reading",
    year = "1997",
    
    }
    

1. Graham Barrington and Liz Sonenberg. Following the path to the gorillas ... or the banana tree: reasoning with nested beliefs. In Proceedings of the AI'97 workshop on Theoretical and Practical Foundations of Intelligent Agents and Agent-Oriented Systems, pages 1--16, 1997.
   Keywords: agentlab.
   

   @InProceedings{Barrington1997,
   author = "Graham Barrington and Liz Sonenberg",
   title = "Following the path to the gorillas ... or the banana tree: reasoning with nested beliefs",
   booktitle = "Proceedings of the AI'97 workshop on Theoretical and Practical Foundations of Intelligent Agents and Agent-Oriented Systems",
   pages = "1--16",
   keywords = "agentlab",
   year = "1997",
   
   }
   




2. Terry Caelli and Adrian R. Pearce. Cooperative and distributed architectures for image interpretation. In Proceedings of the First International Workshop on Cooperative Distributed Vision, Kyoto, 1997, pages 55--74, 1997. cdvws@vision.kuee.kyoto-u.ac.jp Research for the Futre Program, The Japan Society for the Promotion of Science.
   Keywords: coordination, agentlab.
   

   @InProceedings{Caelli1997,
   author = "Terry Caelli and Adrian R. Pearce",
   title = "Cooperative and distributed architectures for image interpretation",
   booktitle = "Proceedings of the First International Workshop on Cooperative Distributed Vision, Kyoto, 1997",
   publisher = "cdvws@vision.kuee.kyoto-u.ac.jp Research for the Futre Program, The Japan Society for the Promotion of Science",
   pages = "55--74",
   keywords = "coordination, agentlab",
   year = "1997",
   
   }
   




3. Andrew Cassin and Leon Sterling. IndiansWatcher - a single minded Software Agent. In Proceedings of the Second International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology, London, U.K., pages 529, 1997.
   Keywords: agentlab.
   

   @InProceedings{Cassin1997,
   author = "Andrew Cassin and Leon Sterling",
   title = "IndiansWatcher - a single minded Software Agent",
   booktitle = "Proceedings of the Second International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology",
   address = "London, U.K.",
   pages = "529",
   keywords = "agentlab",
   year = "1997",
   
   }
   




4. Lawrence Cavedon, Anand Rao, Liz Sonenberg, and Gil Tidhar. Teamwork via Team Plans in Intelligent Autonomous Agent Systems. In Proceedings of the International Conference on WorldWide Computing and its Applications, LNCS, Vol 1274, Japan, pages 106--121, 1997.
   Keywords: agentlab, teamwork, models of interaction and context aware applications.
   

   @InProceedings{Cavedon1997,
   author = "Lawrence Cavedon and Anand Rao and Liz Sonenberg and Gil Tidhar",
   title = "Teamwork via Team Plans in Intelligent Autonomous Agent Systems",
   booktitle = "Proceedings of the International Conference on WorldWide Computing and its Applications, LNCS, Vol 1274",
   address = "Japan",
   pages = "106--121",
   keywords = "agentlab, teamwork, models of interaction and context aware applications",
   year = "1997",
   
   }
   




5. Lawrence Cavedon and Liz Sonenberg. Social Commitment and Preferred Goals. In Proceedings of the AI'97 workshop on Theoretical and Practical Foundations of Intelligent Agents and Agent-Oriented Systems, pages 33--46, 1997.
   Keywords: agentlab.
   

   @InProceedings{Cavedon1997b,
   author = "Lawrence Cavedon and Liz Sonenberg",
   title = "Social Commitment and Preferred Goals",
   booktitle = "Proceedings of the AI'97 workshop on Theoretical and Practical Foundations of Intelligent Agents and Agent-Oriented Systems",
   pages = "33--46",
   keywords = "agentlab",
   year = "1997",
   
   }
   




6. Mark d'Inverno, David Kinny, Michael Luck, and Michael Wooldridge. A Formal Specification of dMARS. In Proceedings of the Fourth International Workship on Agent Theories, Architectures, and Languages, ATAL'97 appears in Lecture Notes in Artificial Intelligence, volume 1365, pages 155--176, 1997.
   Keywords: model theory, procedural reasoning, agentlab, belief desires intentions, BDI.
   

   @InProceedings{d'Inverno1997,
   author = "Mark d'Inverno and David Kinny and Michael Luck and Michael Wooldridge",
   title = "A Formal Specification of d{MARS}",
   booktitle = "Proceedings of the Fourth International Workship on Agent Theories, Architectures, and Languages, ATAL'97 appears in Lecture Notes in Artificial Intelligence, volume 1365",
   pages = "155--176",
   keywords = "model theory, procedural reasoning, agentlab, belief desires intentions, BDI",
   year = "1997",
   
   }
   




7. Xiaoying Gao and Leon Sterling. Using Limited Common Sense Knowledge to Guide Knowledge Acquisition for Information Agents. In Proceedings of the AI'97 workshop on knowledge acquisition, Perth, Australia, pages 9.1--9.11, 1997.
   Keywords: agentlab.
   

   @InProceedings{Gao1997b,
   author = "Xiaoying Gao and Leon Sterling",
   title = "Using Limited Common Sense Knowledge to Guide Knowledge Acquisition for Information Agents",
   booktitle = "Proceedings of the AI'97 workshop on knowledge acquisition",
   address = "Perth, Australia",
   pages = "9.1--9.11",
   keywords = "agentlab",
   year = "1997",
   
   }
   




8. Xiaoying Gao. A Knowledge-Based Approach for Searching Semi-Structured Documents. In Australian Natural Language Postgraduate Workshop,, Melbourne, Australia, 1997.
   Keywords: agentlab.
   

   @InProceedings{Gao1997,
   author = "Xiaoying Gao",
   title = "A Knowledge-Based Approach for Searching Semi-Structured Documents",
   booktitle = "Australian Natural Language Postgraduate Workshop,",
   address = "Melbourne, Australia",
   keywords = "agentlab",
   year = "1997",
   
   }
   




9. Christopher Grinton, Liz Sonenberg, and Leon Sterling. Exploring agent cooperation: studies with a simple pursuit game. In Proceedings of Advanced Topics in Artificial Intelligence: Lecture Notes in Computer Science vol 1342, Perth, Australia, pages 96--105, 1997. Springer Verlag.
   Keywords: agentlab.
   

   @InProceedings{Grinton1997,
   author = "Christopher Grinton and Liz Sonenberg and Leon Sterling",
   title = "Exploring agent cooperation: studies with a simple pursuit game",
   booktitle = "Proceedings of Advanced Topics in Artificial Intelligence: Lecture Notes in Computer Science vol 1342",
   address = "Perth, Australia",
   publisher = "Springer Verlag",
   pages = "96--105",
   keywords = "agentlab",
   year = "1997",
   
   }
   




10. Yi Han, Seng Wai Loke, and Leon Sterling. Agents for Citation Finding on the World Wide Web. In Proceedings of the 2nd International Conference on Practical Applications of Intelligent Agents and Multi-Agent Technology, pages 303--317, 1997. The Practical Application Company Ltd..
    Keywords: agentlab.
    

    @InProceedings{Han1997,
    author = "Yi Han and Seng Wai Loke and Leon Sterling",
    title = "Agents for Citation Finding on the World Wide Web",
    booktitle = "Proceedings of the 2nd International Conference on Practical Applications of Intelligent Agents and Multi-Agent Technology",
    publisher = "The Practical Application Company Ltd.",
    pages = "303--317",
    keywords = "agentlab",
    year = "1997",
    
    }
    




11. David Kinny and Michael P. Georgeff. Modelling and Design of Multi-Agent Systems. In Proceedings of ATAL 1997, pages 1--20, 1997.
    Keywords: agentlab.
    

    @InProceedings{Kinny1997,
    author = "David Kinny and Michael P. Georgeff",
    title = "Modelling and Design of Multi-Agent Systems",
    booktitle = "Proceedings of ATAL 1997",
    pages = "1--20",
    keywords = "agentlab",
    year = "1997",
    
    }
    




12. David Kinny, Jan Treur, Les Gasser, Steve Clark, and Jörg P. Müller. Panel: Methodologies for Multi-Agent Systems. In Proceedings of ATAL 1997, pages 1, 1997.
    Keywords: agentlab.
    

    @InProceedings{Kinny1997b,
    author = "David Kinny and Jan Treur and Les Gasser and Steve Clark and Jörg P. Müller",
    title = "Panel: Methodologies for Multi-Agent Systems",
    booktitle = "Proceedings of ATAL 1997",
    pages = "1",
    keywords = "agentlab",
    year = "1997",
    
    }
    




13. D. McIlroy, B. Smith, C. Heinze, and M. Turner. Air defence operational analysis using the SWARMM Model. In Asia Pacific Operations Research Symposium, 1997.
    Keywords: agentlab, agent-oriented software engineering.
    

    @InProceedings{McIlroy1997,
    author = "D. McIlroy and B. Smith and C. Heinze and M. Turner",
    title = "Air defence operational analysis using the {SWARMM} Model",
    booktitle = "Asia Pacific Operations Research Symposium",
    keywords = "agentlab, agent-oriented software engineering",
    year = "1997",
    
    }
    




14. Lee Naish and Leon Sterling. A Higher Order Reconstruction of Stepwise Enhancement. In Proceedings of LOPSTR 1997, pages 245--262, 1997.
    Keywords: agentlab.
    

    @InProceedings{Naish1997,
    author = "Lee Naish and Leon Sterling",
    title = "A Higher Order Reconstruction of Stepwise Enhancement",
    booktitle = "Proceedings of LOPSTR 1997",
    pages = "245--262",
    keywords = "agentlab",
    year = "1997",
    
    }
    




15. Adrian Pearce and Terry Caelli. Schematic Interpretation and the CLARET Consolidated Learning Algorithm. In Proceedings of the First International Conference and Knowledge-Based Intelligent Electronic Systems (KES'97), Adelaide, Australia, volume 1, pages 64--71, 1997.
    Keywords: machine learning, agentlab.
    

    @InProceedings{Pearce1997,
    author = "Adrian Pearce and Terry Caelli",
    title = "Schematic Interpretation and the {CLARET} Consolidated Learning Algorithm",
    booktitle = "Proceedings of the First International Conference and Knowledge-Based Intelligent Electronic Systems (KES'97), Adelaide, Australia",
    volume = "1",
    pages = "64--71",
    keywords = "machine learning, agentlab",
    year = "1997",
    
    }
    




16. Leon Sterling. On Finding Needles in WWW Haystacks. In Proceedings of the Australian Joint Conference on Artificial Intelligence 1997, pages 25--36, 1997.
    Keywords: agentlab, agent-oriented software engineering.
    

    @InProceedings{Sterling1997,
    author = "Leon Sterling",
    title = "On Finding Needles in {WWW} Haystacks",
    booktitle = "Proceedings of the Australian Joint Conference on Artificial Intelligence 1997",
    pages = "25--36",
    keywords = "agentlab, agent-oriented software engineering",
    year = "1997",
    
    }
    

1. Hans Leo Bodlaender. Treewidth: algorithmic techniques and results. Technical Report Tech. report UU-CS-1997-31, 1997, Univ. Utrecht, Dept. of Computer Science, 1997.
   Keywords: graph theory, honours reading. [download paper ]
   

   @TechReport{Bodlaender1997,
   author = "Hans Leo Bodlaender",
   title = "Treewidth: algorithmic techniques and results",
   institution = "Univ. Utrecht, Dept. of Computer Science",
   number = "Tech. report UU-CS-1997-31, 1997",
   type = "Technical Report",
   URL = "http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-1997/1997-31.pdf",
   keywords = "graph theory, honours reading",
   year = "1997",
   
   }
   




2. Michael Papasimeon. The Design of the XCombat System. Technical Report 1997, Aeronautical and Maritime Research Laboratories, DSTO, 1997.
   Keywords: simulation, agentlab, multi-agent simulation.
   

   @TechReport{Papasimeon1997,
   author = "Michael Papasimeon",
   title = "The Design of the {XC}ombat System",
   institution = "Aeronautical and Maritime Research Laboratories, DSTO",
   number = "1997",
   type = "Technical Report",
   keywords = "simulation, agentlab, multi-agent simulation",
   year = "1997",
   
   }
   




3. Kim Shearer, Horst Bunke, Svetha Venkatesh, and Dorota Kieronska. Efficient graph mathicng for video indexing. Technical Report 1997, Department of Computer Science, Curtin University, 1997.
   Keywords: graph theory, honours reading.
   

   @TechReport{Shearer1997,
   author = "Kim Shearer and Horst Bunke and Svetha Venkatesh and Dorota Kieronska",
   title = "Efficient graph mathicng for video indexing",
   institution = "Department of Computer Science, Curtin University",
   number = "1997",
   type = "Technical Report",
   keywords = "graph theory, honours reading",
   year = "1997",
   
   }
   

Disclaimer: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.