1. Leon Sterling and Kuldar Taveter. The Art of Agent-Oriented Modelling. MIT Press, 2009.
   Note: Forthcoming.
   Keywords: agent-oriented software engineering, agentlab, ROADMAP, honours reading. [bibtex-entry]



2. Philippe Besnard and Anthony Hunter. Elements of Argumentation. MIT Press, 2008.
   Keywords: argumentation, honours reading. [bibtex-entry]



3. Michael Sipser. Introduction to the theory of computation: second edition. PWS Pub., Boston, 2 edition, 2006.
   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. [bibtex-entry]



4. Paul Scerri, Regis Vincent, and Roger T. Mailler, editors. Coordination of Large-Scale Multiagent Systems. 2005.
   Keywords: multiagent coordination, honours reading, agent programming languages. [abstract] [bibtex-entry]



5. R. H. Bordini, M. Dastani, J. Dix, and A. El Fallah Seghrouchni, editors. Multi-Agent Programming Languages, Platforms and Applications, volume 15 of Multiagent Systems, Artificial Societies, and Simulated Organizations. 2005.
   Keywords: agent programming languages, honours reading, logistics. [abstract] [bibtex-entry]



6. Ronald J. Brachman and Hector J. Levesque. Knowledge representation and reasoning . Morgan Kaufmann, Amsterdam ; Boston, 2004.
   Note: 2004046573 Ronald J. Brachman, Hector J. Levesque. Includes bibliographical references (p. 349-375) and index.
   Keywords: situation calculus, honours reading. [download paper ] [bibtex-entry]



7. Feng Zhao and Leonidas J. Guibas. Wireless sensor networks : an information processing approach , The Morgan Kaufmann series in networking.. Morgan Kaufmann, Amsterdam ; San Francisco, 2004.
   Note: 2004301905 Feng Zhao, Leonidas J. Guibas. Includes bibliographical references (p. 323-345) and index.
   Keywords: sensor networks, honours reading. [download paper ] [bibtex-entry]



8. Ernest Friedman-Hill. Jess in Action. Manning Publications Co., 2003.
   Keywords: agent programming languages, honours reading, logistics. [abstract] [bibtex-entry]



9. Michael Luck, Peter McBurney, and Chris Preist. Agent Technology: Enabling next generation computing: a roadmap for agent based computing. Agentlink, 2003.
   Keywords: agents, honours reading. [abstract] [bibtex-entry]



10. Kenneth H. Rosen. Discrete mathematics and its applications. McGraw-Hill, Boston, 5th edition, 2003.
    Note: 2002070890 Kenneth H. Rosen. Includes bibliographic references (p. 1-8, 4th set) and indexes.
    Keywords: theory of computation, computational complexity, honours reading. [bibtex-entry]



11. Stuart J. Russell and Peter Norvig. Artificial intelligence : a modern approach, Prentice Hall series in artificial intelligence.. Prentice Hall, Upper Saddle River, N.J. ; [Great Britain], 2nd edition, 2003.
    Note: GBA3-9270 Stuart J. Russell and Peter Norvig ; contributing writers, John F. Canny ... [et al.]. Previous ed.: 1995. Includes bibliographical references and index.
    Keywords: artificial intelligence, honours reading, agents. [bibtex-entry]



12. Dieter Fensel, James A. Hendler, H. Lieberman, and Wolfgang Wahlster. Spinning the semantic Web : bringing the World Wide Web to its full potential. MIT Press, Cambridge, Mass., 2002.
    Note: 2002016503 edited by Dieter Fensel ... [et al.]. Includes bibliographical references and index.
    Keywords: Graph theory, honours reading, Semantic Web. [bibtex-entry]



13. Melvin Fitting. Types Tableaus and Godels God. Kluwer, 2002.
    Keywords: modal logic, agent programming languages, honours reading. [bibtex-entry]



14. Lorenzo Magnani, Nancy J. Nersessian, and Claudio Pizzi, editors. Logical and Computational Aspects of Model-Based Reasoning, volume 25 of Applied logic series. Kluwer, 2002.
    Keywords: model theory, honours reading. [abstract] [bibtex-entry]



15. Patrick Blackburn, Maarten de Rijke, and Yde Venema. Modal logic. Cambridge University Press, New York, 2001.
    Note: 00054667 Patrick Blackburn, Maarten de Rijke, Yde Venema. Includes bibliographical references and index.
    Keywords: modal logic, honours reading. [abstract] [bibtex-entry]



16. Donald Davidson. Inquiries into truth and interpretation. Oxford University Press, Oxford, New edition, 2001.
    Note: GBA1-X5144 Donald Davidson. Originally published: 1984. Includes index. Bibliography. Philosophical essays ; v. 2.
    Keywords: philosophy, ontologies, proof theory, honours reading. [bibtex-entry]



17. Dov M. Gabbay and Franz Guenthner. Handbook of philosophical logic . Kluwer Academic Publishers, Dordrecht ; Boston, 2nd edition, 2001.
    Note: 2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.
    Keywords: logic, modal logic, model theory, kripke structures, honours reading, epistemic logic. [abstract] [download paper ] [bibtex-entry]



18. John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, Boston, 2nd edition, 2001.
    Note: 00064608 John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman. Includes bibliographical references (p. 510-511) and index.
    Keywords: theory of computation, computational complexity, honours reading. [bibtex-entry]



19. Gabriele Kern-Isberner. Conditionals in Nonmonotonic Reasoning and Belief Revision: Considering Conditionals As Agents. Springer-Verlag New York, Inc., 2001.
    Keywords: belief revision, nonmonotonic logic, honours reading. [bibtex-entry]



20. Graham Priest. An introduction to non-classical logic. Cambridge University Press, Cambridge, 2001.
    Note: 00023609 GBA1-19206 Graham Priest. Includes bibliographical references and index.
    Keywords: modal logic, model theory, honours reading. [bibtex-entry]



21. Raymond Reiter. Knowledge in action : logical foundations for specifying and implementing dynamical systems. MIT Press, Cambridge, Mass., 2001.
    Note: The frame problem and the situation calculus.
    Keywords: artificial intelligence, situation calculus, honours reading. [bibtex-entry]



22. Mark d'Inverno and Michael Luck, editors. Understanding agent systems, Springer series on agent technology.. Springer, New York, 2001.
    Note: 2001031126 Mark d'Inverno. Michael Luck (eds.) Includes bibliographical references and index.
    Keywords: agents, honours reading, proof theory. [bibtex-entry]



23. David Basin. Labelled deduction, Applied logic series ; v. 17. Kluwer Academic Publishers, Dordrecht ; Boston, 2000.
    Note: Edited by David Basin ... [et al.] ill. ; 25 cm.
    Keywords: model theory, proof theory, graph theory, honours reading. [bibtex-entry]



24. Robert Dale, Hermann Moisl, and H. L. Somers. Handbook of natural language processing. Marcel Dekker, New York, 2000.
    Note: 00031597 edited by Robert Dale, Hermann Moisl, Harold Somers.
    Keywords: computational linguistics, honours reading. [bibtex-entry]



25. David Harel, Dexter Kozen, and Jerzy Tiuryn. Dynamic Logic. MIT Press, 2000.
    Keywords: dynamic logic, modal logic, honours reading. [abstract] [bibtex-entry]



26. Judea Pearl. Causality : models, reasoning, and inference. Cambridge University Press, Cambridge, 2000.
    Keywords: causality, counterfactuals, honours reading. [bibtex-entry]



27. Ehud Reiter and Robert Dale. Building natural language generation systems, Studies in natural language processing.. Cambridge University Press, Cambridge, U.K. ; New York, 2000.
    Note: 99014937 Ehud Reiter, Robert Dale. Includes bibliographical references and index.
    Keywords: computational linguistics, honours reading. [bibtex-entry]



28. Kenneth H. Rosen and John G. Michaels. Handbook of discrete and combinatorial mathematics. CRC Press, Boca Raton, FL, 2000.
    Note: 99048378 99048378 Kenneth H. Rosen, editor in chief, John G. Michaels, project editor ... [et al.]. Includes bibliographical references and index.
    Keywords: computational complexity, discrete mathematics, honours reading. [bibtex-entry]



29. M. Bratman. Faces of Intention, Cambridge Studies in Philosophy. Cambridge University Press, 1999.
    Keywords: honours reading, intentionality, belief desires intentions, BDI. [bibtex-entry]



30. Rod Downey and Michael R. Fellows. Parameterized complexity, Monographs in computer science.. Springer, New York, 1999.
    Note: R.G. Downey, M.R. Fellows. New Zealand authors. Includes bibliographical references (p. [489]-516) and index.
    Keywords: computational complexity, graph theory, honours reading. [bibtex-entry]



31. Jacques Ferber. Multi-Agent Systems. Addison Wesley, 1999.
    Keywords: agents, honours reading. [bibtex-entry]



32. Sanjay Jain. Systems that learn : an introduction to learning theory , Learning, development, and conceptual change. MIT Press, Cambridge, Mass., 2nd edition, 1999.
    Note: Sanjay Jain ... [et al.] ill. ; 24 cm A Bradford book.
    Keywords: machine learning, honours reading. [abstract] [download paper ] [bibtex-entry]



33. Frank C. Keil and Robert A. Wilson, editors. The MIT encyclopedia of the cognitive sciences. MIT Press, Cambridge, Mass., 1999.
    Note: 99011115 GB99-44540 edited by Robert A. Wilson and Frank C. Keil. A Bradford book. Includes bibliographical references and indexes.
    Keywords: honours reading, agents, cognitive science. [bibtex-entry]



34. Gerhard Weiss, editor. Multiagent systems : a modern approach to distributed artificial intelligence. MIT Press, Cambridge, Mass., 1999.
    Keywords: agents, artificial intelligence, honours reading. [abstract] [bibtex-entry]



35. Zhongwen Lu. Mathematical logic for computer science. World Scientific, Singapore ; River Edge, NJ, 2nd edition, 1998.
    Note: Lu Zhongwan ill. ; 23 cm.
    Keywords: proof theory, honours reading. [bibtex-entry]



36. Kim Marriott and P. J. Stuckey. Programming with constraints : an introduction. MIT Press, Cambridge, Mass., 1998.
    Note: 97040549 Kim Marriott and Peter J. Stuckey. Includes bibliographical references and index. 1. Constraints -- 2. Simplification, Optimization and Implication -- 3. Finite Constraint Domains -- 4. Constraint Logic Programs -- 5. Simple Modelling -- 6. Using Data Structures -- 7. Controlling Search -- 8. Modelling with Finite Domain Constraints -- 9. Advanced Programming Techniques -- 10. CLP Systems -- 11. Constraint Databases -- 12. Other Constraint Programming Languages.
    Keywords: logic programming, constraint satisfaction, graph theory, honours reading. [bibtex-entry]



37. Jeffrey Bradshaw. Software Agents. MIT Press, 1997.
    Keywords: agents, honours reading. [bibtex-entry]



38. 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] [bibtex-entry]



39. 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. [bibtex-entry]



40. 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] [bibtex-entry]



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



42. 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. [bibtex-entry]



43. 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] [bibtex-entry]



44. Nancy Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, 1996.
    Keywords: algorithmic complexity, computational complexity, algorithms, honours reading. [bibtex-entry]



45. 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. [bibtex-entry]



46. 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. [bibtex-entry]



47. Ronald Fagin. Reasoning about knowledge. MIT Press, Cambridge, Mass., 1995.
    Note: 94036477 94036477 Ronald Fagin ... [et al.]. Includes bibliographical references (p. 429-448) and indexes. 1. Introduction and Overview -- 2. A Model for Knowledge -- 3. Completeness and Complexity -- 4. Knowledge in Multi-Agent Systems -- 5. Protocols and Programs -- 6. Common Knowledge and Agreement -- 7. Knowledge-Based Programming -- 8. Evolving Knowledge -- 9. Logical Omniscience -- 10. Knowledge and Computation -- 11. Common Knowledge Revisited.
    Keywords: epistemic logic, Bayesian Theory, agents, model theory, honours reading, kripke structures. [bibtex-entry]



48. Andreu Mas-Colell, Michael Dennis Whinston, and Jerry R. Green. Microeconomic theory. Oxford University Press, New York, 1995.
    Keywords: game theory, honours reading. [bibtex-entry]



49. J. J. CH Meyer and W. van der Hoek. Epistemic Logic for Artificial Intelligence and Computer Science. Cambridge University Press, 1995.
    Keywords: epistemic logic, agents, honours reading, model theory. [abstract] [bibtex-entry]



50. Edward A. Feigenbaum, Julian Feldman, and Paul Armer, editors. Computers and thought. AAAI Press ; MIT Press, Menlo Park Cambridge, 1st AAAI Press edition, 1995.
    Note: Edited by Edward A. Feigenbaum & Julian Feldman ; [articles by Paul Armer ... et al.]. ill. ; 23 cm. Originally published: New York : McGraw-Hill, 1963.
    Keywords: artificial intelligence, honours reading, cognitive science. [abstract] [bibtex-entry]



51. Ralph D. Sunzi and Mei-Chün Sawyer. The art of war = [Sun-tzu ping fa], History and warfare.. Westview Press, Boulder, 1994.
    Note: 93047372 Sun-tzu ; translated, with introductions and commentary by Ralph D. Sawyer ; with the collaboration of Mei-Chün Lee Sawyer. Parallel title in Chinese characters. Includes bibliographical references and index. The Art of War in Translation. 1. Initial Estimations. 2. Waging War. 3. Planning Offensives. 4. Military Disposition. 5. Strategic Military Power. 6. Vacuity and Substance. 7. Military Combat. 8. Nine Changes. 9. Maneuvering the Army. 10. Configurations of Terrain. 11. Nine Terrains. 12. Incendiary Attacks. 13. Employing Spies -- Tomb Texts and Lost Writings -- Notes to the General Introduction and Historical Background -- Selected Notes to the Introduction -- Notes to the Translation -- Notes to the Tomb Texts and Lost Writings.
    Keywords: intentionality, philosophy, honours reading. [bibtex-entry]



