1. John J. Kelly. Essence of logic. Prentice Hall, London ; New York, 1996.
   Note: 96050970 John J. Kelly. Includes bibliographical references and index. 1. Truth Tables -- 2. Semantic Tableaux -- 3. Natural Deduction.
   Keywords: proof theory, honours reading.
   
   

   Abstract:

   "The Essence of Logic is an exciting new publication that provides a concise introduction to formal logic. Making little demands on previous mathematical knowledge, this comprehensive text prepares the reader for the analysis and application of logic techniques in computing. It can also be used for the study of mathematical logic in its own right. Extensive in its coverage, each new concept is gently introduced, and then reinforced by numerous exercises and examples. This practical approach quickly develops skills needed to apply logic in a wide range of computer science disciplines."

   
   

   @Book{Kelly1996,
   author = "John J. Kelly",
   title = "Essence of logic",
   publisher = "Prentice Hall",
   address = "London ; New York",
   note = "96050970 John J. Kelly. Includes bibliographical references and index. 1. Truth Tables -- 2. Semantic Tableaux -- 3. Natural Deduction.",
   abstract = "The Essence of Logic is an exciting new publication that provides a concise introduction to formal logic. Making little demands on previous mathematical knowledge, this comprehensive text prepares the reader for the analysis and application of logic techniques in computing. It can also be used for the study of mathematical logic in its own right. Extensive in its coverage, each new concept is gently introduced, and then reinforced by numerous exercises and examples. This practical approach quickly develops skills needed to apply logic in a wide range of computer science disciplines.",
   keywords = "proof theory, honours reading",
   year = "1996",
   
   }
   




2. Nancy Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
   Keywords: algorithmic complexity, computational complexity, algorithms, honours reading.
   

   @Book{Lynch1996,
   author = "Nancy Lynch",
   title = "Distributed Algorithms",
   publisher = "Morgan Kaufmann Publishers",
   keywords = "algorithmic complexity, computational complexity, algorithms, honours reading",
   year = "1996",
   
   }
   




3. G. M. P. O'Hare and Nicholas R. Jennings. Foundations of Distributed Artificial Intelligence. John Wiley & Sons, Inc., New York, NY, 1996.
   Keywords: agents, artificial intelligence, honours reading.
   

   @Book{O'Hare1996,
   author = "G. M. P. O'Hare and Nicholas R. Jennings",
   title = "Foundations of Distributed Artificial Intelligence",
   publisher = "John Wiley \& Sons, Inc.",
   address = "New York, NY",
   keywords = "agents, artificial intelligence, honours reading",
   year = "1996",
   
   }
   




4. Gerhard Weiss and Sandip Sen, editors. Adaptation and Learning in Multi-Agent Systems, volume 1042 of Lecture Notes in Computer Science. Springer, 1996.
   Keywords: machine learning, honours reading.
   

   @Book{Weiss1996b,
   editor = "Gerhard Weiss and Sandip Sen",
   title = "Adaptation and Learning in Multi-Agent Systems",
   publisher = "Springer",
   volume = "1042",
   series = "Lecture Notes in Computer Science",
   keywords = "machine learning, honours reading",
   year = "1996",
   
   }
   

1. Alain Colmerauer and Philippe Roussel. The Birth of Prolog. In Thomas J. Bergin and Richard G. Gibson, editors,History of programming languages---II, pages 331--367. ACM, 1996.
   Keywords: logic programming, honours reading.
   

   @InCollection{Colmerauer1996,
   author = "Alain Colmerauer and Philippe Roussel",
   title = "The Birth of Prolog",
   booktitle = "History of programming languages---II",
   editor = "Thomas J. Bergin and Richard G. Gibson",
   publisher = "ACM",
   pages = "331--367",
   keywords = "logic programming, honours reading",
   year = "1996",
   
   }
   




