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]

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

1. Dexter C. Kozen. Theory of computation. Springer, 2006. [abstract] [bibtex-entry]



2. 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]

1. 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]



2. 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]

1. 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]



2. 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]



3. J. Leite, A. Omicini, L. S. Sterling, and P. Torroni, editors. Declarative Agent Languages and Technologies. Springer-Verlag, Berlin, 2004, 2004.
   Keywords: agentlab, agent programming languages, agent-oriented software engineering. [bibtex-entry]

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



2. 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]



3. 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]



4. 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]

1. 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]



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



3. 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]

1. 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]



2. 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]



3. 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]



4. 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]



5. 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]



6. 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]



7. 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]



8. 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]

1. 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]



2. 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]



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



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



5. 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]



6. 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]

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



2. 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]



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



4. 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]



5. 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]



6. 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]

1. 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]



2. 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]

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



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



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



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



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



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

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



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



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



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

1. 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]



2. 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]



3. 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]



4. 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]

1. Leon Sterling and Ehud Y. Shapiro. The Art of Prolog - Advanced Programming Techniques, 2nd Ed.. MIT Press, 1994.
   Keywords: agentlab. [bibtex-entry]



2. 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]



3. 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]

1. 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]



2. 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]

1. 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]

1. 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]



2. 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]

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



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



3. 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]

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



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



3. 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]

1. 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]

1. 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]

1. 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]



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



3. 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]

1. 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]



2. 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]

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

1. 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]

1. William J. Clancey. Situated cognition : on human knowledge and computer representations, Learning in doing.. Cambridge University Press, Cambridge, U.K. ; New York, NY, USA, .
   Note: 96035839 William J. Clancey. Includes bibliographical references (p. 379-389) and indexes. Introduction: What is situated cognition? -- Pt. I. Representations and memory. 1. Aaron's drawing. 2. Mycin's map. 3. Remembering controversies. 4. Sensorimotor maps versus encodings -- Pt. II. Situated robots. 5. Navigating without reading maps. 6. Perceiving without describing. 7. Remembering without matching. 8. Engineering transactional systems -- Pt. III. Ecological theories. 9. Transactional experience. 10. Dialectic mechanism. 11. The ecological approach to perception -- Pt. IV. Symbols reconsidered. 12. Coupling versus inference. 13. The varieties of symbol systems. 14. Reformulated dilemmas -- Conclusions: Lessons for cognitive science. [abstract] [bibtex-entry]



2. 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]

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.