52. Gerard Tel. Introduction to distributed algorithms. Cambridge University Press, Cambridge ; New York, 1994.
    Note: 94016147 Gerard Tel. Includes bibliographical references (p. 512-524) and index. 1. Introduction: Distributed Systems -- Pt. 1. Protocols. 2. The Model. 3. Communication Protocols. 4. Routing Algorithms. 5. Deadlock-free Packet Switching -- Pt. 2. Fundamental Algorithms. 6. Wave and Traversal Algorithms. 7. Election Algorithms. 8. Termination Detection. 9. Anonymous Networks. 10. Snapshots. 11. Synchrony in Networks -- Pt. 3. Fault Tolerance. 12. Fault Tolerance in Distributed Systems. 13. Fault Tolerance in Asynchronous Systems. 14. Fault Tolerance in Synchronous Systems. 15. Stabilization -- Pt. 4. Appendices. A. Pseudocode Conventions. B. Graphs and Networks.
    Keywords: agents, algorithms, honours reading, coordination. [bibtex-entry]



53. M. Ben-Ari. Mathematical logic for computer science, Prentice-Hall International series in computer science.. Prentice-Hall International, Hempel Hempstead [England], 1993.
    Note: 92022640 M. Ben-Ari. Includes bibliographical references (p. 274-277) and index.
    Keywords: proof theory, honours reading. [bibtex-entry]



54. Dov M. Gabbay, Christopher John Hogger, and J. A. Robinson. Handbook of logic in artificial intelligence and logic programming. Clarendon Press ; Oxford University Press, Oxford Oxford ; New York, 1993.
    Note: 92023358 //r98 edited by Dov M. Gabbay, and C.J. Hogger and J.A. Robinson. Includes bibliographical references and indexes. v. 1. Logical foundations -- v. 2. Deduction methodologies -- v. 3. Nonmonotonic reasoning and uncertain reasoning -- v. 4. Epistemic and temporal reasoning -- v. 5. Logic programming.
    Keywords: logic programming, artificial intelligence, epistemic logic, honours reading, proof theory, nonmonotonic reasoning. [bibtex-entry]



55. G. E. Mints. A short introduction to modal logic, CSLI lecture notes ; no. 30.. Center for the Study of Language and Information, Stanford, CA, 1992.
    Note: 92002924 Grigori Mints. Includes bibliographical references.
    Keywords: modal logic, proof theory, model theory, honours reading. [bibtex-entry]



56. Philip R. Cohen, Jerry L. Morgan, and Martha E. Pollack. Intentions in communication, Systems Development Foundation benchmark series.. MIT Press, Cambridge, Mass., 1990.
    Note: 89012759 //r91 edited by Philip R. Cohen, Jerry Morgan, and Martha E. Pollack. A Bradford book. Includes bibliographical references and index.
    Keywords: computational linguistics, honours reading, intentionality, agent communication languagess. [bibtex-entry]



57. Lincoln A. Wallen. Automated proof search in non-classical logics : efficient matrix proof methods for modal and intuitionistic logics, MIT Press series in artificial intelligence.. Cambridge, Mass., : M.I.T. Press, 1990.
    Keywords: modal logic, proof theory, model theory, honours reading. [abstract] [bibtex-entry]



58. Daniel Dennett. The Intetional Stance. MIT Press, 1989.
    Keywords: honours reading, intentionality, belief desires intentions, BDI. [bibtex-entry]



59. Andre Thayse. From modal logic to deductive databases. John Wiley & Sons, 1989.
    Keywords: modal logic, databases, honours reading. [bibtex-entry]



60. Lincoln A. Wallen. Automated Deduction in Nonclassical Logics: efficient matrix proof methods for modal and intuionistic logics. The MIT Press, 1989.
    Keywords: modal logic, proof theory, model theory, honours reading. [abstract] [bibtex-entry]



61. Michael Bratman. Intentions, Plans, and Practical Reason. Harvard University Press, 1987.
    Keywords: intentionality, belief desires intentions, BDI, honours reading. [bibtex-entry]



62. John Wylie Lloyd. Foundations of Logic Programming. Springer-Verlag, New York, NY, USA, 1987.
    Keywords: logic programming, honours reading. [bibtex-entry]



63. Lucille Alice Suchman. Plans and situated actions : the problem of human-machine communication. Cambridge University Press, Cambridge [Cambridgeshire] ; New York, 1987.
    Note: 87008013 //r96 Lucy A. Suchman. Includes indexes. Bibliography: p. 190-197.
    Keywords: cognitive science, intentionality, honours reading. [bibtex-entry]



64. Joseph Y. Halpern, International Business Machines Corporation., American Association for Artificial Intelligence., United States. Office of Naval Research., and Association for Computing Machinery., editors. Theoretical aspects of reasoning about knowledge : proceedings of the 1986 conference, March 19-22, 1986, Monterey, California. M. Kaufmann Publishers, Los Altos, Calif., 1986.
    Note: Edited by Joseph Y. Halpern ; cosponsored by IBM, American Association of Artificial Intelligence, and the Office of Naval Research, in cooperation with Association for Computing Machinery. Includes bibliographies and index.
    Keywords: modal logic, model theory, honours reading. [bibtex-entry]



65. Alan Gibbons. Algorithmic graph theory. Cambridge University Press, Cambridge ; New York, 1985.
    Note: Alan Gibbons. Includes bibliographies and indexes.
    Keywords: graph theory, theory of computation, computational complexity, honours reading. [bibtex-entry]



66. Melvin Fitting. Proof methods for modal and intuitionistic logics, Synthese library ; v. 169.. D. Reidel ; Sold and distributed in the U.S.A. and Canada by Kluwer Boston, Dordrecht, Holland ; Boston, U.S.A. Hingham, MA, 1983.
    Note: Melvin Fitting. Includes index. Bibliography: p. 526-539.
    Keywords: modal logic, proof theory, model theory, honours reading. [bibtex-entry]



67. Ehud Y. Shapiro. Algorithmic Program Debugging. MIT Press, 1983.
    Keywords: logic programming, inductive logic programming, honours reading. [bibtex-entry]



68. Dov M. Gabbay and Franz Guenthner, editors. Handbook of philosophical logic, Synthese library ; v. 164-167.. D. Reidel ; Sold and distributed in the U.S.A. and Canada by Kluwer Academic Publishers, Dordrecht ; Boston Hingham, MA, 1983.
    Note: Edited by D. Gabbay and F. Guenthner. Includes bibliographies and indexes. v. 1. Elements of classical logic -- v. 2. Extensions of classical logic -- v. 3. Alternatives in classical logic -- v. 4. Topics in the philosophy of language.
    Keywords: modal logic, epistemic logic, honours reading. [bibtex-entry]



69. Michael R. Garey and David S. Johnson. Computers and intractability : a guide to the theory of NP-completeness, A Series of books in the mathematical sciences.. W. H. Freeman, San Francisco, 1979.
    Note: Michael R. Garey, David S. Johnson. Includes indexes. Bibliography: p. [291]-325. NP-completeness.
    Keywords: computational complexity, algorithms, honours reading. [bibtex-entry]



70. John E. Hopcroft and Jeffrey D. Ullman. Introduction to automata theory, languages, and computation. Addison-Wesley, Reading, Mass., 1979.
    Note: John E. Hopcroft, Jeffrey D. Ullman. ill. ; 24 cm. Includes index.
    Keywords: theory of computation, computational complexity, honours reading. [bibtex-entry]



71. David K. Lewis. Counterfactuals. Harvard University Press, Cambridge,, 1973.
    Note: [by] David K. Lewis. Includes bibliographical references.
    Keywords: model theory, honours reading. [bibtex-entry]



72. Jaakko Hintikka. Knowledge and Belief: An Introduction to the Logic of the Two Notions. Cornell University Press, Ithaca, N. Y., 1962.
    Keywords: modal logic, epistemic logic, honours reading. [bibtex-entry]



73. Mohammad Ilyas and Imad Mahgoub. Handbook of Sensor Networks . CRC Press., .
    Note: [electronic resource] (Engnetbase) This is a record with electronic access and is only available through the Library's Web catalogue or through the Internet. Mode of access: Internet.
    Keywords: sensor networks, honours reading. [abstract] [download paper ] [bibtex-entry]

1. Luc de Raedt and Kristian Kersting. Probabilistic Inductive Logic Programming. In Luc De Raedt, Paolo Frasconi, Kristian Kersting, and Stephen Muggleton, editors,Probabilistic Inductive Logic Programming - Theory and Applications, Lecture Notes in Computer Science, pages 1--27. Springer, 2008.
   Keywords: inductive logic programming, logic programming, honours reading. [bibtex-entry]



2. Jiefei Ma, Alessandra Russo, Krysia Broda, and Keith Clark. DARE: A System for Distributed Abductive Reasoning. Autonomous Agents and Multi-Agent Systems, 16(3):271--297, 2008.
   Keywords: abductive logic programming, inductive logic programming, machine learning, honours reading. [bibtex-entry]



3. Chiaki Sakama and Katsumi Inoue. Coordination in Answer Set Programming. ACM Transactions on Computational Logic, 9(2):1--30, 2008.
   Keywords: logic programming, answer set programming, honours reading. [bibtex-entry]



4. Mark Hopkins and Judea Pearl. Causality and Counterfactuals in the Situation Calculus. J Logic Computation, 17(5):955--982, 2007.
   Keywords: honours reading, situation calculus, causality. [bibtex-entry]



5. Jeff Kramer. Is abstraction the key to computing? http://doi.acm.org.ezproxy.lib.unimelb.edu.au/10.1145/1232743.1232745. Commun. ACM, 50(4):36--42, 2007.
   Keywords: honours reading. [bibtex-entry]



6. Ami Marowka. Parallel computing on any desktop. Commun. ACM, 50(9):74--78, 2007.
   Keywords: agent programming languages, honours reading. [download paper ] [bibtex-entry]



7. P. McBurney, D. Hitchcock, and S. Parsons. The eightfold way of deliberation dialogue. International Journal of Intelligent Systems, 22(1):95--132, 2007.
   Keywords: argumentation, honours reading. [download paper ] [bibtex-entry]



8. Peter Menzies. Counterfactual theories of causation. In Edward N. Zalta, editor,Stanford Encyclopedia of Philosophy. Stanford University, 2007.
   Keywords: counterfactual reasoning, honours reading. [download paper ] [bibtex-entry]



9. Barbara Morawska. General E-unification with Eager Variable Elimination and a Nice Cycle Rule. Journal of Automated Reasoning, 39(1):77--106, 2007.
   Note: TY - JOUR.
   Keywords: model theory, inductive logic programming, unification, honours reading. [abstract] [download paper ] [bibtex-entry]



10. Soren Holbech Nielsen and Simon Parsons. An application of formal argumentation: Fusing Bayesian networks in multi-agent systems.. Artificial Intelligence, 171(10-15):754--775, 2007.
    Keywords: argumentation, honours reading. [bibtex-entry]



11. Tuoma Snadholm. Expressive commerce and its application to sourcing: how we conducted $35 billion of generalized combinatorical auctions. AI Magazine, 28(3):45--58, 2007.
    Keywords: honours reading, game theory. [bibtex-entry]



12. Davy Van Nieuwenborgh, Marina De Vos, Stijn Heymans, and Dirk Vermeir. Hierarchical Decision Making in Multi-agent Systems Using Answer Set Programming. In Computational Logic in Multi-Agent Systems (CLIMA VII), volume 4371 of Lecture Notes in Computer Science, pages 20--40. Springer, 2007.
    Keywords: logic programming, answer set programming, honours reading. [bibtex-entry]



13. R. Mailler and V. Lesser. A Cooperative mediation-based protocol for dynamic distributed resource allocation. IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 36(1):80--91, 2006.
    Keywords: multiagent coordination, honours reading, agent programming languages. [download paper ] [bibtex-entry]



14. Francesco Savelli. Existential assertions and quantum levels on the tree of the situation calculus. Artificial Intelligence, 170:643--652, 2006.
    Keywords: honours reading, situation calculus. [bibtex-entry]



15. J. van Benthem, J. van Eijck, and B. Kooi. Logics of communication and change. Information and Computation, 204:1620--1662, 2006.
    Keywords: situation calculus, dynamic logic, honours reading, epistemic logic, propositional dynamic logic. [bibtex-entry]



16. Ramon Bejar, Carmel Domshlak, Cèsar Fernandez, Carla Gomes, Bhaskar Krishnamachari, Bart Selman, and Magda Valls. Sensor networks and distributed CSP: communication, computation and complexity. Artificial Intelligence, 161(1-2):117--147, 2005.
    Keywords: algorithms, honours reading, constraint satisfaction, sensor networks. [bibtex-entry]



17. Ramon Bejar, Carmel Domshlak, Cesar Fernandez, Carla Gomes, Bhaskar Krishnamachari, Bart Selman, and Magda Valls. Sensor networks and distributed CSP: communication, computation and complexity. Artificial Intelligence, 161:117--147, 2005.
    Keywords: computational complexity, sensor networks, honours reading. [bibtex-entry]



18. A. Broder and M. Mitzenmacher. Network Applications of Bloom Filters: A Survey. Internet Mathematics, 2005.
    Keywords: sensor networks, honours reading. [bibtex-entry]



19. Bob Colwell. Presentation lessons from comedians. IEEE Computer, 38(9):10--13, 2005.
    Keywords: honours reading. [bibtex-entry]



20. Ernest Davis. Knowledge and communication: A first-order theory. Artificial Intelligence, 166(1-2):1--256, 2005.
    Keywords: Epistemic logic, agent programming languages, honours reading, modal logic. [bibtex-entry]



21. Yolanda Gil. Description logics and planning. AI Magazine, 26(2):73--84, 2005.
    Keywords: graph theory, ontologies, honours reading. [bibtex-entry]



22. M. T. Haijiaghayi, M. Bahramgiri, and V. S. Mirrokni. Fault-tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks. ACM/Kluwer Wireless Networks, 2005.
    Note: 11th IEEE International Conference on Computer Communications and Networks, October, 2002, pp. 392-398.
    Keywords: sensor networks, honours reading, graph theory. [bibtex-entry]