2. N. R. Jennings. Coordination techniques for distributed artificial intelligence. In G. M. P. O’Hare and N. R. Jennings, editors,Foundations of Distributed Artificial Intelligence,, pages 187--210. John Wiley & Sons, 1996.
   Keywords: multiagent coordination, honours reading, agent programming languages.
   

   @InCollection{Jennings1996,
   author = "N. R. Jennings",
   title = "Coordination techniques for distributed artificial intelligence",
   booktitle = "Foundations of Distributed Artificial Intelligence,",
   editor = "G. M. P. O’Hare and N. R. Jennings",
   publisher = "John Wiley & Sons",
   pages = "187--210",
   keywords = "multiagent coordination, honours reading, agent programming languages",
   year = "1996",
   
   }
   




3. Gerhard Weiss. Adaptation and Learning in Multi-Agent Systems: Some Remarks and a Bibliography. In Gerhard Weiss and Sandip Sen, editors,Adaptation and Learning in Multi-Agent Systems, pages 1--21. Springer Verlag, 1996.
   Keywords: machine learning, honours reading.
   

   @InCollection{Weiss1996,
   author = "Gerhard Weiss",
   title = "Adaptation and Learning in Multi-Agent Systems: Some Remarks and a Bibliography",
   booktitle = "Adaptation and Learning in Multi-Agent Systems",
   editor = "Gerhard Wei{\ss} and Sandip Sen",
   publisher = "Springer Verlag",
   pages = "1--21",
   keywords = "machine learning, honours reading",
   year = "1996",
   
   }
   




4. Hiroko Aibat and Takao Terano. A Computational Model for Distributed Knowledge Systems with Learning Mechanisms. Expert Systems with Applications, 10(3-4):417--427, 1996.
   Keywords: machine learning, honours reading.
   

   @Article{Aibat1996,
   author = "Hiroko Aibat and Takao Terano",
   title = "A Computational Model for Distributed Knowledge Systems with Learning Mechanisms",
   journal = "Expert Systems with Applications",
   volume = "10",
   number = "3-4",
   pages = "417--427",
   keywords = "machine learning, honours reading",
   year = "1996",
   
   }
   




5. Michael Fisher. Temporal Semantics for Concurrent Metatem. J. Symb. Comput., 22(5/6):627--648, 1996.
   Keywords: temporal logic, logistics, honours reading.
   

   @Article{Fisher1996,
   author = "Michael Fisher",
   title = "Temporal Semantics for Concurrent Metatem",
   journal = "J. Symb. Comput.",
   volume = "22",
   number = "5/6",
   pages = "627--648",
   keywords = "temporal logic, logistics, honours reading",
   year = "1996",
   
   }
   




6. Shree Murthy and J. J. Garcia-Luna-Aceves. An Efficient Routing Protocol for Wireless Networks. Mobile Networks and Applications, 1(2):183--197, 1996.
   Keywords: sensor networks, honours reading.
   

   @Article{Murthy1996,
   author = "Shree Murthy and J. J. Garcia-Luna-Aceves",
   title = "An Efficient Routing Protocol for Wireless Networks",
   journal = "Mobile Networks and Applications",
   volume = "1",
   number = "2",
   pages = "183--197",
   keywords = "sensor networks, honours reading",
   year = "1996",
   
   }
   




7. H. S. Nwana, L. C. Lee, and Nicholas R. Jennings. Co-ordination in Software Agent Systems. The British Telecom Technical Journal, 14(4):79--88, 1996.
   Keywords: coordination, honours reading.
   

   @Article{Nwana1996b,
   author = "H. S. Nwana and L. C. Lee and Nicholas R. Jennings",
   title = "Co-ordination in Software Agent Systems",
   journal = "The British Telecom Technical Journal",
   volume = "14",
   number = "4",
   pages = "79--88",
   keywords = "coordination, honours reading",
   year = "1996",
   
   }
   




8. Hyacinth S. Nwana. Software Agents: An Overview. Knowledge Engineering Review, 11(3):205--244, 1996.
   Keywords: agents, honours reading.
   

   @Article{Nwana1996,
   author = "Hyacinth S. Nwana",
   title = "Software Agents: An Overview",
   journal = "Knowledge Engineering Review",
   volume = "11",
   number = "3",
   pages = "205--244",
   keywords = "agents, honours reading",
   year = "1996",
   
   }
   