23. Peter Hawkins, Vitaly Lagoon, and Peter J. Stuckey. Solving Set Constraint Satisfaction Problems using ROBDDs. Journal of Artificial Intelligence Research (JAIR), 24:109--156, 2005.
    Keywords: constraint satisfaction, honours reading. [bibtex-entry]



24. Samuel R. Madden, Michael J. Franklin, Joseph M. Hellerstein, and Wei Hong. TinyDB: an acquisitional query processing system for sensor networks. ACM Trans. Database Syst., 30(1):122--173, 2005.
    Keywords: sensor networks, honours reading. [abstract] [bibtex-entry]



25. P. J. Modi, W. Shen, M. Tambe, and M. Yokoo. Adopt: asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence, 161(1-2):149--180, 2005.
    Keywords: algorithms, honours reading, constraint satisfaction, DCOP, DCSP. [bibtex-entry]



26. Liviu Panait and Sean Luke. Cooperative Multi-Agent Learning: The State of the Art. Autonomous Agents and Multi-Agent Systems, 11(3):387--434, 2005.
    Keywords: machine learning, inductive logic programming, honours reading, agents. [bibtex-entry]



27. Liviu Panait and Sean Luke. Cooperative Multi-Agent Learning: The State of the Art. Autonomous Agents & Multi-Agent Systems, 11(3):387--434, 2005.
    Keywords: inductive logic programming, machine learning, honours reading. [bibtex-entry]



28. Neal Patwari, Joshua N. Ash, Spyros Kyperountas, Alfred O. Hero III, Randolph L. Moses, and Neiryer S. Correal. Locating the Nodes (cooperative localization in wireless sensor networks). IEEE Signal Processing Magazine, 22(4):54--69, 2005.
    Keywords: sensor networks, honours reading. [abstract] [bibtex-entry]



29. A. Ricci and M. Viroli. Coordination artifacts: a unifying abstraction for engineering environment-mediated coordination in MAS. Informatica, 29(4):433--443, 2005.
    Note: Cited Reference Count: 44 Slovenia.
    Keywords: agent-oriented software engineering, honours reading. [abstract] [download paper ] [bibtex-entry]



30. Michael Thielscher. FLUX: A logic programming method for reasoning about agents. Theory and Practice of Logic Programming, 5:533--565, 2005.
    Keywords: agent programming languages, honours reading, situation calculus. [abstract] [bibtex-entry]



31. Samir Aknine, Suzanne Pinson, and Melvin F. Shakun. An Extended Multi-Agent Negotiation Protocol. Autonomous Agents and Multi-Agent Systems, 8(1):5--45, 2004.
    Keywords: agent programming languages, coordination, teamwork, honours reading. [bibtex-entry]



32. Seema Bandyopadhyay and Edward J. Coyle. Minimizing communication costs in hierarchically-clustered networks of wireless sensors. Computer Networks, 44:1--16, 2004.
    Keywords: sensor networks, honours reading. [bibtex-entry]



33. Mark D'Inverno, Michael Luck, Michael Georgeff, David Kinny, and Michael Wooldridge. The dMARS Architecture: A Specification of the Distributed Multi-Agent Reasoning System. Autonomous Agents & Multi-Agent Systems, 9:5--53, 2004.
    Keywords: agent programming languages, honours reading. [bibtex-entry]



34. Michael Fisher. Temporal Development Methods for Agent-Based. Autonomous Agents and Multi-Agent Systems, 10(1):41--66, 2004.
    Note: TY - JOUR.
    Keywords: agent programming languages, honours reading, temporal logic. [download paper ] [bibtex-entry]



35. Andrew Garland and Richard Alterman. Autonomous Agents that Learn to Better Coordinate. Autonomous Agents and Multi-Agent Systems, 8(3):267--301, 2004.
    Note: TY - JOUR.
    Keywords: agent programming languages, honours reading. [download paper ] [bibtex-entry]



36. George Gottlob, Phokion G. Kolaitis, and Thomas Schwentick. Existential second-order Logic over graphs: charting the tractability frontier. Journal of the ACM, 51(2):312--362, 2004.
    Keywords: graph theory, honours reading, computational complexity. [bibtex-entry]



37. Alejandro Guerra-Hernandez, Amal El Fallah-Seghrouchni, and Henry Soldano. Learning in BDI Multi-Agent Systems. Lecture Notes in Computer Science, 3259:218--233, 2004.
    Keywords: BDI, inductive logic programming, abductive logic programming, honours reading. [bibtex-entry]



38. M. T. Hajiaghayi, E. D. Demaine, N. Nishimura, P. Ragde, and D. Thilikos. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. Journal of Computer and System Sciences, 69(2):166--195, 2004.
    Keywords: graph matching, honours reading, graph theory. [bibtex-entry]



39. Joseph Y. Halpern and Daphne Koller. Representation Dependence in Probabilistic Inference. Journal of Artificial Intelligence Research, 21:319--356, 2004.
    Keywords: Bayesian theory, Epistemic logic, machine learning, honours reading. [bibtex-entry]



40. Antoine Joux. A One Round Protocol for Tripartite Diffie-Hellman. J. Cryptology, 17(4):263--276, 2004.
    Keywords: cryptography, honours reading. [bibtex-entry]



41. Oliver Kutz, Carsten Lutz, Frank Wolter, and Michael Zakharyaschev. eta-connections of abstract description systems. Artificial Intelligence, 156(1):1--73, 2004.
    Note: TY - JOUR.
    Keywords: epistemic logic, agent programming languages, honours reading, modal logic. [download paper ] [bibtex-entry]



42. Michael Luck, Peter McBurney, and Chris Preist. A Manifesto for Agent Technology: Towards Next Generation Computing. Autonomous Agents and Multi-Agent Systems, 9(3):203--252, 2004.
    Keywords: agents, honours reading, sensor networks. [bibtex-entry]



43. L. A. F. Park, K. Ramamohanarao, and M. Palaniswami. Fourier domain scoring: a novel document ranking method. Knowledge and Data Engineering, IEEE Transactions on, 16(5):529--539, 2004.
    Keywords: machine leaning, agents, honours reading. [bibtex-entry]



44. Carla Piazza and ALBERTO POLICRITI. Ackermann encoding, bisimulations and OBDDs. Theory and Practice of Logic Programming, 4:695--718, 2004.
    Keywords: graph theory, model theory, honours reading. [abstract] [bibtex-entry]



45. Sebastian Sardina, Giuseppe De Giacomo, Yves Lesperance, and Hector J. Levesque. On the Semantics of Deliberation in Indigolog - from Theory to Implementation. Annals of Mathematics & Artificial Intelligence, 41(2-4):259--299, 2004.
    Keywords: agent programming languages, modal logic, honours reading, situation calculus, GOLOG. [abstract] [bibtex-entry]



46. JAcob Toran. On the hardness of graph isomorphism. SIAM J. Comput, 33(3):1093--1108, 2004.
    Keywords: graph theory, computational complexity, honours reading. [bibtex-entry]



47. Marina De Vos and Dirk Vermeir. Extending Answer Sets for Logic Programming Agents. Annals of Mathematics and Artificial Intelligence, 42(1-3):103--139, 2004.
    Keywords: answer set programming, logic programming, agent programming languages, honours reading. [bibtex-entry]



48. Alec Woo, Sam Madden, and Ramesh Govindan. Networking support for query processing in sensor networks. Communications of the ACM, 47(6):47--52, 2004.
    Keywords: sensor networks, honours reading. [abstract] [bibtex-entry]



49. Franco Zambonelli and Andrea Omicini. Challenges and Research Directions in Agent-Oriented Software Engineering. Autonomous Agents and Multi-Agent Systems, 9(3):253--283, 2004.
    Keywords: agent-oriented software engineering, agents, honours reading. [bibtex-entry]



50. Franco Zambonelli and Andrea Omicini. Challenges and Research Directions in Agent-Oriented Software Engineering. Autonomous Agents and Multi-Agent Systems, 9(3):253--283, 2004.
    Note: TY - JOUR.
    Keywords: honours reading, agents. [download paper ] [bibtex-entry]



51. J. Al-Jaroodi, N. Mohamed, H. Jiang, and D. Swanson. Middleware infrastructure for parallel and distributed programming models in heterogeneous systems. IEEE Transactions on Parallel & Distributed Systems, 14(11):1100--11, 2003.
    Note: Publisher: IEEE, USA.
    Keywords: sensor networks, simulation, honours reading. [abstract] [bibtex-entry]



52. P. Bellavista, A. Corradi, R. Montanari, and C. Stefanelli. Context-aware middleware for resource management in the wireless Internet. IEEE Transactions on Software Engineering, 29(12):1086--99, 2003.
    Note: Publisher: IEEE, USA.
    Keywords: sensor networks, simulation, honours reading. [abstract] [bibtex-entry]



53. Dan Boneh and Matthe Franlin. Identity-Based Encryption from the Weil Pairing. SIAM J. Comput., 32:583, 2003.
    Keywords: cryptography, honours reading. [bibtex-entry]



54. M. E. Bratman. Autonomy and hierarchy. Social Philosophy & Policy, 20(2):156--176, 2003.
    Keywords: BDI, agent communication languages, agent programming languages, honours reading, philosophy. [download paper ] [bibtex-entry]



55. J. Dix, H. Munoz-Avila, D. S. Nau, and L. Zhang. IMPACTing SHOP: Putting an AI planner into a multi-agent environment. Annals of Mathematics & Artificial Intelligence, 37(4):381--407, 2003.
    Note: Publisher: Kluwer Academic Publishers, Netherlands.
    Keywords: planning, honours reading, agent programming languages, computational complexity. [abstract] [bibtex-entry]



56. A. Dovier and C. Piazza. The Subgraph Bisimulation Problem. IEEE Transactions on Knowledge & Data Engineering, 15(4):1055--6, 2003.
    Note: Publisher: IEEE, USA.
    Keywords: graph theory, model theory, honours reading, graph matching. [abstract] [bibtex-entry]



57. Matthias Fichtner, Axel Gromann, and Michael Thielscher. Intelligent execution monitoring in dynamic environments. Fundam. Inf., 57(2-4):371--392, 2003.
    Keywords: multiagent coordination, honours reading, agent programming languages. [bibtex-entry]



58. Carlos Guestrin, Daphne Koller, Ronald Parr, and Shobha Venkataraman. Efficient Solution Algorithms for Factored MDPs. Journal of Artificial Intelligence Research (JAIR), 19:399--468, 2003.
    Keywords: Markov theory, honours reading. [bibtex-entry]



59. M. L. Kahn and C. D. T. Cicalese. CoABS Grid scalability experiments. Autonomous Agents & Multi-Agent Systems, 7(1-2):171--8, 2003.
    Note: Publisher: Kluwer Academic Publishers, Netherlands.
    Keywords: sensor networks, simulation, honours reading. [abstract] [bibtex-entry]



60. Yves Lesperance. On the Epistemic Feasibility of Plans in Multiagent Systems Specifications. IGPL, 11(2):161--178, 2003.
    Keywords: agent programming languages, modal logic, honours reading. [abstract] [bibtex-entry]



61. Drew McDermott. Ray Reiter's Knowledge in Action: A review. AI Magazine, 24(2):101--103, 2003.
    Keywords: situation calculus, honours reading, artificial intelligence. [bibtex-entry]



62. S. Roundy, P. K. Wright, and J. Rabaey. A Study of Low Level Vibrations as a Power Source for Wireless Sensor Nodes. Computer Communications, 26(11):1131--1144, 2003.
    Keywords: sensor networks, honours reading. [bibtex-entry]



63. Richard B. Scherl and Hector J. Levesque. Knowleddge, action, and the frame problem. Artificial Intelligence, 144:1--39, 2003.
    Keywords: situation calculus, honours reading. [bibtex-entry]



64. JOHN A. STANKOVIC, TAREK F. ABDELZAHER, CHENYANG LU, LUI SHA, and JENNIFER C. HOU. Real-Time Communication and Coordination in Embedded Sensor Networks. Proceedings of the IEEE, 91(7):1002--1022, 2003.
    Keywords: sensor networks, honours reading. [abstract] [bibtex-entry]



65. P. van Roy, P. Brand, D. Duchier, S. Haridi, M. Henz, and C. Schulte. Logic programming in the context of multiparadigm programming: the Oz experience.. Theory and Practice of Logic Programming, 3(6):717--763, 2003.
    Keywords: agent programming languages, logistics, honours reading. [abstract] [bibtex-entry]



66. I. F. Akyildiz, Su Weilian, Y. Sankarasubramaniam, and E. E. Cayirci. A survey on sensor networks. IEEE Communications Magazine, 40(8):102--114, 2002.
    Keywords: sensor networks, simulation, honours reading. [bibtex-entry]



67. Ronal J/ Brachman. Systems that know what they're doing. IEEE Intelligent Systems, pp 67--71, 2002.
    Keywords: agents, honours reading. [bibtex-entry]



68. W. de Vries, F. S. de Boer, K. Hindriks, W. van der Hoek, and J. J. C. Meyer. A programming language for coordinating group actions. In From Theory to Practice in Multi-Agent Systems, volume 2296 of Lecture Notes in Artificial Intelligence, pages 313--321. 2002.
    Keywords: agent programming languages, multiagent coordination, graph theory, constraint satisfaction, honours reading. [abstract] [download paper ] [bibtex-entry]



69. J. Y. Halpern, Y. Moses, and O. Waarts. A characterization of eventual Byzantine agreement. SIAM JOURNAL ON COMPUTING, 31(3):838--865, 2002.
    Keywords: multiagent coordination, honours reading, modal logic. [bibtex-entry]



70. M. Kaneko, T. Nagashima, N-Y Suzuki, and Y. Tanaka. A map of common knowledge logics. Studia Logica, 71(1):57--86, 2002.
    Keywords: modal logic, honours reading. [abstract] [bibtex-entry]



71. deborah L. McGuinness, Richard Fikes, James Hendler, and Lynn Andrea Stein. DAML+OIL: An ontology languages for the semantic web. IEEE Intelligent Systems, 2002.
    Keywords: ontologies, honours reading. [bibtex-entry]



72. J. Pearl. Reasoning with cause and effect. AI Magazine, 23(1):95--111, 2002.
    Note: Publisher: American Assoc. Artificial Intelligence, USA.
    Keywords: causality, Bayesian theory, counterfactuals, honours reading. [abstract] [bibtex-entry]



73. A. Poggi, G. Rimassa, and P. Turci. What agent middleware can (and should) do for you. Applied Artificial Intelligence, 16(9-10):677--98, 2002.
    Note: Publisher: Taylor & Francis, UK.
    Keywords: sensor networks, simulation, honours reading, logistics. [abstract] [bibtex-entry]



74. D. V. Pynadath and M. Tambe. The Communicative Multiagent Team Decision Problem: Analyzing Teamwork Theories and Models. Journal of Artificial Intelligence Research, 16:389--423, 2002.
    Keywords: computational complexity, teamwork, Markov theory, graph theory, agent communication languagess, honours reading. [abstract] [bibtex-entry]



75. nigel shadbolt. Grandly challenged. IEEE Intelligent Systems, 03:2--4, 2002.
    Keywords: agents, honours reading. [bibtex-entry]



76. Johan van Benthem. Extensive Games as Process Models. Journal of Logic, Language and Information, 11(3):289--313, 2002.
    Keywords: game theory, model theory, algorithms, honours reading. [bibtex-entry]



77. F. Alonso, M. d'Inverno, D. Kudenko, M. Luck, and J. Noble. Learning in Agents and Multi-Agent Systems. Knowledge Engineering Review, 16(3):277--284, 2001.
    Keywords: machine learning, agents, honours reading. [bibtex-entry]



78. C. Areces, H. de Nivelle, and M. de Rijke. Resolution in Modal, Description and Hybrid Logic. Journal of Logic and Computation, 11(5):717--736, 2001.
    Keywords: hybrid logic, modal logic, proof theory, logic programming, agent programming languages, honours reading. [abstract] [bibtex-entry]



79. Robert Bull and Krister Segerberg. Basic Modal Logic. In Dov M. Gabbay and Franz Guenthner, editors,Handbook of philosophical logic, volume 2, pages 1--88. Kluwer Academic Publishers, Dordrecht ; Boston, 2nd edition, 2001.
    Note: 2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.
    Keywords: modal logic, honours reading, model theory, kripke structures. [abstract] [download paper ] [bibtex-entry]



80. John P. Burgess. Basic Tense Logic. In Dov M. Gabbay and Franz Guenthner, editors,Handbook of philosophical logic, volume 2, pages 1--88. Kluwer Academic Publishers, Dordrecht ; Boston, 2nd edition, 2001.
    Note: 2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.
    Keywords: modal logic, honours reading, model theory. [abstract] [download paper ] [bibtex-entry]



81. D. Cabeza and M. Hermenegildo. Distributed WWW programming using (Ciao-) Prolog and the PiLLoW library. Theory and Practice of Logic Programming, 1:251--282, 2001.
    Keywords: agent programming languages, honours reading, logic programming. [abstract] [download paper ] [bibtex-entry]



82. Christiano Castelfranchi. The theory of social functions: challenges for computational social science and multi-agent learning. Journal of cognitive systems research, 1:5--38, 2001.
    Keywords: cognitive science, machine learning, agents, intentionality, honours reading. [bibtex-entry]



83. Nino B. Cocchiarella. Philosophical perspectives on quantification in tense and modal logic. In Dov M. Gabbay and Franz Guenthner, editors,Handbook of philosophical logic, volume 2, pages 1--88. Kluwer Academic Publishers, Dordrecht ; Boston, 2nd edition, 2001.
    Note: 2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.
    Keywords: modal logic, honours reading, model theory. [abstract] [download paper ] [bibtex-entry]



84. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. D. Ullman, and C. Yang. Finding interesting associations without support pruning. Knowledge and Data Engineering, IEEE Transactions on, 13(1):64--78, 2001.
    Keywords: machine leaning, honours reading. [abstract] [bibtex-entry]



85. JAmes W. Garson. Quantification in Modal Logic. In Dov M. Gabbay and Franz Guenthner, editors,Handbook of philosophical logic, volume 2, pages 1--88. Kluwer Academic Publishers, Dordrecht ; Boston, 2nd edition, 2001.
    Note: 2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.
    Keywords: modal logic, honours reading, model theory. [abstract] [download paper ] [bibtex-entry]



86. Piotr J. Gmytrasiewicz and Edmund H. Durfee. Rational Communication in Multi-Agent Environments.. Autonomous Agents and Multi-Agent Systems, 4(3):A233--272, 2001.
    Keywords: agent communication languagess, honours reading. [bibtex-entry]



87. Junling Hu and Michael P. Weliman. Learning about other agents in a dynamic multiagent system. Journal of cognitive systems research, 1:67--79, 2001.
    Keywords: cognitive science, machine learning, agents, honours reading. [bibtex-entry]



88. P. McBurney and S. Parsons. Representing epistemic uncertainty by means of dialectical argumentation. Annals of Mathematics and Artificial Intelligence, 32:125--169, 2001.
    Keywords: argumentation, honours reading, logistics. [bibtex-entry]



89. M. Schut and M. Wooldridge. The control of reasoning in resource-bounded agents. The Knowledge Engineering Review, 16(3):215--40, 2001.
    Note: Publisher: Cambridge University Press, UK.
    Keywords: agent programming languages, honours reading. [abstract] [bibtex-entry]



90. A. Srinivasan. Extracting context-sensitive models in inductive logic programming. Machine Learning, 44(3):301--324, 2001.
    Note: Times Cited: 0 Article English Cited References Count: 37 446qq.
    Keywords: inductive logic programming, unification, honours reading. [abstract] [download paper ] [bibtex-entry]



91. H. P. Storr. Planning in the fluent calculus using binary decision diagrams. AI Magazine, 22(3):103--105, 2001.
    Keywords: agent programming languages, situation calculus, honours reading. [abstract] [download paper ] [bibtex-entry]



92. Ron Sun. Computation, reduction, and releology of conciousness. Journal of cognitive systems research, 1:241--249, 2001.
    Keywords: cognitive science, philosophy, honours reading. [bibtex-entry]



93. Richard H. Thomason. Combinations of tense and modality. In Dov M. Gabbay and Franz Guenthner, editors,Handbook of philosophical logic, volume 2, pages 1--88. Kluwer Academic Publishers, Dordrecht ; Boston, 2nd edition, 2001.
    Note: 2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.
    Keywords: modal logic, honours reading, model theory. [abstract] [download paper ] [bibtex-entry]



94. Johan van Benthem. Games in Dynamic-Epistemic Logic. Bulletin of Economic Research, 53(4):219--48, 2001.
    Keywords: epistemic logic, game theory, algorithms, honours reading. [abstract] [bibtex-entry]



95. Johan van Benthem. Correspondence theory. In Dov M. Gabbay and Franz Guenthner, editors,Handbook of philosophical logic, volume 2, pages 1--88. Kluwer Academic Publishers, Dordrecht ; Boston, 2nd edition, 2001.
    Note: 2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.
    Keywords: modal logic, honours reading, model theory. [abstract] [download paper ] [bibtex-entry]



96. C. Boutilier, R. Dearden, and M. Goldszmidt. Stochastic dynamic programming with factored representations. Artificial Intelligence, 121(1-2):49--107, 2000.
    Keywords: Markov theory, honours reading. [abstract] [bibtex-entry]



97. T. Eiter, V. S. Subrahmanian, and T. J. Rogers. Heterogeneous active agents. III. Polynomially implementable agents. Artificial Intelligence, 117(1):107--67, 2000.
    Note: Publisher: Elsevier, Netherlands.
    Keywords: agent programming languages, honours reading. [abstract] [bibtex-entry]



98. Peter A. Flach. On the Logic of Hypothesis Generation. In Peter A. Flach and Antonis C. Kakas, editors,Abduction and Induction: Essays on Their Relation and Integration, pages 89--106. Kluwer Academic Publishers, 2000.
    Keywords: inductive logic programming, abductive logic programming, honours reading. [bibtex-entry]



99. Peter A. Flach and Antonis C. Kakas. Abductive and Inductive Reasoning: Background and Issues. In Peter A. Flach and Antonis C. Kakas, editors,Abduction and Induction: Essays on Their Relation and Integration, pages 1--27. Kluwer Academic Publishers, 2000.
    Keywords: inductive logic programming, abductive logic programming, honours reading. [bibtex-entry]



100. G De Giacomo, Y. Lesperance, and H. J. Levesque. ConGolog, a concurrent programming language based on the situation calculus.. Artificial Intelligence, 121(1-2):109--169, 2000.
     Keywords: situation calculus, agent programming languages, honours reading, logistics, GOLOG. [bibtex-entry]



101. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, vol.124, no.2:243--282, 2000.
     Keywords: agent programming languages, multiagent coordination, graph theory, constraint satisfaction, honours reading, DCOP, DCSP. [abstract] [bibtex-entry]



102. J. Y. Halpern. Axiomatizing causal reasoning. Journal of Artificial Intelligence Research, 12:317--37, 2000.
     Note: Publisher: AI Access Foundation & Morgan Kaufmann Publishers, USA.
     Keywords: causality, honours reading, counterfactuals. [abstract] [bibtex-entry]



103. Koen V. Hindriks, Frank S. de Boer, Wiebe van der Hoek, and John-Jules Ch. Meyer. Semantics of Communicating Agents Based on Deduction and Abduction. Lecture Notes In Computer Science, 1916(Issues in Agent Communication):63--79, 2000.
     Keywords: agent communication languages, honours reading. [bibtex-entry]



104. Mamadou Tadiou Kone, Akira Shimazu, and Tatsuo Nakajima. The State of the Art in Agent Communication Languages. Knowledge and Information Systems, 2(3), 2000.
     Keywords: agent communication languagess, honours reading. [bibtex-entry]



105. Nicolas Lachiche. Abduction and Induction From a Non-Monotonic Reasoning Perspective. In Peter A. Flach and Antonis C. Kakas, editors,Abduction and Induction: Essays on Their Relation and Integration, pages 107--116. Kluwer Academic Publishers, 2000.
     Keywords: abductive logic programming, inductive logic programming, machine learning, honours reading. [bibtex-entry]



106. M. Wooldridge. Intelligent Agents. In G. Weiss, editor,Multiagent Systems A Modern Approach to Distributed Artificial Intelligence, pages 27--77. MIT Press, 2000.
     Keywords: agents, honours reading. [bibtex-entry]



107. Makoto Yokoo and Katsutoshi Hirayama. Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems, 3(2):185--207, 2000.
     Keywords: algorithms, honours reading, constraint satisfaction, logistics. [bibtex-entry]



108. Jim Blythe. Decision-Theoretic Planning. AI Magazine, 20(2):37--54, 1999.
     Keywords: planning, honours reading, decision theory. [bibtex-entry]



109. Craig Boutilier, Thomas Dean, and Steve Hanks. Decision-Theoretic Planning: Structural Assumptions and Computational Leverage. Journal of Artificial Intelligence Research, 11:1--94, 1999.
     Keywords: planning, honours reading, decision theory. [bibtex-entry]



110. Craig Boutilier, Thomas Dean, and Steve Hanks. Decision-Theoretic Planning: Structural Assumptions and Computational Leverage. Journal of Artificial Intelligence Research, 11:1--94, 1999.
     Keywords: Markov theory, honours reading. [bibtex-entry]



111. B. Chandrasekaran, J. R. Josephson, and V. R. Benjamins. Ontologies: What are they? wy do we need them?. IEEE Intelligent Systems and their applications, 14(1):20--26, 1999.
     Keywords: ontologies, honours reading. [bibtex-entry]



112. B. Chandrasekaran, J. R. Josephson, and V. R. Benjamins. What are agent-oriented software engineering, and why do we need them?. IEEE Intelligent Systems, 14(1):20--6, 1999.
     Note: Publisher: IEEE, USA.
     Keywords: ontologies, honours reading. [abstract] [bibtex-entry]



113. T. Eiter and V. S. Subrahmanian. Heterogeneous active agents. II. Algorithms and complexity. Artificial Intelligence, 108(1-2):257--307, 1999.
     Note: Publisher: Elsevier, Netherlands.
     Keywords: agent programming languages, honours reading. [abstract] [bibtex-entry]



114. T. Eiter, V. S. Subrahmanian, and G. Pick. Heterogeneous active agents. I. Semantics. Artificial Intelligence, 108(1-2):179--255, 1999.
     Note: Publisher: Elsevier, Netherlands.
     Keywords: agent programming languages, honours reading. [abstract] [bibtex-entry]



115. N. Friedman and J. Y. Halpern. Belief revision: a critique. Journal of Logic, Language & Information, 8(4):401--20, 1999.
     Note: Publisher: Kluwer Academic Publishers, Netherlands.
     Keywords: belief revision, honours reading. [abstract] [bibtex-entry]



116. G. De Giacomo and H. J. Levesque. An incremental interpreter for high-level programs with sensing. In H. J. Levesque and F. Pirri, editors,Logical Foundation for cognitive agents: contributions in honor of Ray Reiter, pages 86--102. Springer, Berlin, 1999.
     Keywords: agent programming languages, situation calculus, honours reading. [bibtex-entry]



117. Barbara J. Grosz, Luke Hunsberger, and Sarit Kraus. Planning and Acting Together.. Ai magazine., 20(4):23, 1999.
     Keywords: planning, honours reading, agent programming languages, logistics. [bibtex-entry]



118. Joseph Y. Halpern and Richard A. Shore. Reasoning about Common Knowledge with Infinitely Many Agents. In Logic in Computer Science, pages 384--393. 1999.
     Keywords: epistemic logic, honours reading. [bibtex-entry]



119. K. V. Hindriks, F. S. De Boer, Wiebe van der Hoek, and J. Jc Meyer. Agent programming in 3APL. Autonomous Agents & Multi-Agent Systems, 2(4):357--401, 1999.
     Note: Publisher: Kluwer Academic Publishers, Netherlands.
     Keywords: honours reading, agent programming languages, belief desires intentions, BDI, logistics. [abstract] [bibtex-entry]