9. J. R. Quinlan. Improved Use of Continuous Attributes in C4.5. Journal of Artificial Intelligence Research, 4:77--90, 1996.
   Keywords: machine learning, minimum message Length, honours reading.
   

   @Article{Quinlan1996,
   author = "J. R. Quinlan",
   title = "Improved Use of Continuous Attributes in {C4}.5",
   journal = "Journal of Artificial Intelligence Research",
   volume = "4",
   pages = "77--90",
   keywords = "machine learning, minimum message Length, honours reading",
   year = "1996",
   
   }
   




10. Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of mercury, an efficient purely declarative logic programming language. Journal of Logic Programming, 29(1-3):17--64, 1996.
    Note: Times Cited: 29 Article English Cited References Count: 36 Vt295.
    Keywords: logic programming, honours reading.
    
    

    Abstract:

    "We introduce Mercury, a new purely declarative logic programming language designed to provide the support that groups of application programmers need when building large programs. Mercury's strong type, mode, and determinism systems improve program reliability by catching many errors at compile time. We present a new and relatively simple execution model that takes advantage of the information these systems provide, yielding very efficient code. The Mercury compiler uses this execution model to generate portable C code. Our benchmarking shows that the code generated by our implementation is significantly faster than the code generated by mature optimizing implementations of other logic programming languages."

    [download paper ]
    

    @Article{Somogyi1996,
    author = "Z. Somogyi and F. Henderson and T. Conway",
    title = "The execution algorithm of mercury, an efficient purely declarative logic programming language",
    journal = "Journal of Logic Programming",
    volume = "29",
    number = "1-3",
    pages = "17--64",
    note = "Times Cited: 29 Article English Cited References Count: 36 Vt295",
    abstract = "We introduce Mercury, a new purely declarative logic programming language designed to provide the support that groups of application programmers need when building large programs. Mercury's strong type, mode, and determinism systems improve program reliability by catching many errors at compile time. We present a new and relatively simple execution model that takes advantage of the information these systems provide, yielding very efficient code. The Mercury compiler uses this execution model to generate portable C code. Our benchmarking shows that the code generated by our implementation is significantly faster than the code generated by mature optimizing implementations of other logic programming languages.",
    URL = "://A1996VT29500003",
    keywords = "logic programming, honours reading",
    year = "1996",
    
    }
    




11. Leon Sterling. Guest Editor's Introduction Special Issue: Applications of Logic Programming. JLP, 26(2):91--92, 1996.
    Keywords: agentlab.
    

    @Article{Sterling1996,
    author = "Leon Sterling",
    title = "Guest Editor's Introduction Special Issue: Applications of Logic Programming",
    journal = "JLP",
    volume = "26",
    number = "2",
    pages = "91--92",
    keywords = "agentlab",
    year = "1996",
    
    }
    




12. W. Peter van Gabbeek, Rob J.Weijland. Branching Time and Abstraction in Bisimulation Semantics. Journal of the Association for Computing Machinery, 43(3):555--600, 1996.
    Keywords: model theory, graph theory, honours reading.
    

    @Article{van_Gabbeek1996,
    author = "W. Peter {van Gabbeek, Rob J.Weijland}",
    title = "Branching Time and Abstraction in Bisimulation Semantics",
    journal = "Journal of the Association for Computing Machinery",
    volume = "43",
    number = "3",
    pages = "555--600",
    keywords = "model theory, graph theory, honours reading",
    year = "1996",
    
    }
    




13. R. J. van Glabbeek and W. Peter Weijland. Branching time and abstraction in bisimulation semantics. J. ACM, 43(3):555--600, 1996.
    Keywords: model theory, honours reading, graph theory, graph matching.
    

    @Article{Glabbeek1996,
    author = "R. J. van Glabbeek and W. Peter Weijland",
    title = "Branching time and abstraction in bisimulation semantics",
    journal = "J. ACM",
    volume = "43",
    number = "3",
    pages = "555--600",
    keywords = "model theory, honours reading, graph theory, graph matching",
    year = "1996",
    
    }
    