120. Michael N. Huhns and Larry M. Stephens. Multiagent Systems and Societies of Agents. In Gerhard Weiss, editor,Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, pages 79--120. MIT Press, Cambridge, MA, USA, 1999.
     Keywords: agents, artificial intelligence, honours reading. [bibtex-entry]



121. Anil K. Jain, M. Narasimha Murty, and Patrick J. Flynn. Data Clustering: A Review. ACM Computing Surveys, 31(3):264--323, 1999.
     Keywords: sensor networks, honours reading, machine learning. [bibtex-entry]



122. Y. Labrou, T. Finin, and Y. Peng. Agent communication languages: The current landscape. IEEE Intelligent Systems, 14(2):45--52, 1999.
     Keywords: Agent communication languagess, honours reading, logistics. [bibtex-entry]



123. Evelina Lamma, Paola Mello, Michela Milano, and Fabrizio Riguzzi. Integrating Induction and Abduction in Logic Programming. Information Sciences, 116(1):25--54, 1999.
     Keywords: logic programming, inductive logic programming, abductive logic programming, honours reading. [bibtex-entry]



124. Yves Lesperance. Situation Calculus. In Frank C. Keil and Robert A. Wilson, editors,The MIT encyclopedia of the cognitive sciences, pages 771--772. MIT Press, Cambridge, Mass., 1999.
     Note: 99011115 GB99-44540 edited by Robert A. Wilson and Frank C. Keil. A Bradford book. Includes bibliographical references and indexes.
     Keywords: honours reading, situation calculus, modal logic, model theory. [bibtex-entry]



125. Victor R. Lesser. Cooperative Multiagent Systems: A Personal View of the State of the Art. IEEE Transactions on Knowledge and Data Engineering, 11(1):133--142, 1999.
     Keywords: coordination, honours reading. [bibtex-entry]



126. Stephen Muggleton. Inductive Logic Programming: Issues, Results and the Challenge of Learning Language in Logic. Artificial Intelligence, 114(1-2):283--296, 1999.
     Keywords: inductive logic programming, honours reading. [bibtex-entry]



127. Gil Neiger and Rida A. Bazzi. Using knowledge to optimally achieve coordination in distributed systems. Theoretical Computer Science, 220(1):31--65, 1999.
     Keywords: multiagent coordination, honours reading, modal logic, epistemic logic. [bibtex-entry]



128. Ilkka Niemela. Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and Artificial Intelligence, 25(3):241--273, 1999.
     Keywords: logic programming, nonmonotonic logic, constraint satisfaction, honours reading. [bibtex-entry]



129. R. Ramanujam. View-Based Explicit Knowledge. Annals of Pure and Applied Logic, 96(1-3):343--368, 1999.
     Keywords: epistemic logic, honours reading. [bibtex-entry]



130. Chiaki Sakama. Some Properties of Inverse Resolution in Normal Logic Programs. Lecture Notes in Computer Science, 1634(1999):279--290, 1999.
     Keywords: inductive logic programming, honours reading. [bibtex-entry]



131. Tuomas W. Sandholm. Distributed Rational Decision Making. In Gerhard Weiss, editor,Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, pages 201--258. MIT Press, Cambridge, MA, USA, 1999.
     Keywords: agents, artificial intelligence, honours reading. [bibtex-entry]



132. Sandip Sen and Gerhard Weiss. Learning in Multiagent Systems. In Gerhard Weiss, editor,Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, pages 259--298. MIT Press, Cambridge, MA, USA, 1999.
     Keywords: machine learning, inductive logic programming, honours reading, agents. [bibtex-entry]



133. V. S. Subrahmanian. Nonmonotonic Logic Programming. IEEE Transactions on Knowledge and Data Engineering, 11(1):143--152, 1999.
     Keywords: nonmonotonic logic, logic programming, honours reading. [bibtex-entry]



134. Michael Thielscher. From situation calculus to fluent calculus: state update axioms as a solution to the inferential frame problem. Artificial Intelligence, 111(1--2):277--299, 1999.
     Keywords: agent programming languages, situation calculus, honours reading. [bibtex-entry]



135. D. Waltz. The importance of importance. Ai Magazine, 20(3):18--35, 1999.
     Note: Times Cited: 4 Article English Cited References Count: 20 244dd.
     Keywords: machine learning, Bayesian Theory, cognitive science, honours reading. [abstract] [download paper ] [bibtex-entry]



136. Gerhard Weiss and Pierre Dillenbourg. What is 'multi' in Multiagent Learning?. In Pierre Dillenbourg, editor,Collaborative learning. Cognitive and computational approaches, pages 64--80. Pergamon Press, 1999.
     Keywords: machine learning, inductive logic programming, honours reading, agents. [bibtex-entry]



137. Michael J. Wooldridge. Intelligent Agents. In Gerhard Weiss, editor,Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, pages 27--77. MIT Press, Cambridge, MA, USA, 1999.
     Keywords: agents, artificial intelligence, honours reading. [bibtex-entry]



138. Gerhard Brewka and Jurgen Dix. Knowledge Representation with Logic Programs. Lecture Notes in Computer Science, 1471:1--102, 1998.
     Keywords: logic programming, honours reading. [bibtex-entry]



139. David Carmel and Shaul Markovitch. Model-based Learning of Interaction Strategies in Multiagent Systems. Journal of Experimental and Theoretical Artificial Intelligence, 10(3):309--332, 1998.
     Keywords: model theory, machine learning, inductive logic programming, honours reading. [bibtex-entry]



140. Juan A. Garay and Yoram Moses:. Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds.. SIAM J. Comput, 27(1):247--290, 1998.
     Keywords: algorithms, computational complexity, honours reading. [bibtex-entry]



141. F. Ho and M. Kamel. Learning Coordination Strategies for Cooperative Multiagent Systems. Machine Learning, 33(2 - 3):155--177, 1998.
     Keywords: machine learning, coordination, honours reading. [bibtex-entry]



142. F. Ho and M. Kamel. Learning coordination strategies for cooperative multiagent systems. Machine Learning, 33(2-3):155--157, 1998.
     Keywords: machine leaning, agents, honours reading. [abstract] [download paper ] [bibtex-entry]



143. Michael P. Wellman and Junling Hu. Conjectural Equilibrium in Multiagent Learning. Machine Learning, Volume , Issue , Nov , Pages, 33(2 - 3):179--200, 1998.
     Keywords: machine learning, honours reading. [bibtex-entry]



144. 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. [bibtex-entry]



145. 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. [bibtex-entry]



146. 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. [bibtex-entry]



147. 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] [bibtex-entry]



148. 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] [bibtex-entry]



149. 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. [bibtex-entry]



150. 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] [download paper ] [bibtex-entry]



151. 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] [bibtex-entry]



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



153. 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. [bibtex-entry]



154. 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. [bibtex-entry]



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



156. 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. [bibtex-entry]



157. 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. [bibtex-entry]



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



159. 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. [bibtex-entry]



160. 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. [bibtex-entry]



161. 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] [download paper ] [bibtex-entry]



162. 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. [bibtex-entry]



163. 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. [bibtex-entry]



164. 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. [bibtex-entry]



165. Winton Davies and Peter Edwards. Distributed Learning An Agent-Based Approach to Data-Mining. In Diana Gordon, editor,Working Notes of the ICML '95 Workshop on Agents that Learn from Other Agents. Tahoe City, CA, 1995.
     Keywords: machine learning, honours reading. [bibtex-entry]



166. Phan Minh Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artificial Intelligence, 77:321--357, 1995.
     Keywords: argumentation, honours reading. [bibtex-entry]



167. Nicola Guarino. Formal ontology, conceptual analysis and knowledge representation. International Journal of Human Computer Studies, 43:625--640, 1995.
     Keywords: ontologies, honours reading, logistics. [bibtex-entry]



168. Nicholas R. Jennings. Controlling Cooperative Problem Solving in Industrial Multi-Agent Systems Using Joint Intentions. Journal of Artificial Intelligence Research, 75(2):195--240, 1995.
     Keywords: coordination, honours reading. [bibtex-entry]



169. Lode Missiaen, Maurice Bruynooghe, and Marc Denecker. CHICA, An Abductive Planning System Based on Event Calculus. Journal of Logic and Computation, 5(5):579--602, 1995.
     Keywords: planning, event calculus, abductive logic programming, honours reading. [bibtex-entry]



170. Stephen Muggleton. Inverse Entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming, 13:245--286, 1995.
     Keywords: inductive logic programming, honours reading. [bibtex-entry]



171. S. Russell and D. Subramanian. Provably bounded-optimal agents,. Journal of Artificial Intelligence Research, 2:575--609, 1995.
     Keywords: agent programming languages, honours reading, logistics, agents. [bibtex-entry]



172. M. W. P. Savelsbergh. The General Pickup and Delivery Problem. Transportation Science, 29(1):17--29, 1995.
     Keywords: planning, honours reading. [bibtex-entry]



173. Manuela Veloso, Jaime Carbonell, Alicia Perez, Daniel Borrajo, Eugene Fink, and Jim Blythe. Integrating Planning and Learning: The PRODIGY Architecture. Journal of Experimental and Theoretical Artificial Intelligence, 7(1):81--120, 1995.
     Keywords: planning, machine learning, honours reading. [bibtex-entry]



174. Michael Wooldridge and Nicholas R. Jennings. Intelligent Agents: Theory and Practice. Knowledge Engineering Review, 10(2):115--152, 1995.
     Keywords: agents, honours reading. [bibtex-entry]



175. Chitta Baral and Michael Gelfond. Logic Programming and Knowledge Representation. Journal of Logic Programming, 19/20:73--148, 1994.
     Keywords: logic programming, honours reading. [bibtex-entry]



176. Walter F. Bischof and Terry Caelli. Learning Structural Descriptions of Patterns: A New Technique for Conditional Clustering and Rule Generation. Pattern Recognition, 27(5):689--97, 1994.
     Keywords: machine learning, inductive logic programming, honours reading. [bibtex-entry]



177. Tom Bylander. The Computational Complexity of Propositional STRIPS Planning. Artificial Intelligence, 69(1-2):165--204, 1994.
     Keywords: planning, honours reading, computational complexity. [bibtex-entry]



178. Yves Deville and Kung-Kiu Lau. Logic Program Synthesis. Journal of Logic Programming, 19/20:321--350, 1994.
     Keywords: logic programming, inductive logic programming, honours reading. [bibtex-entry]



179. Jörg-Uwe Kietz and Saso Dzeroski. Inductive Logic Programming and Learnability. SIGART Bulletin, 5(1):22--32, 1994.
     Keywords: inductive learning, inductive logic programming, honours reading. [bibtex-entry]



180. Raymond J. Mooney and John M. Zelle. Integrating ILP and EBL. SIGART Bulletin, 5(1):12--21, 1994.
     Keywords: inductive logic programming, machine learning, honours reading. [bibtex-entry]



181. Stephen Muggleton and Luc De Raedt. Inductive Logic Programming: Theory and Methods. Journal of Logic Programming, 19/20:629--679, 1994.
     Keywords: inductive logic programming, honours reading. [bibtex-entry]



182. Bradley S. Stewart, Ching-Fang Liaw, and Chelsea C. White. A bibliography of heuristic search research through 1992. IEEE Transactions on Systems, Man, and Cybernetics, 24(2):268--293, 1994.
     Keywords: algorithms, honours reading. [bibtex-entry]



183. Saso Dzeroski and Nada Lavrac. Inductive Learning in Deductive Databases. IEEE Transactions on Knowledge and Data Engineering, 5(6):939--949, 1993.
     Keywords: inductive logic programming, honours reading, databases. [bibtex-entry]



184. David Eppstein. Connectivity, graph minors, and subgraph multiplicity. Journal of Graph Theory, 17:409--416, 1993.
     Keywords: graph theory, graph matching, honours reading. [bibtex-entry]



185. James G. Greeno and Joyce L. Moore. Situativity and Symbols: Response to Vera and Simon. Cognitive Science, 17:49--59, 1993.
     Keywords: cognitive science, philosophy, honours reading. [bibtex-entry]



186. N. R. Jennings. Commitments and conventions: the foundation of coordination in multi-agent systems. The Knowledge Engineering Review, 8(3):223--50, 1993.
     Note: UK.
     Keywords: coordination, honours reading. [abstract] [bibtex-entry]



187. Munindar P. Singh. A Semantics for Speech Acts. Annals of Mathematics and Artificial Intelligence, 8(1-2):47--71, 1993.
     Keywords: agent communication languages, honours reading. [bibtex-entry]



188. Lucy Suchman. Response to Vera and Simon's Situated Action: A Symbolic Interpretation. Cognitive Science, 17:71--75, 1993.
     Keywords: cognitive science, philosophy, honours reading. [bibtex-entry]



189. Alonso H. Vera and Herbert A. Simon. Situated Action: A Symbolic Interpretation. Cognitive Science, 17:7--48, 1993.
     Keywords: cognitive science, philosophy, honours reading. [bibtex-entry]



190. Alonso H. Vera and Herbert A. Simon. Situated Action: Reply to Reviewers. Cognitive Science, 17:77--86, 1993.
     Keywords: cognitive science, philosophy, honours reading. [bibtex-entry]



191. M. E. Bratman. Shared Cooperative Activity. Philosophical Review, 101(2):327--340, 1992.
     Keywords: BDI, agent communication languages, agent programming languages, honours reading, philosophy. [download paper ] [bibtex-entry]



192. Joseph Y. Halpern and Yoram Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54(3):319--379, 1992.
     Keywords: computational complexity, model theory, modal logic, honours reading. [abstract] [bibtex-entry]



193. Antonis C. Kakas, Robert A. Kowalski, and Francesca Toni. Abductive Logic Programming. Journal of Logic and Computation, 2(6):719--770, 1992.
     Keywords: abductive logic programming, honours reading. [bibtex-entry]