1. Daniel Cabeza and Manuel V. Hermenegildo. Implementing Distributed Concurrent Constraint Execution in the CIAO System.. In APPIA-GULP-PRODE 1996, pages 67--78, 1996.
   Keywords: agent programming languages, honours reading, logic programming.
   

   @InProceedings{Cabeza1996,
   author = "Daniel Cabeza and Manuel V. Hermenegildo",
   title = "Implementing Distributed Concurrent Constraint Execution in the {CIAO} System.",
   booktitle = "APPIA-GULP-PRODE 1996",
   pages = "67--78",
   keywords = "agent programming languages, honours reading, logic programming",
   year = "1996",
   
   }
   




2. Lawrence Cavedon, Anand S. Rao, and Gil Tidhar. Social and Individual Commitment. In Proceedings of the PRICAI Workshop on Intelligent Agent Systems 1996, pages 152--163, 1996.
   Keywords: agentlab.
   

   @InProceedings{Cavedon1996,
   author = "Lawrence Cavedon and Anand S. Rao and Gil Tidhar",
   title = "Social and Individual Commitment",
   booktitle = "Proceedings of the PRICAI Workshop on Intelligent Agent Systems 1996",
   pages = "152--163",
   keywords = "agentlab",
   year = "1996",
   
   }
   




3. Michael Peter Georgeff and Anand S. Rao. A profile of the Australian Artificial Intelligence Institute. In IEEE Expert, pages 89--92, 1996.
   Keywords: procedural reasoning, honours reading, agents.
   

   @InProceedings{Georgeff1996,
   author = "Michael Peter Georgeff and Anand S. Rao",
   title = "A profile of the Australian Artificial Intelligence Institute",
   booktitle = "IEEE Expert",
   pages = "89--92",
   keywords = "procedural reasoning, honours reading, agents",
   year = "1996",
   
   }
   




4. David Kinny, Michael P. Georgeff, and Anand S. Rao. A Methodology and Modelling Technique for Systems of BDI Agents. In Proceedings of MAAMAW 1996, Lecture Notes in Artificial Intelligence, Volume 1038, pages 56--71, 1996.
   Keywords: agentlab, belief desires intentions, BDI, logistics.
   

   @InProceedings{Kinny1996,
   author = "David Kinny and Michael P. Georgeff and Anand S. Rao",
   title = "A Methodology and Modelling Technique for Systems of {BDI} Agents",
   booktitle = "Proceedings of MAAMAW 1996",
   series = "Lecture Notes in Artificial Intelligence, Volume 1038",
   pages = "56--71",
   keywords = "agentlab, belief desires intentions, BDI, logistics",
   year = "1996",
   
   }
   




5. Seng Wai Loke, Andrew Davison, and Leon Sterling. Lightweight Deductive Databases on the World-Wide Web. In Proceedings of the 1st Workshop on Logic Programming Tools for INTERNET Applications at the Joint International Conference and Symposium on Logic Programming (JICSLP '96), 1996.
   Keywords: agentlab, databases.
   

   @InProceedings{Loke1996c,
   author = "Seng Wai Loke and Andrew Davison and Leon Sterling",
   title = "Lightweight Deductive Databases on the World-Wide Web",
   booktitle = "Proceedings of the 1st Workshop on Logic Programming Tools for INTERNET Applications at the Joint International Conference and Symposium on Logic Programming (JICSLP '96)",
   keywords = "agentlab, databases",
   year = "1996",
   
   }
   




6. Seng Wai Loke, Andrew Davison, and Leon Sterling. CiFi: An Intelligent Agent for Citation Finding on the World-Wide Web. In N. Foo Goebel and R., editors, Proceedings of the 4th Pacific Rim International Conference on Artificial Intelligence, Cairns, Australia (PRICAI '96): Lecture Notes in Artificial Intelligence (LNAI) volume 1114, pages 580--591, 1996. Springer Verlag.
   Keywords: agentlab.
   

   @InProceedings{Loke1996b,
   author = "Seng Wai Loke and Andrew Davison and Leon Sterling",
   title = "CiFi: An Intelligent Agent for Citation Finding on the World-Wide Web",
   booktitle = "Proceedings of the 4th Pacific Rim International Conference on Artificial Intelligence, Cairns, Australia (PRICAI '96): Lecture Notes in Artificial Intelligence (LNAI) volume 1114",
   editor = "N. Foo Goebel and R.",
   publisher = "Springer Verlag",
   pages = "580--591",
   keywords = "agentlab",
   year = "1996",
   
   }
   




7. Seng Wai Loke and Andrew Davison. Logic Programming with the Word-Wide Web,. In Proceedings of the 7th ACM Conference on Hypertext (Hypertext '96), Washington DC USA, pages 235--245, 1996. ACM Press.
   Keywords: agentlab.
   

   @InProceedings{Loke1996,
   author = "Seng Wai Loke and Andrew Davison",
   title = "Logic Programming with the Word-Wide Web,",
   booktitle = "Proceedings of the 7th ACM Conference on Hypertext (Hypertext '96)",
   address = "Washington DC USA",
   publisher = "ACM Press",
   pages = "235--245",
   keywords = "agentlab",
   year = "1996",
   
   }
   




8. David Morley. Semantics of BDI Agents and Their Environment. In Proceedings of the PRICAI Workshop on Intelligent Agent Systems 1996, pages 119--134, 1996.
   Keywords: agentlab, belief desires intentions, BDI.
   

   @InProceedings{Morley1996,
   author = "David Morley",
   title = "Semantics of {BDI} Agents and Their Environment",
   booktitle = "Proceedings of the PRICAI Workshop on Intelligent Agent Systems 1996",
   pages = "119--134",
   keywords = "agentlab, belief desires intentions, BDI",
   year = "1996",
   
   }
   




9. David Morley and Liz Sonenberg. A Logic for Concurrent Events and Action Failure. In Proceedings of PRICAI '96: LNCS vol 1114, pages 483--494, 1996.
   Keywords: agentlab.
   

   @InProceedings{Morley1996b,
   author = "David Morley and Liz Sonenberg",
   title = "A Logic for Concurrent Events and Action Failure",
   booktitle = "Proceedings of PRICAI '96: LNCS vol 1114",
   pages = "483--494",
   keywords = "agentlab",
   year = "1996",
   
   }
   




10. Adrian Pearce, Terry Caelli, and Walter Bischof. CLARET: A new Relational Learning Algorithm for Interpretation in Spatial Domains. In Proceedings of the Fourth International Conference on Control, Automation, Robotics and Vision (ICARV'96), Singapore, pages 650--654, 1996.
    Keywords: graph theory, machine learning, inductive logic programming, agentlab.
    

    @InProceedings{Pearce1996b,
    author = "Adrian Pearce and Terry Caelli and Walter Bischof",
    title = "{CLARET}: {A} new Relational Learning Algorithm for Interpretation in Spatial Domains",
    booktitle = "Proceedings of the Fourth International Conference on Control, Automation, Robotics and Vision (ICARV'96), Singapore",
    pages = "650--654",
    keywords = "graph theory, machine learning, inductive logic programming, agentlab",
    year = "1996",
    
    }
    




11. Anand S. Rao. AgentSpeak(L): BDI Agents Speak Out in a Logical Computable Language. In Rudy van Hoe, editor, Seventh European Workshop on Modelling Autonomous Agents in a Multi-Agent World, Lecture Notes in Artificial Intelligence, Volume 1038, Eindhoven, The Netherlands, pages 42--55, 1996. Springer Verlag.
    Keywords: belief desires intentions, BDI, model theory, agent specification and programming languages, honours reading, logistics.
    

    @InProceedings{Rao1996,
    author = "Anand S. Rao",
    title = "AgentSpeak({L}): {BDI} Agents Speak Out in a Logical Computable Language",
    booktitle = "Seventh European Workshop on Modelling Autonomous Agents in a Multi-Agent World, Lecture Notes in Artificial Intelligence, Volume 1038",
    editor = "Rudy van Hoe",
    address = "Eindhoven, The Netherlands",
    publisher = "Springer Verlag",
    pages = "42--55",
    keywords = "belief desires intentions, BDI, model theory, agent specification and programming languages, honours reading, logistics",
    year = "1996",
    
    }
    




12. Gadi Solotorevsky and Ehud Gudes. Algorithms for solving distributed constraint satisfaction problems (DCSPs). In Brian Drabble, editor, Artificial Intelligence Planning Systems Conference (AIP), Edinburgh, pages 191--198, 1996. AAAI Press.
    Keywords: multiagent coordination, honours reading, DCOP, DCSP, constraint satisfaction.
    
    

    Abstract:

    "This paper investigates Constraint Satisfaction Problems (CSPs) that axe distributed by nature, i.e., there is a division of the CSP into sub components (agents) that axe connected via constraints, where each subcomponent includes several of the CSP variables with the constraints between them. We call such a problem a Distributed CSP (DCSP). In this paper we give a formal definition of DCSPs and present four algorithms for solving them. Two of the algorithms are based on the difference between the difficulty of solving the internal constraints in the CSP components (we call them the peripheral components) of the DCSP and the difficulty of solving the constraints between the different CSPs (the central component). The two other algorithms use local and global views of the DCSP respectively. All the algorithms permit the use of different techniques (CSP, knowledge based, and operation research algorithms) in solving each of the problem components. We probe that as long as all the selected techniques axe sound and complete, our algorithms are sound and complete. The algorithms were tested in a real distributed environment; the results show that when there is a difference between the difficulty of solving the peripheral components and the central one, taking advazltage of it may reduce significantly the amount of work (constraint checks and message passing) needed for solving the DCSP."

    
    

    @InProceedings{Solotorevsky1996,
    author = "Gadi Solotorevsky and Ehud Gudes",
    title = "Algorithms for solving distributed constraint satisfaction problems ({DCSP}s)",
    booktitle = "Artificial Intelligence Planning Systems Conference (AIP)",
    editor = "Brian Drabble",
    address = "Edinburgh",
    publisher = "AAAI Press",
    pages = "191--198",
    abstract = "This paper investigates Constraint Satisfaction Problems (CSPs) that axe distributed by nature, i.e., there is a division of the CSP into sub components (agents) that axe connected via constraints, where each subcomponent includes several of the CSP variables with the constraints between them. We call such a problem a Distributed CSP (DCSP). In this paper we give a formal definition of DCSPs and present four algorithms for solving them. Two of the algorithms are based on the difference between the difficulty of solving the internal constraints in the CSP components (we call them the peripheral components) of the DCSP and the difficulty of solving the constraints between the different CSPs (the central component). The two other algorithms use local and global views of the DCSP respectively. All the algorithms permit the use of different techniques (CSP, knowledge based, and operation research algorithms) in solving each of the problem components. We probe that as long as all the selected techniques axe sound and complete, our algorithms are sound and complete. The algorithms were tested in a real distributed environment; the results show that when there is a difference between the difficulty of solving the peripheral components and the central one, taking advazltage of it may reduce significantly the amount of work (constraint checks and message passing) needed for solving the DCSP.",
    keywords = "multiagent coordination, honours reading, DCOP, DCSP, constraint satisfaction",
    year = "1996",
    
    }
    




13. Leon Sterling, Seng Wai Loke, and Andrew Davison. Software Agents for Retrieving Knowledge from the WWW. In Proceedings of the Agents and Web-based Design Environments workshop, Fourth International Conference on Artificial Intelligence in Design, Stanford University, USA, 1996.
    Keywords: agentlab, agent-oriented software engineering.
    

    @InProceedings{Sterling1996b,
    author = "Leon Sterling and Seng Wai Loke and Andrew Davison",
    title = "Software Agents for Retrieving Knowledge from the {WWW}",
    booktitle = "Proceedings of the Agents and Web-based Design Environments workshop, Fourth International Conference on Artificial Intelligence in Design",
    address = "Stanford University, USA",
    keywords = "agentlab, agent-oriented software engineering",
    year = "1996",
    
    }
    




14. Gil Tidhar, Anand Rao, and Liz Sonenberg. Guided Team Selection. In ICMAS96 proceedings, Japan, pages 369--376, 1996.
    Keywords: agentlab, teamwork.
    

    @InProceedings{Tidhar1996,
    author = "Gil Tidhar and Anand Rao and Liz Sonenberg",
    title = "Guided Team Selection",
    booktitle = "ICMAS96 proceedings",
    address = "Japan",
    pages = "369--376",
    keywords = "agentlab, teamwork",
    year = "1996",
    
    }
    

1. Stewart Baillie. Pragmatic information discovery in the World-Wide Web. M.Eng.Sc., The University of Melbourne, 1996.
   Keywords: agentlab, agent-oriented software engineering.
   

   @PhdThesis{Baillie1996,
   author = "Stewart Baillie",
   title = "Pragmatic information discovery in the World-Wide Web",
   school = "The University of Melbourne",
   type = "M.Eng.Sc.",
   keywords = "agentlab, agent-oriented software engineering",
   year = "1996",
   
   }
   




2. Adrian Pearce. Relational Evidence Theory and Spatial Interpretation Procedures. PhD, School of Computing, Curtin University, 1996.
   Keywords: machine learning, agentlab. [download paper ]
   

   @PhdThesis{Pearce1996,
   author = "Adrian Pearce",
   title = "Relational Evidence Theory and Spatial Interpretation Procedures",
   school = "School of Computing, Curtin University",
   type = "PhD",
   URL = "http://www.agentlab.unimelb.edu.au/papers/pearce1996.pdf",
   keywords = "machine learning, agentlab",
   year = "1996",
   
   }
   

1. H. Bunke and B. T. Messmer. Recent Advances in Graph Matching. Technical Report 1996, Institut fur Informatik und angewandte Mathematik, University of Bern, 1996.
   Keywords: graph theory, honours reading.
   

   @TechReport{Bunke1996,
   author = "H. Bunke and B. T. Messmer",
   title = "Recent Advances in Graph Matching",
   institution = "Institut fur Informatik und angewandte Mathematik, University of Bern",
   number = "1996",
   type = "Technical Report",
   keywords = "graph theory, honours reading",
   year = "1996",
   
   }
   




2. Wray L. Buntine. A guide to the literature on learning graphical models. Technical Report 1996, RIACS at NASA Ames Research Center, 1996.
   Keywords: Bayesian theory, honours reading.
   

   @TechReport{Buntine1996,
   author = "Wray L. Buntine",
   title = "A guide to the literature on learning graphical models",
   institution = "RIACS at NASA Ames Research Center",
   number = "1996",
   type = "Technical Report",
   keywords = "Bayesian theory, honours reading",
   year = "1996",
   
   }
   




3. T. Gabric, S Ch'ng, Gil Tidhar, and Liz Sonenberg. Implementation of the guided team selection approach. Technical Report 96/21, Department of Computer Science, University of Melbourne, Australia, 1996.
   Keywords: agentlab.
   

   @TechReport{Gabric1996,
   author = "T. Gabric and S Ch'ng and Gil Tidhar and Liz Sonenberg",
   title = "Implementation of the guided team selection approach",
   institution = "Department of Computer Science, University of Melbourne, Australia",
   number = "96/21",
   type = "Technical Report",
   keywords = "agentlab",
   year = "1996",
   
   }
   




4. Jonathan Oliver and David Hand. Introduction to Minimum Encoding Inference. Technical Report 205, Department of Computer Science, Monash University, Clayton, Victoria, Australia, December 1996.
   Keywords: minimum message length, honours reading.
   

   @TechReport{Oliver1996,
   author = "Jonathan Oliver and David Hand",
   title = "Introduction to Minimum Encoding Inference",
   institution = "Department of Computer Science, Monash University, Clayton, Victoria, Australia",
   number = "205",
   type = "Technical Report",
   month = dec,
   keywords = "minimum message length, honours reading",
   year = "1996",
   
   }
   




5. Adrian Pearce, Terry Caelli, and Simon Goss. Aeronautical Parser for Spatio-Temporal Rules obtained by Machine Learning. Contract Report for DSTO 1996, Department of Computing, Curtin University, October 1996.
   Keywords: machine learning, simulation, agentlab.
   

   @TechReport{Pearce1996c,
   author = "Adrian Pearce and Terry Caelli and Simon Goss",
   title = "Aeronautical Parser for Spatio-Temporal Rules obtained by Machine Learning",
   institution = "Department of Computing, Curtin University",
   number = "1996",
   type = "Contract Report for DSTO",
   month = oct,
   keywords = "machine learning, simulation, agentlab",
   year = "1996",
   
   }
   

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.