194. Stephen Muggleton. Inductive Logic Programming. In Stephen Muggleton, editor,Inductive Logic Programming, volume 38 of The APIC Series, pages 1--27. Academic Press, 1992.
     Keywords: inductive logic programming, honours reading. [bibtex-entry]



195. Stephen Muggleton and C. Feng. Efficient Induction in Logic Programs. In Stephen Muggleton, editor,Inductive Logic Programming, pages 281--298. Academic Press, 1992.
     Keywords: inductive logic programming, honours reading. [bibtex-entry]



196. P. R. Cohen and H. J. Levesque. Intention is choice with commitment. Artificial Intelligence, 42((2--3)):213--361, 1990.
     Keywords: intentionality, model theory, belief desires intentions, BDI, honours reading. [bibtex-entry]



197. J. Y. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM (JACM), 37(3):549--587, 1990.
     Keywords: epistemic logic, agent programming languages, model theory, honours reading. [bibtex-entry]



198. J. R. Quinlan. Learning logical definitions from relations. Machine Learning, 5:239--266, 1990.
     Keywords: inductive logic programming, machine learning, honours reading. [bibtex-entry]



199. Edmund H. Durfee, Victor R. Lesser, and Daniel D. Corkill. Trends in Cooperative Distributed Problem Solving. IEEE Transactions on Knowledge and Data Engineering, 1(1):63--83, 1989.
     Keywords: coordination, honours reading. [bibtex-entry]



200. Nicholas S. Flann and Thomas G. Dietterich. A Study of Explanation-Based Methods for Inductive Learning. Machine Learning, 4(2):187--226, 1989.
     Keywords: explanation-based learning, machine learning, honours reading. [bibtex-entry]



201. David Poole. Explanation and Prediction: An Architecture for Default and Abductive Reasoning. Computational Intelligence, 5(2):97--110, 1989.
     Keywords: explanation-based learning, machine learning, honours reading. [bibtex-entry]



202. A. V. Goldberg and R. E. Tarjan. A New Approach to the Maximum-Flow Problem. Journal of the Association for Computing Machinery, 35(4):921--40, 1988.
     Keywords: graph matching, honours reading. [bibtex-entry]



203. N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16(4):760--78, 1987.
     Note: USA.
     Keywords: computational complexity, honours reading. [abstract] [bibtex-entry]



204. H. J. Levesque and R. J. Brachman. Expressiveness and tractability in knowledge representation and reasoning Computational Intelligence journal. 3:78--93, 1987.
     Keywords: honours reading, computational complexity. [bibtex-entry]



205. H. J. Levesque and R. J. Brachman. Expressiveness and tractability in knowledge representation and reasoning. Computational Intelligence, 3(2):78--93, 1987.
     Note: Canada.
     Keywords: computational complexity, proof theory, honours reading. [abstract] [bibtex-entry]



206. Gerald Dejong and Raymond J. Mooney. Explanation-Based Learning: An Alternative View. Machine Learning, 1(2):145--176, 1986.
     Keywords: explanation-based learning, machine learning, honours reading. [bibtex-entry]



207. E. Allen Emerson and Joseph Y. Halpern. 'Sometimes' and 'Not Never' Revisited: On Branching versus Linear Time Temporal Logic. Journal of the Association for Computing Machinery, 33(1):151--178, 1986.
     Keywords: temporal logic, honours reading. [bibtex-entry]



208. M. Georgeff and A. Lansky. Procedural Knowledge. Proceedings of the IEEE (Special Issue on Knowledge Representation), 74:1383--1398, 1986.
     Keywords: procedural reasoning, honours reading, model theory, belief desires intentions, BDI, logistics. [bibtex-entry]



209. Tom M. Mitchell, Richard M. Keller, and Smadar T. Kedar-Cabelli. Explanation Based Learning A Unifying View. Machine Learning, 1(1):47--80, 1986.
     Keywords: machine learning, explanation-based learning, honours reading. [bibtex-entry]



210. L. R. Rabiner and B. H. Juang. An Introduction to Hidden Markov Models. IEEE ASSP Magazine, pp 4--16, 1986.
     Keywords: Markov theory, honours reading. [bibtex-entry]



211. James Garson. Quantification in Modal Logic. In Dov M. Gabbay and Franz Guenthner, editors,Handbook of philosophical logic, pages 4 v.. D. Reidel ; Sold and distributed in the U.S.A. and Canada by Kluwer Academic Publishers, Dordrecht ; Boston Hingham, MA, 1984.
     Note: Edited by D. Gabbay and F. Guenthner. Includes bibliographies and indexes. v. 1. Elements of classical logic -- v. 2. Extensions of classical logic -- v. 3. Alternatives in classical logic -- v. 4. Topics in the philosophy of language.
     Keywords: modal logic, philosophy, model theory, honours reading. [bibtex-entry]



212. Johan van Benthem. Correspondence Theory. In Dov M. Gabbay and Franz Guenthner, editors,Handbook of philosophical logic, volume 4, pages 162--167. D. Reidel ; Sold and distributed in the U.S.A. and Canada by Kluwer Academic Publishers, Dordrecht ; Boston Hingham, MA, 1983.
     Note: Edited by D. Gabbay and F. Guenthner. Includes bibliographies and indexes. v. 1. Elements of classical logic -- v. 2. Extensions of classical logic -- v. 3. Alternatives in classical logic -- v. 4. Topics in the philosophy of language.
     Keywords: modal logic, epistemic logic, honours reading. [bibtex-entry]



213. Charles L. Forgy. Rete: A Fast Algorithm for the Many Pattern/ Many Object Pattern Match Problem. Artificial Intelligence, 19:17--37, 1982.
     Keywords: expert systems, logistics, honours reading. [abstract] [bibtex-entry]



214. L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401, 1982.
     Keywords: honours reading, algorithms, coordination, agent communication languagess. [bibtex-entry]



215. Alan Newell. The Knowledge Level. Artificial Intelligence, 18(1):87--127, 1982.
     Keywords: artificial intelligence, honours reading. [bibtex-entry]



216. M. E. Bratman. Intention and means-end reasoning. Philosophical Review, 90(2):252--265, 1981.
     Keywords: BDI, agent communication languages, agent programming languages, honours reading, philosophy. [bibtex-entry]



217. M. E. Bratman. Shared Cooperative Activity. Philosophical Review, 101(2):327--341, 1981.
     Keywords: BDI, agent communication languages, agent programming languages, honours reading, philosophy. [bibtex-entry]



218. J. McCarthy. Circumscription-a form of non-monotonic reasoning. Artificial Intelligence, 13(1-2):27--39, 1980.
     Note: Netherlands.
     Keywords: honours reading, situation calculus, modal logic, model theory, generalisation, nonmonotonic reasoning. [abstract] [bibtex-entry]



219. Reid G. Smith. The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver. IEEE Transactions on Computers, C-29(12):1104--1113, 1980.
     Keywords: coordination, honours reading. [bibtex-entry]



220. Philip R. Cohen and C. Raymond Perrault. Elements of a plan-based theory of speech acts. Cognitive Science, 3:177--212, 1979.
     Keywords: honours reading, agent communication languagess. [bibtex-entry]



221. Gordon D. Plotkin. A further note on inductive generalization. Machine Intelligence, 6:101--124, 1979.
     Keywords: inductive logic programming, generalisation, honours reading. [bibtex-entry]



222. H. N. Gabow. An Efficient Implementation of Edmonds’ Algorithm for Maximum Matching on Graphs. Journal of the ACM, 23:221--234, 1976.
     Keywords: graph matching, honours reading. [bibtex-entry]



223. Jaakko Hintikka. Impossible, Possible Worlds Vindicated. The Journal of Philosophical Logic, 4(3):475--484, 1975.
     Keywords: modal logic, epistemic logic, model theory, honours reading. [bibtex-entry]



224. G. David Forney. The Viterbi Algorithm. Proceedings of The IEEE, 61(3):268--278, 1973.
     Keywords: Markov theory, honours reading. [bibtex-entry]



225. L. Stockmeyer. Planar 3-colorability is polynomial complete.. SIGACT News,, 5(3):19--25, 1973.
     Keywords: graph theory, computational complexity, honours reading. [bibtex-entry]



226. Gordon D. Plotkin. A further note on inductive generalization. Machine Intelligence, 6:101--124, 1971.
     Keywords: inductive logic programming, generalisation, honours reading. [bibtex-entry]



227. Gordon D. Plotkin. A note on inductive generalization. Machine Intelligence, 5:153--163, 1970.
     Keywords: inductive logic programming, generalisation, honours reading. [bibtex-entry]



228. K. Segerberg. Modal logics with linear alternative relations. Theoria, 36:301--322, 1970.
     Keywords: model theory, modal logic, epistemic logic, honours reading. [bibtex-entry]



229. S. Amarel. On representations of problems of reasoning about actions. Machine Intelligence, 3:131--171, 1968.
     Keywords: algorithms, honours reading. [abstract] [bibtex-entry]



230. Arnon Sturm and Onn Shehory. A comparative evaluation of Agent-Oriented Methodologies. In Federico Bergenti, Marie-Pierre Gleizes, and Franco Zambonelli, editors,Methodologies and software engineering for agent systems: the agent-oriented software engineering handbook, pages 127--152. Kluwer Academic Publishers, .
     Keywords: logistics, agent-oriented software engineering, honours reading. [bibtex-entry]

1. Jian Huang and Adrian R. Pearce. Collaborative inductive logic programming for path planning. In Manuela M. Veloso, editor, Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), volume 1, Hyderabad, India, pages 1327--1332, 2007. IJCAI.
   Keywords: agentlab, agent programming languages, inductive logic programming, honours reading, collaborative logic programming, NOSA. [download paper ] [bibtex-entry]



2. Ryan F. Kelly and Adrian R. Pearce. Property persistence in the situation calculus. In Manuela M. Veloso, editor, Twentieth International Joint Conference on Artificial Intelligence (IJCAI-07), volume 2, Hyderabad, India, pages 1948--1953, 2007. IJCAI.
   Keywords: agentlab, agent programming languages, honours reading, situation calculus, MINDIGOLOG. [download paper ] [bibtex-entry]



3. Hui Li and Rajkumar Buyya. Model-Driven Simulation of Grid Scheduling Strategies. In 3rd IEEE International Conference on e-Science and Grid Computing, 2007.
   Keywords: honours reading. [bibtex-entry]



4. Duc Nghia Pham, John Thornton, and Abdul Sattar. Building structure into local search for SAT. In International Joint Conference on Artificial Intelligence, Hyderabad, pages 2359--2364, 2007.
   Keywords: Constraint satisfaction, DCSP, DCOP, honours reading. [bibtex-entry]



5. H. P. van Ditmarsch, van der Hoek. W., and B. P. Kooi. Dynamic Epistemic Logic & Knowledge Puzzles. In Uta Priss, Simon Polovina, and Richard Hill, editors, Proceedings of the 15th International Conference on Conceptual Structures (ICCS 2007), volume 4604 of Lecture Notes in Computer Science, pages 45--58, 2007. Springer Verlag.
   Keywords: epistemic logic, agent programming languages, honours reading. [bibtex-entry]



6. Tim French. Bisimulation Quantified Modal Logics: Decidability. In Advances in Modal Logic, pages 147--166, 2006.
   Keywords: modal logic, model theory, honours reading, computational complexity. [bibtex-entry]



7. Georg Gottlob, Reinhard Pichler, and Fang Wei. Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. In AAAI, pages 613--620, 2006.
   Keywords: graph theory, computational complexity, honours reading. [bibtex-entry]



8. Gemma Grau, Carlos Cares, Xavier Franch, and Fredy J. Navarrete. A comparative analysis of Agent Oriented Modelling Techniques. In Proceedings of The Eighteenth International Conference on Software Engineering and Knowledge Engineering, 2006.
   Keywords: agent-oriented software engineering, honours reading. [bibtex-entry]



9. Jian Huang and Adrian R. Pearce. Toward inductive logic programming for collaborative problem solving. In Silvia Ceballos, editor, IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT-06), Hong Kong, pages 284--290, 2006. IEEE Computer Society Press.
   Keywords: agentlab, agent programming languages, inductive logic programming, honours reading, collaborative logic programming, NOSA. [download paper ] [bibtex-entry]



10. Jian Huang and Adrian R. Pearce. Distributed Interactive Learning in Multi-Agent Systems. In National Conference on Artificial Intelligence (AAAI-06), Boston, pages 666--671, 2006. AAAI.
    Keywords: agent programming languages, agentlab, inductive logic programming, honours reading, collaborative logic programming, NOSA. [download paper ] [bibtex-entry]



11. Ryan F. Kelly and Adrian R. Pearce. Towards high level programming for distributed problem solving. In Silvia Ceballos, editor, IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT-06), Hong Kong, pages 490--497, 2006. IEEE Computer Society Press.
    Keywords: agentlab, agent programming languages, honours reading, situation calculus, MINDIGOLOG, GOLOG. [download paper ] [bibtex-entry]



12. Terence H. -W. Law and Adrian R. Pearce. A Multi-stage graph decomposition algorithm for distributed constraint optimisation. In Silvia Ceballos, editor, IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT-06), Hong Kong, pages 506--511, 2006. IEEE Computer Society Press.
    Keywords: agentlab, agent programming languages, honours reading, constraint satisfaction, DCOP, DCSP. [download paper ] [bibtex-entry]



13. Fabio Bellifemine, Federico Bergenti, Giovanni Caire, and Agostino Poggi. JADE - A Java Agent Development Framework. In Multi-Agent Programming 2005, pages 125--147, 2005.
    Keywords: agent programming languages, honours reading, logistics. [bibtex-entry]



14. Jeffrey S. Cox and Edmund H. Durfee. An Efficient Algorithm for Multiagent Plan Coordination. In Autonomous Agent and Multiagent Systems (AAMAS-05), Urtrect, pages 828--835, 2005.
    Keywords: multiagent coordination, honours reading, agent programming languages. [bibtex-entry]



15. Jeffrey S. Cox, Edmund H. Durfee, and Thomas Bartold. A dstributed framework for solving the multiagnet plan coordination problem. In Autonomous Agent and Multiagent Systems (AAMAS-05), Urtrect, pages 821--827, 2005.
    Keywords: multiagent coordination, honours reading, agent programming languages. [bibtex-entry]



16. John Davin and Pragnesh Jay Modi. Impact of Problem Centralization in Distributed Constraint Optimization Algorithms. In Autonomous Agent and Multiagent Systems (AAMAS-05), Urtrect, pages 1057--1063, 2005.
    Keywords: multiagent coordination, honours reading, DCOP, DCSP, computational complexity. [bibtex-entry]



17. Tim French. Bisimulation Quantified Logics: Undecidability. In FSTTCS, pages 396--407, 2005.
    Keywords: modal logic, model theory, honours reading, computational complexity. [bibtex-entry]



18. Gerhard Lakemeyer and Hector J. Levesque. Semantics for a useful fragment of the situation calculus. In IJCAI-05, Edinburgh, Scotland, pages 490--496, 2005.
    Keywords: modal logic, agent programming languages, honours reading, hybrid logic, situation calculus. [abstract] [bibtex-entry]



19. Hoon Wei Lim and Kenneth G. Paterson. Identity-Based Cryptography for Grid Security. In First International Conference on e-Science and Grid Computing (e-Science'05), pages 395--404, 2005. IEEE Computer Society Press.
    Keywords: honours reading, cryptography. [bibtex-entry]



20. Gang Lu, Narayanan Sadagopan, Bhaskar Krishnamachari, and Ashish Goel. Delay Efficient Sleep Scheduling in Wireless Sensor Networks. In IEEE INFOCOM,, Miami, FL, 2005.
    Keywords: sensor networks, honours reading. [bibtex-entry]



21. Roger Mailler. Comparing Two Approaches to Dynamic, Distributed Constraint Satisfaction. In Autonomous Agents and Multiagents Systems (AAMAS2005), Utrect, Netherlands, pages 1049--1056, 2005. ACM.
    Keywords: constraint satisfaction, multiagent coordination, honours reading. [bibtex-entry]



22. Tal Mizrahi and Yoram Moses. Coninuous consensus via common knowledge. In Tenth conference on Theoretical Aspects of Rationality and Knowledge (TARK X), National University of Singapore, 2005. ACM Digital Library.
    Keywords: epistemic logic, agent programming languages, honours reading, modal logic. [abstract] [bibtex-entry]



23. Pragnesh Jay Modi. Impact of Problem Centralization in Distributed Constraint Optimization Algorithms. In Autonomous Agents and Multiagent Systems (AAMAS2005), Utrect, Netherlands, pages 1057--1063, 2005. ACM.
    Keywords: constraint satisfaction, multiagent coordination, honours reading, DCOP, DCSP. [bibtex-entry]



24. Paul Scerri, Alessandro Farinelli, Steven Okamoto, and Milind Tambe. Allocating Tasks in Extreme Teams. In Autonomous Agent and Multiagent Systems (AAMAS-05), Urtrect, pages 727--734, 2005.
    Keywords: multiagent coordination, honours reading, agent programming languages. [bibtex-entry]



25. M. Tambe, E. Bowring, H. Jung, G. Kaminka, R. Maheswaran, J. Marecki, P. J. Modi, R. Nair, S. Okamoto, J. P. Pearce, P. Paruchuri, D. Pynadath, P. Scerri, N. Schurr, and P. Varakantham. Conflicts in teamwork: Hybrids to the rescue. In Autonomous Agent and Multiagent Systems (AAMAS-05), Urtrect, pages 3--11, 2005.
    Keywords: multiagent coordination, honours reading, agent programming languages. [bibtex-entry]



26. Yang Xu, Paul Scerri, Bin Yu, Steven Okamoto, Michael Lewis, and Katia Sycara. An integrated toekn-based algorithm for scalable coordination. In Autonomous Agent and Multiagent Systems (AAMAS-05), Urtrect, pages 407--414, 2005.
    Keywords: multiagent coordination, honours reading, agent programming languages. [bibtex-entry]



27. U. Endriss, P. Mancarella, F. Sadri, G. Terreni, and F. Toni. The CIFF Proof Procedure for Abductive Logic Programming with Constraints. In José Júlio Alferes and João Leite, editors, Logics in Artificial Intelligence: 9th European Conference, JELIA 2004,, Lisbon, Portugal, pages 266--278, 2004. Springer Verlag.
    Keywords: modal logic, logic programming, honours reading, agent programming languages, inductive logic programming. [abstract] [bibtex-entry]



28. K. M. Hansen, L. M. Kristensen, E. Eskildsen, K-D. Nielsen, R. E. Thorup, J. Fridthjof, U. Merrild, and J. Eskildsen. The Ex Hoc Infrastructure Framework. In Proc. of Nordic Symposium on Traffic Research, 2004.
    Keywords: sensor networks, simulation, honours reading. [bibtex-entry]



29. Anthony Harrington and Vinny Cahill. Route Profiling - Putting Context to Work. In Proceedings of the 19th ACM symposium on Applied Computing, Nicosia, Cyprus, 2004.
    Keywords: sensor networks, simulation, honours reading. [bibtex-entry]



30. Philip Levis, Sam Madden, David Gay, Joseph Polastre, Robert Szewczyk, Alec Woo, Eric Brewer, and David Culler. The Emergence of Networking Abstractions and Techniques in TinyOS. In First Symposium on networked system design and implementation (NSDI04), San Francisco, California, USA, pages 1--14, 2004.
    Keywords: sensor networks, honours reading. [bibtex-entry]



31. R. Mailler and V. Lesser. Solving Distributed Constraint Optimization Problems using Cooperative Mediation. In Autonomous Agents and Multiagent Systems, New York, USA, pages 438--445, 2004. IEEE.
    Keywords: multiagent coordination, honours reading, agent programming languages, DCOP, DCSP. [bibtex-entry]



32. Maarten Marien, David Gilis, and Marc Denecker. On the Relation Between ID-Logic and Answer Set Programming. In José Júlio Alferes and João Leite, editors, Logics in Artificial Intelligence: 9th European Conference, JELIA 2004,, Lisbon, Portugal, pages 108--120, 2004. Springer Verlag.
    Keywords: modal logic, logic programming, honours reading, agent programming languages. [abstract] [bibtex-entry]



33. Linh Anh Nguyen. The Modal Logic Programming System MProlog. In José Júlio Alferes and João Leite, editors, Logics in Artificial Intelligence: 9th European Conference, JELIA 2004,, Lisbon, Portugal, pages 266--278, 2004. Springer Verlag.
    Keywords: modal logic, logic programming, honours reading, agent programming languages. [bibtex-entry]



34. A. Omicini, A. Ricci, M. Viroli, C. Castelfranchi, and L. Tummolini. Coordination artifacts: environment-based coordination for intelligent agents. In Autonomous Agents and Multiagent Systems (AAMAS), 2004.
    Keywords: agent-oriented software engineering, honours reading. [bibtex-entry]



35. Karim Seada, Marco Zuniga, Ahmed Helmy, and Bhaskar Krishnamachari. Energy Efficient Forwarding Strategies for Geographic Routing in Wireless Sensor Networks. In ACM Sensys 2004, 2004.
    Keywords: sensor networks, honours reading. [bibtex-entry]



36. Susannah Soon, Adrian Pearce, and Max Noble. Adaptive Teamwork Coordination using Graph Matching over Hierarchical Intentional Structures. In Nicholas R. Jennings, Carles Sierra, Liz Sonenberg, and Milind Tambe, editors, International Conference on Autonomous Agents and Multi Agent Systems (AAMAS), New York, pages 294--301, 2004.
    Keywords: agentlab, agent programming languages, graph theory, honours reading, teamwork, coordination. [bibtex-entry]



37. H. Van Dyke Parunak, Sven Brueckner, and Robert Savit. Universality in Multi-Agent Systems. In International Conference on Autonomous Agents and Multi Agent Systems (AAMAS), New York, 2004.
    Keywords: agents, computational complexity, epistemic logic, honours reading. [bibtex-entry]



38. M. Birna van Riemsdijk, John-Jules Ch. Meyer, and Frank S. de Boer. Semantics of Plan Revision in Intelligent Agents. In Proceedings of the 10th International Conference on Algebraic Methodology and Software Technology (AMAST'04), 2004.
    Keywords: agent programming languages, honours reading. [bibtex-entry]



39. O. Wolfson and . B. Xu. Data-on-the-Road in Intelligent Transportation Systems. In Proc. of the IEEE International Conference on Networking, Sensing, and Control (ICNSC 2004), Taipei, Taiwan, 2004.
    Keywords: sensor networks, simulation, honours reading. [bibtex-entry]



40. Seema Bandyopadhyay and Edward J. Coyle. An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks. In INFOCOM 2003, 2003.
    Keywords: sensor networks, honours reading. [bibtex-entry]



41. Mehdi Dastani, Frank Dignum, and Joh-Jules Ch. Meyer. Autonomy and Agent Deliberation. In First International Workshop on Computational Autonomy - Potential, Risks, Solutions, held in conjunction with AAMAS 2003, pages 23--35, 2003.
    Keywords: epistemic logic, dynamic logic, agent programming languages, honours reading. [bibtex-entry]



42. Manish Kochhal, Loren Schwiebert, and Sandeep Gupta. Role-based hierarchical self organization for wireless ad hoc sensor networks. In WSNA'03, pages 98--108, 2003. ACM.
    Keywords: sensor networks, machine learning, honours reading. [bibtex-entry]



43. Ronald Kroon and Leon J. M. Rothkrantz. Dynamic vehicle routing using an ABC-algorithm. In T. Heskes, P. Lucas, L. Vuurpijl, and W. Wiegerinck, editors, Proceedings of the 15th Belgium-Netherlands conference on Artificial Intelligence (BNAIC 2003), Nijmegen, The Netherlands, pages 211--218, 2003.
    Keywords: sensor networks, simulation, honours reading. [bibtex-entry]



44. Yves Martin. The concurrent, continuous FLUX. In International Joint Conference on Artificial Intelligence (IJCAI), pages 1085--1090, 2003. Morgan Kaufmann.
    Keywords: situation calculus, honours reading, agent programming languages. [bibtex-entry]



45. Lars Wischhof, Andre Ebner, Hermann Rohling, Matthias Lott, and Rüdiger Halfmann. Adaptive Broadcast for Travel and Traffic Information Distribution Based on Inter-Vehicle Communication. In Proceedings of the IEEE Intelligent Vehicles Symposium (IV 2003), Columbus, Ohio, USA, 2003.
    Keywords: sensor networks, simulation, honours reading. [bibtex-entry]



46. Lars Wischhof, Andre Ebner, Hermann Rohling, Matthias Lott, and Rudiger Halfmann. SOTIS - A Self-Organizing Traffic Information System. In Proceedings of the 57th IEEE Vehicular Technology Conference (VTC 03 Spring), Jeju, South Korea, 2003.
    Keywords: sensor networks, simulation, honours reading. [bibtex-entry]



47. MohammadTaghi Hajiaghayi and Naomi Nishimura. Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. In Mathematical Foundations of Computer Science 2002 : 27th International Symposium, MFCS 2002, Warsaw, Poland, August , appears in Lecture Notes in Computer Science, Vol 2420, volume 2420, pages 305--318, 2002.
    Keywords: graph matching, honours reading, graph theory. [abstract] [bibtex-entry]



48. Spiros Kapetanakis and Daniel Kudenko. Reinforcement Learning of Coordination in Cooperative Multi-Agent Systems.. In AAAI/IAAI 2002, pages 326--331, 2002.
    Keywords: reinforcement leaning, honours reading. [bibtex-entry]



49. Timo Kosch, Christian Schwingenschlogl, and Li Ai. Information Dissemination in Multihop Inter-Vehicle Networks - Adapting the Ad-hoc On-demand Distance Vector Routing Protocol (AODV). In The IEEE 5th International Conference on Intelligent Transportation Systems, Singapore, 2002.
    Keywords: sensor networks, simulation, honours reading. [bibtex-entry]



50. Samuel Madden, Michael J. Franklin, Joseph M. Hellerstein, and Wei Hong. TAG: A Tiny AGgregation Service for Ad-Hoc Sensor Networks. In OSDI 2002, pages 1--16, 2002.
    Keywords: sensor networks, honours reading. [bibtex-entry]



51. Michael J. Pazzani. Commercial Applications of Machine Learning for Personalized Wireless Portals.. In PRICAI 2002, pages 1--5, 2002.
    Keywords: machine leaning, honours reading. [abstract] [bibtex-entry]



52. John Bell. Causal Counterfactuals. In Common Sense-2001, 2001.
    Keywords: counterfactuals, model theory, honours reading. [abstract] [bibtex-entry]



53. Patrick Blackburn, Jaap Kamps, and Maarten Marx. Situation Calculus as Hybrid Logic: First Steps. In 10th Portuguese Conference on Artificial Intelligence on Progress in Artificial Intelligence, Knowledge Extraction, Multi-agent Systems, Logic Programming and Constraint Solving; in Lecture Notes In Computer Science; Vol. 2258, pages 253--260, 2001. Springer-Verlag London, UK.
    Keywords: situation calculus, agent programming languages, modal logic, model theory, honours reading. [bibtex-entry]



54. Dan Boneh and Matthew K. Franklin. Identity-Based Encryption from the Weil Pairing. In CRYPTO 2001, pages 213--229, 2001.
    Keywords: cryptography, honours reading. [bibtex-entry]



55. A. Ebner and H. Rohling. A SELF-ORGANIZED RADIO NETWORK FOR AUTOMOTIVE APPLICATIONS. In ITS 2001, 8th World Congress on Intelligent Transportation Systems, Sydney, Australia, 2001.
    Keywords: sensor networks, simulation, honours reading. [bibtex-entry]



56. D. Kazakov and D. Kudenko. Machine learning and inductive logic programming for multi-agent systems. In Multi-Agent Systems and Applications, 9th ECCAI Advanced Course ACAI 2001 and Agent Link's 3rd European Agent Systems Summer School, EASSS 2001, , Lecture Notes in Artificial Intelligence, Volume 2086, Prague, Czech Republic, pages 246--270, 2001. Springer Verlag.
    Keywords: inductive logic programming, machine learning, agents, honours reading. [bibtex-entry]



57. Milind Tambe and Bavid V. Pynadeth. Towards Heterogeneous Agent Teams. In Multi-Agent Systems and Applications, 9th ECCAI Advanced Course ACAI 2001 and Agent Link's 3rd European Agent Systems Summer School, EASSS 2001, , Lecture Notes in Artificial Intelligence, Volume 2086, Prague, Czech Republic, pages 187--210, 2001. Springer Verlag.
    Keywords: teamwork, coordination, honours reading. [bibtex-entry]



58. C. Boutilier, R. Reiter, M. Soutchanski, and S. Thrun. Decision-theoretic, high-level agent programming in the situation calculus. In AAAI/IAAAI, pages 355--362, 2000.
    Keywords: agent programming languages, situation calculus, honours reading. [bibtex-entry]



59. H. Bunke. Recent developments in graph matching. In 15th International Conference on Pattern Recognition, volume 2, pages 117--124, 2000.
    Keywords: graph matching, honours reading. [bibtex-entry]



60. Antoine Joux. A One Round Protocol for Tripartite Diffie-Hellman. In ANTS 2000, pages 385--394, 2000.
    Keywords: cryptography, honours reading. [bibtex-entry]



61. Michael Thielscher. Representing the Knowledge of a Robot. In KR 2000, pages 109--120, 2000.
    Keywords: agent programming languages, model theory, honours reading. [bibtex-entry]



62. M. Wooldridge. Computationally Grounded Theories of Agency. In E. Durfee, editor, Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS 2000), volume citeseer.nj.nec.com/wooldridge00computationally.html, 2000. IEEE Press.
    Keywords: honours reading, agent programming languages, belief desires intentions, BDI. [bibtex-entry]



63. M. Georgeff, B. Pell, M. Pollack, M. Tambe, and M. Wooldridge. The belief-desire-intention model of agency. In Intelligent Agents V: Agent Theories, Architectures, and Languages. 5th International Workshop, ATAL'98. Proceedings., pages 1--10, 1999. Springer-Verlag.
    Note: Muller JP Singh MP RaoAS Berlin, Germany. Intelligent Agents V: Agent Theories, Architectures, and Languages. 5th International Workshop, ATAL'98. Proceedings. Paris, France. 4-7 July 1998.
    Keywords: intentionality, model theory, honours reading, belief desires intentions, BDI. [abstract] [bibtex-entry]



64. J. Y. Halpern and R. A. Shore. Reasoning about common knowledge with infinitely many agents. In Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)., pages 384--93, 1999. IEEE Comput. Soc..
    Note: Los Alamitos, CA, USA. Proceedings. 14th Symposium on Logic in Computer Science. Trento, Italy. IEEE. 2-5 July 1999.
    Keywords: computational complexity, agents, honours reading. [abstract] [bibtex-entry]



65. Z Somogyi and F. Henderson. The implementation technology of the Mercury debugger. In Tenth Workshop on Logic Programming Environments, Las Cruces, New Mexico, November (1999), pages 35--49, 1999.
    Keywords: logic programming, honours reading. [bibtex-entry]



66. K. Arisha, F. Ozcan, R. Ross, S. Kraus, and V. S. Subrahmanian. IMPACT: the interactive Maryland platform for agents collaborating together. In Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160). IEEE Comput. Soc. 1998, pages 385--6, 1998.
    Note: Los Alamitos, CA, USA. Proceedings International Conference on Multi Agent Systems. Paris, France. 3-7 July 1998.
    Keywords: agent programming languages, honours reading, logistics. [abstract] [bibtex-entry]



67. Melvin Fitting. Higher-Order Modal Logic - A Sketch. FTP (LNCS Selection) 1998: 8. In Automated Deduction in Classical and Non-Classical Logics, Springer Lecture Notes in Artificial Intelligence Vol. 1761, pages 23--3, 1998. Springer Verlag.
    Keywords: modal logic, agent programming languages, honours reading. [bibtex-entry]



68. Koen V. Hindriks, Frank S. de Boer, Wiebe van der Hoek, and John-Jules Ch. Meyer. A Formal Embedding of AgentSpeak(L) in 3APL. In Australian Joint Conference on Artificial Intelligence, pages 155--166, 1998.
    Keywords: modal logic, agent programming languages, honours reading. [bibtex-entry]



69. 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. [bibtex-entry]



70. 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. [bibtex-entry]



71. 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. [bibtex-entry]



72. 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] [bibtex-entry]



73. James Bailey, Michael Georgeff, David Kemp, David Kinny, and Kotagiri Ramamohanarao. Second International Workshop on Rules in Datbase Systems, Lecutre Notes in Computer Science Vol 985. In , pages 342--356, 1995.
    Keywords: agent programming languages, honours reading. [bibtex-entry]



74. Michael Fisher and Richard Owens. Executable modal and temporal logics : IJCAI '93 Workshop, Chambery, France, August 28, 1993 : proceedings. In Lecture notes in computer science ; 897. Lecture notes in artificial intelligence., Berlin ; New York, pages 180, 1995. Springer.
    Keywords: modal logic, honours reading, temporal logic. [bibtex-entry]



75. R. Parikh. Logical omniscience. In Logic and Computational Complexity. International Workshop LCC '94. Selected Papers. Springer-Verlag. 1995, pages 22--9, 1995.
    Keywords: model theory, honours reading. [abstract] [bibtex-entry]



76. Lorenza Saitta. State of the Art in Machine Learning. In The Newsletter of the European Network of Excellence in Machine Learning, 1995.
    Note: Special Issue.
    Keywords: machine learning, honours reading. [bibtex-entry]



77. J. Y. Halpern, Y. Moses, and M. Y. Vardi. Algorithmic knowledge. In Theoretical Aspects of Reasoning About Knowledge. Proceedings of the Fifth Conference (TARK 1994)., pages 255--66, 1994. Morgan Kaufmann Publishers.
    Note: Fagin R San Francisco, CA, USA. Proceedings of Fifth Conference on Theoretical Aspects of Reasoning about Knowledge (TARK V). Pacific Grove, CA, USA. 13-16 March 1994.
    Keywords: agents, honours reading, epistemic logic, model theory. [abstract] [bibtex-entry]



78. J. R. Josephson. Inductive Generalizations are Abductions. In Position paper for the Workshop on Abductive and Inductive Reasoning, 1994.
    Keywords: abductive logic programming, inductive logic programming, philosophy, honours reading. [bibtex-entry]



79. Mehmet A. Orgun and Wanli Ma. An Overview of Temporal and Modal Logic Programming. In First International Conference on Temporal Logic; appears in Lecture Notes in omputer Science; Vol. 827, pages 445--479, 1994. Springer-Verlag London, UK.
    Keywords: modal logic, honours reading. [bibtex-entry]



80. Yoram Moses and Orit Kislev. Knowledge-oriented programming. In Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, Ithaca, New York, United States, pages 261--270, 1993.
    Keywords: epistemic logic, agent programming languages, modal logic, honours reading. [bibtex-entry]



81. J. R. Quinlan and R. M. Cameron-Jones. FOIL: A midterm report. In P. B Brazdil, editor, Machine Learning (ECML-93) European Conference on Machine Learning Proceedings; Vienna, Austria, Berlin, Germany, pages 3--20, 1993. Springer-Verlag.
    Keywords: machine learning, inductive logic programming, honours reading. [bibtex-entry]



82. Claude Sammut. The origins of inductive logic programming: A prehistoric tale. In Inductive Logic Programming (ILP) '93 Workshop, pages 127--147, 1993.
    Keywords: inductive logic programming, honours reading. [bibtex-entry]



83. David S. Johnson. Local optimization and the traveling salesman problem. In M. S. Paterson, editor, Automata, Languages and Programming. 17th International Colloquium Proceedings; Coventry, UK, Berlin, Germany, pages p. ix+780, 446--61, 1990. Springer-Verlag.
    Keywords: algorithms, honours reading. [bibtex-entry]



84. Neil Immerman. Languages Which Capture Complexity Classes. In 15th ACM STOC Symposium, pages 347--354, 1983.
    Keywords: computational complexity, honours reading. [download paper ] [bibtex-entry]

1. Roger T. Mailler. A mediation-based approach to cooperative, distributed problem solving. PhD thesis, University of Massachusetts, 2004.
   Keywords: multiagent coordination, honours reading, agent programming languages. [bibtex-entry]



2. Daniel Marx. Graph coloring with local and global constraints. PhD thesis, Budapest University of Technology and Economics, 2004.
   Keywords: honours reading, graph theory. [bibtex-entry]



3. E. C. ten Hoeve. 3APL Platform. Masters, Utrecht University, 2003.
   Keywords: agent programming languages, honours reading. [bibtex-entry]



4. Mohammad Taghi Hajiaghayi. Algorithms for Graphs of (Locally) Bounded Treewidth. PhD thesis, University of Waterloo, 2001.
   Keywords: graph matching, graph theory, algorithms, honours reading. [bibtex-entry]



5. H. P. van Ditmarsch. Knowledge Games. IILC Dissertation Series DS-2000-06, 2000.
   Keywords: epistemic logic, agent programming languages, honours reading, games. [download paper ] [bibtex-entry]



6. Amy Rachel Greenwald. Learning to play network games: does rationality yield nash equilibrium?. PhD, New York University, 1999.
   Keywords: game theory, philosophy, honours reading. [bibtex-entry]

1. Michael Genesereth and Nathaniel Love. General Game Playing: Game Description Language Specification. Technical Report March 15 2005, Stanford University, 2005.
   Keywords: logic programming, honours reading. [abstract] [download paper ] [bibtex-entry]



2. Michael Luck, Peter McBurney, Onn Shehory, and Steve Willmott. Agent Technology: Computing as Interaction: A Roadmap for Agent-BasedComputing. Technical report, Agentlink, 2005.
   Keywords: agent programming languages, honours reading, agent-oriented software engineering, logistics. [abstract] [download paper ] [bibtex-entry]



3. Linh Anh Nguyen. The Modal Logic Programming System MProlog: Theory, Design, and Implementation. Technical report, 2005.
   Keywords: modal logic, logic programming, honours reading, agent programming languages. [bibtex-entry]



4. Jun Luo and Jean-Pierre Hubaux. A Survey of Inter-Vehicle Communication. Technical report IC/2004/24, School of computer and Communication Sciences, EPEL, 2004.
   Keywords: sensor networks, simulation, honours reading. [bibtex-entry]



5. John Bell. A Pragmatic Theory of Induction. Technical report July 28, Department of Computer Science, Queen Mary, University of London, July 2003.
   Note: Earlier versions were presented at the ECAI 2000 workshop Scientific Reasoning in Philosophy and AI , the Context 2001 workshop Contexts in Logics, and ECAI 2002.
   Keywords: inductive logic programming, causality, honours reading. [abstract] [bibtex-entry]



6. D. Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev. MANY-DIMENSIONAL MODAL LOGICS: THEORY AND APPLICATIONS. Unpublished book January 2003, Department of Computer Science, King's College, 2003.
   Note: Unpublished book.
   Keywords: model theory, modal logic, epistemic logic, honours reading. [download paper ] [bibtex-entry]



7. R. B. Borie, R. Gary Parker, and C. A. Tovey. Solving problems on recursively constructed graphs. Technical Report TR-2002-04, Dept. Comp. Sci., University of Alabama, 2002.
   Keywords: graph theory, algorithms, computational complexity, honours reading. [bibtex-entry]



8. H. P. van Ditmarsch. the Russian cards problem: a case study in cryptogrphy with public announcements. Technical report October 2002, 2002.
   Keywords: epistemic logic, agent programming languages, honours reading, games, cryptography. [bibtex-entry]



9. L Babai. Communication complexity. Technical Report TR-2001-09, Department of Computer Science, The University of Chicago, 2001 2001.
   Keywords: computational complexity, honours reading. [bibtex-entry]



10. Bernard Chazelle. The PCP Theorem. Technical Report 2001, Princeton University, 2001.
    Keywords: computational complexity, honours reading. [bibtex-entry]



11. Barteld P. Kooi. Probability in Dynamic Epistemic Logic. Technical report 13/09/2000, Department of COmputer Science, University of Groningen, September 2000.
    Keywords: epistemic logic, model theory, honours reading, Bayesian Theory. [bibtex-entry]



12. David Draper. Bayesian Heirarchical Modeling. Technical report 1998, Department of Mathematical Science, University of Bath, 1998.
    Note: Unpublished book.
    Keywords: Bayesian theory, honours reading. [bibtex-entry]



13. 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 ] [bibtex-entry]



14. 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. [bibtex-entry]



15. 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. [bibtex-entry]



16. 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. [bibtex-entry]



17. 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. [bibtex-entry]



18. Joseph Y. Halpern. Reasoning about knowledge: a survey. Technical Report 1995, IBM Almaden Research Center, 1995.
    Note: Appears in Handbook of Logic in Artificial Intelligence and Logic Programig, Vol 4. D. Gabbay, C.J. Hogger, and J. A. Robinson, eds, Oxford University Press, 1995, pp 1-34.
    Keywords: agents, honours reading. [bibtex-entry]



19. Don Batory. The LEAPS Algorithms. Technical Report TR-94-29, Department of Computer Sciences, The University of Texas, 1993.
    Keywords: logic programming, logistics, honours reading, expert systems. [abstract] [bibtex-entry]



20. Leslie Lamport and Michael Fischer. Byzantine Generals and transaction commit protocols. Technical report Op. 62, SRI International and Yale University, 1984.
    Keywords: honours reading, coordination, agent communication languagess, algorithms. [abstract] [bibtex-entry]

1. Alejandro Guerra-Hernandez, Amal El Fallah-Seghrouchni, and Henry Soldano. Distributed Learning in Intentional BDI Multi-Agent Systems, 2004.
   Keywords: BDI, inductive logic programming, honours reading, machine learning. [bibtex-entry]

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.