Back to publication index

Publications of year 2001
Books
  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: "In this book, we present modal logic from a modern semantically-oriented perspective -- that is, as a tool for talking about graphs. We explore the mathematical ramifications of this perspective, discussing such topics as bisimulations between models, frame definability (including the Sahlqvist and Goldblatt-Thomason Theorems), completeness and incompleteness (including rules for the undefinable and step-by-step constructions), the algebra of modal logic (including the Jónsson-Tarski Theorem and its consequences), and the decidability, undecidability, and computational complexity of modal logic. We round off the book with a discussion of six of our favorite topics in extended modal logic: logical modalities, since-until logic, hybrid logic, multi-dimensional modal logic, the guarded fragment, and a Lindström-style theorem for modal logic. We had two main reasons for writing this book. Firstly, we felt that the modern semantically-oriented perspective on modal logic, and its ramifications, were not widely enough known. Second, we felt that there was an awful lot of technical material in the modal literature that deserved a wider audience."

    @Book{Blackburn2001b,
    author = "Patrick Blackburn and Maarten de Rijke and Yde Venema",
    title = "Modal logic",
    publisher = "Cambridge University Press",
    address = "New York",
    note = "00054667 Patrick Blackburn, Maarten de Rijke, Yde Venema. Includes bibliographical references and index.",
    abstract = "In this book, we present modal logic from a modern semantically-oriented perspective -- that is, as a tool for talking about graphs. We explore the mathematical ramifications of this perspective, discussing such topics as bisimulations between models, frame definability (including the Sahlqvist and Goldblatt-Thomason Theorems), completeness and incompleteness (including rules for the undefinable and step-by-step constructions), the algebra of modal logic (including the Jónsson-Tarski Theorem and its consequences), and the decidability, undecidability, and computational complexity of modal logic. We round off the book with a discussion of six of our favorite topics in extended modal logic: logical modalities, since-until logic, hybrid logic, multi-dimensional modal logic, the guarded fragment, and a Lindström-style theorem for modal logic. We had two main reasons for writing this book. Firstly, we felt that the modern semantically-oriented perspective on modal logic, and its ramifications, were not widely enough known. Second, we felt that there was an awful lot of technical material in the modal literature that deserved a wider audience.",
    keywords = "modal logic, honours reading",
    year = "2001",
    
    }
    


  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.
    @Book{Davidson2001,
    author = "Donald Davidson",
    title = "Inquiries into truth and interpretation",
    publisher = "Oxford University Press",
    address = "Oxford",
    edition = "New",
    note = "GBA1-X5144 Donald Davidson. Originally published: 1984. Includes index. Bibliography. Philosophical essays ; v. 2.",
    keywords = "philosophy, ontologies, proof theory, honours reading",
    year = "2001",
    
    }
    


  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: "Volume I: Elements of Classical Logic, deals with the background to what has come to be considered the standard formulation of predicate logic - both as far as its semantics and proof theory are concerned. The central chapter on predicate logic is followed by chapters outlining various alternative, but essentially equivalent ways of constructing the semantics for first-order logic as well as its proof theory. In addition, this volume contains a discussion of higher-order extensions of first-order logic and a compendium of the algorithmic and decision-theoretic prerequisites in the study of logical systems. Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields. Volume III: Alternatives to Classical Logic, consists of a series of surveys of some of the alternatives to the basic assumptions of classical logic. These include many-valued logic, partial logic, free logic, relevance and entailment logics, dialogue logic, quantum logic, and intuitionism. Volume IV: Topics in the Philosophy of Language, presents a panorama of the applications of logical tools and methods in the formal analysis of natural language. Since a number of developments in philosophical logic were originally stimulated by concern arising in the semantic analysis of natural language discourse, the chapters in this volume provide some criteria of evaluation of the applications of work in philosophical logic. In revealing both the adequacies and inadequacies of logical investigations in the semantic structures of natural discourse, these chapters also point the way to future developments in philosophical logic in general and thus close again the circle of inquiry relating logic and language."
    [download paper ]
    @Book{Gabbay2001,
    author = "Dov M. Gabbay and Franz Guenthner",
    title = "Handbook of philosophical logic",
    publisher = "Kluwer Academic Publishers",
    address = "Dordrecht ; Boston",
    edition = "2nd",
    note = "2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.",
    abstract = "Volume I: Elements of Classical Logic, deals with the background to what has come to be considered the standard formulation of predicate logic - both as far as its semantics and proof theory are concerned. The central chapter on predicate logic is followed by chapters outlining various alternative, but essentially equivalent ways of constructing the semantics for first-order logic as well as its proof theory. In addition, this volume contains a discussion of higher-order extensions of first-order logic and a compendium of the algorithmic and decision-theoretic prerequisites in the study of logical systems. Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields. Volume III: Alternatives to Classical Logic, consists of a series of surveys of some of the alternatives to the basic assumptions of classical logic. These include many-valued logic, partial logic, free logic, relevance and entailment logics, dialogue logic, quantum logic, and intuitionism. Volume IV: Topics in the Philosophy of Language, presents a panorama of the applications of logical tools and methods in the formal analysis of natural language. Since a number of developments in philosophical logic were originally stimulated by concern arising in the semantic analysis of natural language discourse, the chapters in this volume provide some criteria of evaluation of the applications of work in philosophical logic. In revealing both the adequacies and inadequacies of logical investigations in the semantic structures of natural discourse, these chapters also point the way to future developments in philosophical logic in general and thus close again the circle of inquiry relating logic and language.",
    URL = "http://www.loc.gov/catdir/enhancements/fy0663/2001029838-d.html",
    keywords = "logic, modal logic, model theory, kripke structures, honours reading, epistemic logic",
    year = "2001",
    
    }
    


  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.
    @Book{Hopcroft2001,
    author = "John E. Hopcroft and Rajeev Motwani and Jeffrey D. Ullman",
    title = "Introduction to automata theory, languages, and computation",
    publisher = "Addison-Wesley",
    address = "Boston",
    edition = "2nd",
    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",
    year = "2001",
    
    }
    


  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.
    @Book{Kern-Isberner2001,
    author = "Gabriele Kern-Isberner",
    title = "Conditionals in Nonmonotonic Reasoning and Belief Revision: Considering Conditionals As Agents",
    publisher = "Springer-Verlag New York, Inc.",
    keywords = "belief revision, nonmonotonic logic, honours reading",
    year = "2001",
    
    }
    


  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.
    @Book{Priest2001,
    author = "Graham Priest",
    title = "An introduction to non-classical logic",
    publisher = "Cambridge University Press",
    address = "Cambridge",
    note = "00023609 GBA1-19206 Graham Priest. Includes bibliographical references and index.",
    keywords = "modal logic, model theory, honours reading",
    year = "2001",
    
    }
    


  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.
    @Book{Reiter2001,
    author = "Raymond Reiter",
    title = "Knowledge in action : logical foundations for specifying and implementing dynamical systems",
    publisher = "MIT Press",
    address = "Cambridge, Mass.",
    note = "The frame problem and the situation calculus",
    keywords = "artificial intelligence, situation calculus, honours reading",
    year = "2001",
    
    }
    


  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.
    @Book{d'Inverno2001,
    editor = "Mark d'Inverno and Michael Luck",
    title = "Understanding agent systems",
    publisher = "Springer",
    address = "New York",
    series = "Springer series on agent technology.",
    note = "2001031126 Mark d'Inverno. Michael Luck (eds.) Includes bibliographical references and index.",
    keywords = "agents, honours reading, proof theory",
    year = "2001",
    
    }
    


Journal Articles and Chapters
  1. 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: "Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields."
    [download paper ]
    @InCollection{Bull2001,
    author = "Robert Bull and Krister Segerberg",
    title = "Basic Modal Logic",
    booktitle = "Handbook of philosophical logic",
    editor = "Dov M. Gabbay and Franz Guenthner",
    publisher = "Kluwer Academic Publishers",
    address = "Dordrecht ; Boston",
    volume = "2",
    edition = "2nd",
    pages = "1--88",
    note = "2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.",
    abstract = "Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields.",
    URL = "http://www.loc.gov/catdir/enhancements/fy0663/2001029838-d.html",
    keywords = "modal logic, honours reading, model theory, kripke structures",
    year = "2001",
    
    }
    


  2. 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: "Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields."
    [download paper ]
    @InCollection{Burgess2001,
    author = "John P. Burgess",
    title = "Basic Tense Logic",
    booktitle = "Handbook of philosophical logic",
    editor = "Dov M. Gabbay and Franz Guenthner",
    publisher = "Kluwer Academic Publishers",
    address = "Dordrecht ; Boston",
    volume = "2",
    edition = "2nd",
    pages = "1--88",
    note = "2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.",
    abstract = "Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields.",
    URL = "http://www.loc.gov/catdir/enhancements/fy0663/2001029838-d.html",
    keywords = "modal logic, honours reading, model theory",
    year = "2001",
    
    }
    


  3. 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: "Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields."
    [download paper ]
    @InCollection{Cocchiarella2001,
    author = "Nino B. Cocchiarella",
    title = "Philosophical perspectives on quantification in tense and modal logic",
    booktitle = "Handbook of philosophical logic",
    editor = "Dov M. Gabbay and Franz Guenthner",
    publisher = "Kluwer Academic Publishers",
    address = "Dordrecht ; Boston",
    volume = "2",
    edition = "2nd",
    pages = "1--88",
    note = "2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.",
    abstract = "Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields.",
    URL = "http://www.loc.gov/catdir/enhancements/fy0663/2001029838-d.html",
    keywords = "modal logic, honours reading, model theory",
    year = "2001",
    
    }
    


  4. 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: "Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields."
    [download paper ]
    @InCollection{Garson2001,
    author = "JAmes W. Garson",
    title = "Quantification in Modal Logic",
    booktitle = "Handbook of philosophical logic",
    editor = "Dov M. Gabbay and Franz Guenthner",
    publisher = "Kluwer Academic Publishers",
    address = "Dordrecht ; Boston",
    volume = "2",
    edition = "2nd",
    pages = "1--88",
    note = "2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.",
    abstract = "Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields.",
    URL = "http://www.loc.gov/catdir/enhancements/fy0663/2001029838-d.html",
    keywords = "modal logic, honours reading, model theory",
    year = "2001",
    
    }
    


  5. 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: "Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields."
    [download paper ]
    @InCollection{Thomason2001,
    author = "Richard H. Thomason",
    title = "Combinations of tense and modality",
    booktitle = "Handbook of philosophical logic",
    editor = "Dov M. Gabbay and Franz Guenthner",
    publisher = "Kluwer Academic Publishers",
    address = "Dordrecht ; Boston",
    volume = "2",
    edition = "2nd",
    pages = "1--88",
    note = "2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.",
    abstract = "Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields.",
    URL = "http://www.loc.gov/catdir/enhancements/fy0663/2001029838-d.html",
    keywords = "modal logic, honours reading, model theory",
    year = "2001",
    
    }
    


  6. 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: "Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields."
    [download paper ]
    @InCollection{van_Benthem2001,
    author = "Johan van Benthem",
    title = "Correspondence theory",
    booktitle = "Handbook of philosophical logic",
    editor = "Dov M. Gabbay and Franz Guenthner",
    publisher = "Kluwer Academic Publishers",
    address = "Dordrecht ; Boston",
    volume = "2",
    edition = "2nd",
    pages = "1--88",
    note = "2001029838 GBA467666 edited by D.M. Gabbay and F. Guenthner. Includes bibliographical references and index.",
    abstract = "Volume II: Extensions of Classical Logic, surveys the most significant intensional' extensions of predicate logic and their applications to various philosophical fields of inquiry. The twelve chapters in this volume together provide a succinct introduction to a variety of intensional frameworks, a discussion of the most well-known logical systems, as well as an overview of major applications and of the open problems in the respective fields.",
    URL = "http://www.loc.gov/catdir/enhancements/fy0663/2001029838-d.html",
    keywords = "modal logic, honours reading, model theory",
    year = "2001",
    
    }
    


  7. W. R. Wobcke. An Operational Semantics for a PRS-like Agent Architecture. In M. Stumptner, M., Corbett, D. & Brooks, editor,AI 2001: Advances in Artificial Intelligence.. Springer-Verlag, Berlin, 2001.
    Keywords: agentlab, procedural reasoning, models of interaction and context aware applications.
    @InCollection{Wobcke2001b,
    author = "W. R. Wobcke",
    title = "An Operational Semantics for a {PRS}-like Agent Architecture",
    booktitle = "AI 2001: Advances in Artificial Intelligence.",
    editor = "M. {Stumptner, M., Corbett, D. & Brooks}",
    publisher = "Springer-Verlag, Berlin",
    keywords = "agentlab, procedural reasoning, models of interaction and context aware applications",
    year = "2001",
    
    }
    


  8. 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.
    @Article{Alonso2001,
    author = "F. Alonso and M. d'Inverno and D. Kudenko and M. Luck and J. Noble",
    title = "Learning in Agents and Multi-Agent Systems",
    journal = "Knowledge Engineering Review",
    volume = "16",
    number = "3",
    pages = "277--284",
    keywords = "machine learning, agents, honours reading",
    year = "2001",
    
    }
    


  9. 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: "We provide a resolution-based proof procedure for modal, description and hybrid logic that improves on previous proposals in important ways. It avoids translations into large undecidable logics, and works directly on modal, description or hybrid logic formulas instead. In addition, by using the hybrid machinery it avoids the complexities of earlier propositional resolution-based methods for modal logic. It combines ideas from the method of prefixes used in tableaux, and resolution ideas in such a way that some of the heuristics and optimizations devised in either field are applicable."

    @Article{Areces2001,
    author = "C. Areces and H. de Nivelle and M. de Rijke",
    title = "Resolution in Modal, Description and Hybrid Logic",
    journal = "Journal of Logic and Computation",
    volume = "11",
    number = "5",
    pages = "717--736",
    abstract = "We provide a resolution-based proof procedure for modal, description and hybrid logic that improves on previous proposals in important ways. It avoids translations into large undecidable logics, and works directly on modal, description or hybrid logic formulas instead. In addition, by using the hybrid machinery it avoids the complexities of earlier propositional resolution-based methods for modal logic. It combines ideas from the method of prefixes used in tableaux, and resolution ideas in such a way that some of the heuristics and optimizations devised in either field are applicable.",
    keywords = "hybrid logic, modal logic, proof theory, logic programming, agent programming languages, honours reading",
    year = "2001",
    
    }
    


  10. 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: "We discuss from a practical point of view a number of issues involved in writing distributed Internet and WWW applications using LP/CLP systems. We describe PiLLoW, a public-domain Internet and WWW programming library for LP/CLP systems that we have designed to simplify the process of writing such applications. PiLLoW provides facilities for accessing documents and code on the WWW; parsing, manipulating and generating HTML and XML structured documents and data; producing HTML forms; writing form handlers and CGI-scripts; and processing HTML/XML templates. An important contribution of PiLLoW is to model HTML/XML code (and, thus, the content of WWW pages) as terms. The PiLLoW library has been developed in the context of the Ciao Prolog system, but it has been adapted to a number of popular LP/CLP systems, supporting most of its functionality. We also describe the use of concurrency and a high-level model of client-server interaction, Ciao Prolog's active modules, in the context of WWW programming. We propose a solution for client-side downloading and execution of Prolog code, using generic browsers. Finally, we also provide an overview of related work on the topic."
    [download paper ]
    @Article{Cabeza2001,
    author = "D. Cabeza and M. Hermenegildo",
    title = "Distributed {WWW} programming using (Ciao-) Prolog and the Pi{LL}o{W} library",
    journal = "Theory and Practice of Logic Programming",
    volume = "1",
    pages = "251--282",
    abstract = "We discuss from a practical point of view a number of issues involved in writing distributed Internet and WWW applications using LP/CLP systems. We describe PiLLoW, a public-domain Internet and WWW programming library for LP/CLP systems that we have designed to simplify the process of writing such applications. PiLLoW provides facilities for accessing documents and code on the WWW; parsing, manipulating and generating HTML and XML structured documents and data; producing HTML forms; writing form handlers and CGI-scripts; and processing HTML/XML templates. An important contribution of PiLLoW is to model HTML/XML code (and, thus, the content of WWW pages) as terms. The PiLLoW library has been developed in the context of the Ciao Prolog system, but it has been adapted to a number of popular LP/CLP systems, supporting most of its functionality. We also describe the use of concurrency and a high-level model of client-server interaction, Ciao Prolog's active modules, in the context of WWW programming. We propose a solution for client-side downloading and execution of Prolog code, using generic browsers. Finally, we also provide an overview of related work on the topic.",
    URL = "://7064912",
    keywords = "agent programming languages, honours reading, logic programming",
    year = "2001",
    
    }
    


  11. 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.
    @Article{Castelfranchi2001,
    author = "Christiano Castelfranchi",
    title = "The theory of social functions: challenges for computational social science and multi-agent learning",
    journal = "Journal of cognitive systems research",
    volume = "1",
    pages = "5--38",
    keywords = "cognitive science, machine learning, agents, intentionality, honours reading",
    year = "2001",
    
    }
    


  12. 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: "Association-rule mining has heretofore relied on the condition of high support to do its work efficiently. In particular, the well-known a priori algorithm is only effective when the only rules of interest are relationships that occur very frequently...."

    @Article{Cohen2001,
    author = "E. Cohen and M. Datar and S. Fujiwara and A. Gionis and P. Indyk and R. Motwani and J. D. Ullman and C. Yang",
    title = "Finding interesting associations without support pruning",
    journal = "Knowledge and Data Engineering, IEEE Transactions on",
    volume = "13",
    number = "1",
    pages = "64--78",
    abstract = "Association-rule mining has heretofore relied on the condition of high support to do its work efficiently. In particular, the well-known a priori algorithm is only effective when the only rules of interest are relationships that occur very frequently....",
    keywords = "machine leaning, honours reading",
    year = "2001",
    
    }
    


  13. 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.
    @Article{Gmytrasiewicz2001,
    author = "Piotr J. Gmytrasiewicz and Edmund H. Durfee",
    title = "Rational Communication in Multi-Agent Environments.",
    journal = "Autonomous Agents and Multi-Agent Systems",
    volume = "4",
    number = "3",
    pages = "A233--272",
    keywords = "agent communication languagess, honours reading",
    year = "2001",
    
    }
    


  14. 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.
    @Article{Hu2001,
    author = "Junling Hu and Michael P. Weliman",
    title = "Learning about other agents in a dynamic multiagent system",
    journal = "Journal of cognitive systems research",
    volume = "1",
    pages = "67--79",
    keywords = "cognitive science, machine learning, agents, honours reading",
    year = "2001",
    
    }
    


  15. David Kinny. Reliable Agent Communication - a Pragmatic Perspective. New Generation Computing, 19(2):139--156, 2001.
    Keywords: agentlab, models of interaction and context aware applications, agent communication languages.
    @Article{Kinny2001c,
    author = "David Kinny",
    title = "Reliable Agent Communication - a Pragmatic Perspective",
    journal = "New Generation Computing",
    volume = "19",
    number = "2",
    pages = "139--156",
    keywords = "agentlab, models of interaction and context aware applications, agent communication languages",
    year = "2001",
    
    }
    


  16. 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.
    @Article{McBurney2001,
    author = "P. McBurney and S. Parsons",
    title = "Representing epistemic uncertainty by means of dialectical argumentation",
    journal = "Annals of Mathematics and Artificial Intelligence",
    volume = "32",
    pages = "125--169",
    keywords = "argumentation, honours reading, logistics",
    year = "2001",
    
    }
    


  17. 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: "Autonomous agents are systems capable of autonomous decision-making in real-time environments. Computation is a valuable resource for such decision-making, and yet the amount of computation that an autonomous agent may carry out will be limited. It follows that an agent must be equipped with a mechanism that enables it to make the best possible use of the computational resources at its disposal. In this paper we review three approaches to the control of computation in resource-bounded agents. In addition to a detailed description of each framework, this paper compares and contrasts the approaches, and lists the advantages and disadvantages of each. (38 References)."

    @Article{Schut2001,
    author = "M. Schut and M. Wooldridge",
    title = "The control of reasoning in resource-bounded agents",
    journal = "The Knowledge Engineering Review",
    volume = "16",
    number = "3",
    pages = "215--40",
    note = "Publisher: Cambridge University Press, UK.",
    abstract = "Autonomous agents are systems capable of autonomous decision-making in real-time environments. Computation is a valuable resource for such decision-making, and yet the amount of computation that an autonomous agent may carry out will be limited. It follows that an agent must be equipped with a mechanism that enables it to make the best possible use of the computational resources at its disposal. In this paper we review three approaches to the control of computation in resource-bounded agents. In addition to a detailed description of each framework, this paper compares and contrasts the approaches, and lists the advantages and disadvantages of each. (38 References).",
    keywords = "agent programming languages, honours reading",
    year = "2001",
    
    }
    


  18. 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: "Given domain-specific background knowledge and data in the form of examples, an Inductive Logic Programming (ILP) system extracts models in the data-analytic sense. We view the model-selection step facing an ILP system as a decision problem, the solution of which requires knowledge of the context in which the model is to be deployed. In this paper, {"}context{"} will be defined by the current specification of the prior class distribution and the client's preferences concerning errors of classification. Within this restricted setting, we consider the use of an ILP system in situations where: (a) contexts can change regularly. This can arise for example, from changes to class distributions or misclassification costs; and (b) the data are from observational studies. That is, they may not have been collected with any particular context in mind. Some repercussions of these are: (a) any one model may not be the optimal choice for all contexts; and (b) not all the background information provided may be relevant for all contexts. Using results from the analysis of Receiver Operating Characteristic curves, we investigate a technique that can equip an ILP system to reject those models that cannot possibly be optimal in any context. We present empirical results from using the technique to analyse two datasets concerned with the toxicity of chemicals (in particular, their mutagenic and carcinogenic properties). Clients can, and typically do, approach such datasets with quite different requirements. For example, a synthetic chemist would require models with a low rate of commission errors which could be used to direct efficiently the synthesis of new compounds. A toxicologist on the other hand, would prefer models with a low rate of omission errors. This would enable a more complete identification of toxic chemicals at a calculated cost of misidentification of non-toxic cases as toxic. The approach adopted here attempts to obtain a solution that contains models that are optimal for each such user according to the cost function that he or she wishes to apply. In doing so, it also provides one solution to the problem of how the relevance of background predicates is to be assessed in ILP."
    [download paper ]
    @Article{Srinivasan2001,
    author = "A. Srinivasan",
    title = "Extracting context-sensitive models in inductive logic programming",
    journal = "Machine Learning",
    volume = "44",
    number = "3",
    pages = "301--324",
    note = "Times Cited: 0 Article English Cited References Count: 37 446qq",
    abstract = "Given domain-specific background knowledge and data in the form of examples, an Inductive Logic Programming (ILP) system extracts models in the data-analytic sense. We view the model-selection step facing an ILP system as a decision problem, the solution of which requires knowledge of the context in which the model is to be deployed. In this paper, {"}context{"} will be defined by the current specification of the prior class distribution and the client's preferences concerning errors of classification. Within this restricted setting, we consider the use of an ILP system in situations where: (a) contexts can change regularly. This can arise for example, from changes to class distributions or misclassification costs; and (b) the data are from observational studies. That is, they may not have been collected with any particular context in mind. Some repercussions of these are: (a) any one model may not be the optimal choice for all contexts; and (b) not all the background information provided may be relevant for all contexts. Using results from the analysis of Receiver Operating Characteristic curves, we investigate a technique that can equip an ILP system to reject those models that cannot possibly be optimal in any context. We present empirical results from using the technique to analyse two datasets concerned with the toxicity of chemicals (in particular, their mutagenic and carcinogenic properties). Clients can, and typically do, approach such datasets with quite different requirements. For example, a synthetic chemist would require models with a low rate of commission errors which could be used to direct efficiently the synthesis of new compounds. A toxicologist on the other hand, would prefer models with a low rate of omission errors. This would enable a more complete identification of toxic chemicals at a calculated cost of misidentification of non-toxic cases as toxic. The approach adopted here attempts to obtain a solution that contains models that are optimal for each such user according to the cost function that he or she wishes to apply. In doing so, it also provides one solution to the problem of how the relevance of background predicates is to be assessed in ILP.",
    URL = "://000169524300005",
    keywords = "inductive logic programming, unification, honours reading",
    year = "2001",
    
    }
    


  19. Leon Sterling, Lee Naish, and Manuel V. Hermenegildo. Guest editor's introduction Special issue on Logic Programming and the Internet. TPLP, 1(3):249--250, 2001.
    Keywords: agentlab, agent-oriented software engineering.
    @Article{Sterling2001b,
    author = "Leon Sterling and Lee Naish and Manuel V. Hermenegildo",
    title = "Guest editor's introduction Special issue on Logic Programming and the Internet",
    journal = "TPLP",
    volume = "1",
    number = "3",
    pages = "249--250",
    keywords = "agentlab, agent-oriented software engineering",
    year = "2001",
    
    }
    


  20. L. Sterling, L. Naish, and M. Hermenegildo. Special Issue on Logic Programming and the INTERNET. Theory and Practice of Logic Programming, 1(3):249--250, 2001.
    Keywords: agentlab, agent-oriented software engineering, agent oriented software engineering.
    @Article{Sterling2001,
    author = "L. Sterling and L. Naish and M. Hermenegildo",
    title = "Special Issue on Logic Programming and the {INTERNET}",
    journal = "Theory and Practice of Logic Programming",
    volume = "1",
    number = "3",
    pages = "249--250",
    keywords = "agentlab, agent-oriented software engineering, agent oriented software engineering",
    year = "2001",
    
    }
    


  21. 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: "As a part of my group's activities on the extension of the fluent calculus (Holldobler and Schneeberger 1990; Thielscher 1998), I've been working to provide an efficient inference engine for the fluent calculus by using the efficiency of binary decision diagrams (BDDs) (Bryant 1986). In the past, BDDs have significantly improved the performance of algorithms and enabled the solution of new classes of problems in areas such as formal verification and logic synthesis (see, for example, Burch et al. [1992]). Surprisingly, BDDs have only recently been introduced to implement the solution of planning problems (Cimatti et al. 1997). The goal of our project was to investigate whether BDDs might also help to increase the efficiency of algorithms solving problems in the field of reasoning about action and change. For a start, I have implemented the solution of fluent calculus planning problems restricted to deterministic actions and propositional fluents (Holldobler and Storr 2000; Storr 2001)."
    [download paper ]
    @Article{Storr2001,
    author = "H. P. Storr",
    title = "Planning in the fluent calculus using binary decision diagrams",
    journal = "AI Magazine",
    volume = "22",
    number = "3",
    pages = "103--105",
    abstract = "As a part of my group's activities on the extension of the fluent calculus (Holldobler and Schneeberger 1990; Thielscher 1998), I've been working to provide an efficient inference engine for the fluent calculus by using the efficiency of binary decision diagrams (BDDs) (Bryant 1986). In the past, BDDs have significantly improved the performance of algorithms and enabled the solution of new classes of problems in areas such as formal verification and logic synthesis (see, for example, Burch et al. [1992]). Surprisingly, BDDs have only recently been introduced to implement the solution of planning problems (Cimatti et al. 1997). The goal of our project was to investigate whether BDDs might also help to increase the efficiency of algorithms solving problems in the field of reasoning about action and change. For a start, I have implemented the solution of fluent calculus planning problems restricted to deterministic actions and propositional fluents (Holldobler and Storr 2000; Storr 2001).",
    URL = "://7077920",
    keywords = "agent programming languages, situation calculus, honours reading",
    year = "2001",
    
    }
    


  22. Ron Sun. Computation, reduction, and releology of conciousness. Journal of cognitive systems research, 1:241--249, 2001.
    Keywords: cognitive science, philosophy, honours reading.
    @Article{Sun2001,
    author = "Ron Sun",
    title = "Computation, reduction, and releology of conciousness",
    journal = "Journal of cognitive systems research",
    volume = "1",
    pages = "241--249",
    keywords = "cognitive science, philosophy, honours reading",
    year = "2001",
    
    }
    


  23. 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: "The author discusses games of both perfect and imperfect information at two levels of structural detail: players' local actions, and their global powers for determining outcomes of the game. Matching logical languages are proposed for both. In particular, at the {"}action level{"}, imperfect information games naturally model a combined {"}dynamic-epistemic language{"}--and correspondences are found between special axioms in this language and particular modes of playing games with their information dynamics. At the {"}outcome level{"}, the paper presents suitable notions of game equivalence, and some simple representation results. Copyright 2001 by Blackwell Publishing Ltd and the Board of Trustees of the Bulletin of Economic Research"

    @Article{van_Benthem2001b,
    author = "Johan van Benthem",
    title = "Games in Dynamic-Epistemic Logic",
    journal = "Bulletin of Economic Research",
    volume = "53",
    number = "4",
    pages = "219--48",
    abstract = "The author discusses games of both perfect and imperfect information at two levels of structural detail: players' local actions, and their global powers for determining outcomes of the game. Matching logical languages are proposed for both. In particular, at the {"}action level{"}, imperfect information games naturally model a combined {"}dynamic-epistemic language{"}--and correspondences are found between special axioms in this language and particular modes of playing games with their information dynamics. At the {"}outcome level{"}, the paper presents suitable notions of game equivalence, and some simple representation results. Copyright 2001 by Blackwell Publishing Ltd and the Board of Trustees of the Bulletin of Economic Research",
    keywords = "epistemic logic, game theory, algorithms, honours reading",
    year = "2001",
    
    }
    


Conference Proceedings
  1. G. Au, S. Goss, C. Heinze, and A. R. Pearce. RescueModel: A Multi-Agent Simulation of Bushfire Disaster Management. In Peter Stone, editor, Proc. RoboCup2000, RoboCup IV in Lecture Notes in Artificial Intelligence vol. 2019, volume 2019, Melbourne, pages 285--290, 2001.
    Keywords: agentlab, agent-oriented software engineering, RoboCup.
    @InProceedings{Au2001,
    author = "G. Au and S. Goss and C. Heinze and A. R. Pearce",
    title = "RescueModel: {A} Multi-Agent Simulation of Bushfire Disaster Management",
    booktitle = "Proc. RoboCup2000, RoboCup IV in Lecture Notes in Artificial Intelligence vol. 2019",
    editor = "Peter Stone",
    address = "Melbourne",
    volume = "2019",
    pages = "285--290",
    keywords = "agentlab, agent-oriented software engineering, RoboCup",
    year = "2001",
    
    }
    


  2. John Bell. Causal Counterfactuals. In Common Sense-2001, 2001.
    Keywords: counterfactuals, model theory, honours reading.

    Abstract: "The formal possible-worlds analysis of counterfactuals has tended to concentrate on their semantics and logic, with their pragmatics being given informally. However, if counterfactuals are to be of use in Artificial Intelligence, it is necessary to provide formal pragmatics for them. This is done in this paper by combining work on the representation of common sense reasoning about events with an appropriate semantics for counterfactuals. The resulting combination provides a unified framework for formal reasoning about actual and counterfactual events."

    @InProceedings{Bell2001,
    author = "John Bell",
    title = "Causal Counterfactuals",
    booktitle = "Common Sense-2001",
    abstract = "The formal possible-worlds analysis of counterfactuals has tended to concentrate on their semantics and logic, with their pragmatics being given informally. However, if counterfactuals are to be of use in Artificial Intelligence, it is necessary to provide formal pragmatics for them. This is done in this paper by combining work on the representation of common sense reasoning about events with an appropriate semantics for counterfactuals. The resulting combination provides a unified framework for formal reasoning about actual and counterfactual events.",
    keywords = "counterfactuals, model theory, honours reading",
    year = "2001",
    
    }
    


  3. 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.
    @InProceedings{Blackburn2001,
    author = "Patrick Blackburn and Jaap Kamps and Maarten Marx",
    title = "Situation Calculus as Hybrid Logic: First Steps",
    booktitle = "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",
    publisher = "Springer-Verlag London, UK",
    pages = "253--260",
    keywords = "situation calculus, agent programming languages, modal logic, model theory, honours reading",
    year = "2001",
    
    }
    


  4. Dan Boneh and Matthew K. Franklin. Identity-Based Encryption from the Weil Pairing. In CRYPTO 2001, pages 213--229, 2001.
    Keywords: cryptography, honours reading.
    @InProceedings{Boneh2001,
    author = "Dan Boneh and Matthew K. Franklin",
    title = "Identity-Based Encryption from the Weil Pairing",
    booktitle = "CRYPTO 2001",
    pages = "213--229",
    keywords = "cryptography, honours reading",
    year = "2001",
    
    }
    


  5. Kevin Chan. An Agent-Based Approach To Computer Assisted Code Inspections. In Proceedings of the 13th Australian Software Engineering Conference (ASWEC'01), Canberra, Australia, pages 147--152, 2001.
    Keywords: agentlab, agent-oriented software engineering.
    @InProceedings{Chan2001,
    author = "Kevin Chan",
    title = "An Agent-Based Approach To Computer Assisted Code Inspections",
    booktitle = "Proceedings of the 13th Australian Software Engineering Conference (ASWEC'01)",
    address = "Canberra, Australia",
    pages = "147--152",
    keywords = "agentlab, agent-oriented software engineering",
    year = "2001",
    
    }
    


  6. Frank Dignum, David Kinny, and Liz Sonenberg. Motivational Attitudes of Agents: On Desires, Obligations, and Norms. In Proceedings of CEEMAS 2001, pages 83--92, 2001.
    Keywords: agentlab, models of interaction and context aware applications.
    @InProceedings{Dignum2001,
    author = "Frank Dignum and David Kinny and Liz Sonenberg",
    title = "Motivational Attitudes of Agents: On Desires, Obligations, and Norms",
    booktitle = "Proceedings of CEEMAS 2001",
    pages = "83--92",
    keywords = "agentlab, models of interaction and context aware applications",
    year = "2001",
    
    }
    


  7. 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.
    @InProceedings{Ebner2001,
    author = "A. Ebner and H. Rohling",
    title = "A {SELF}-{ORGANIZED} {RADIO} {NETWORK} {FOR} {AUTOMOTIVE} {APPLICATIONS}",
    booktitle = "ITS 2001, 8th World Congress on Intelligent Transportation Systems",
    address = "Sydney, Australia",
    keywords = "sensor networks, simulation, honours reading",
    year = "2001",
    
    }
    


  8. X. Gao and L. Sterling. I. Knowledge-Based Information Agents. In PRIAA 2000: Lecture Notes in Computer Science vol 2112, Melbourne, pages 229--238, 2001.
    Keywords: agentlab, agent-oriented software engineering.
    @InProceedings{Gao2001,
    author = "X. Gao and L. Sterling. I",
    title = "Knowledge-Based Information Agents",
    booktitle = "PRIAA 2000: Lecture Notes in Computer Science vol 2112",
    address = "Melbourne",
    pages = "229--238",
    keywords = "agentlab, agent-oriented software engineering",
    year = "2001",
    
    }
    


  9. S. Goschnick and L. Sterling. ShadowBoard: an Agent-orientated Model-View-Controller (AoMVC) Architecture for a Digital Self. In Proceedings of the Seventh International Conference on Distributed Multimedia Systems, Taipei, pages 24--29, 2001.
    Keywords: agentlab, context-aware applications.
    @InProceedings{Goschnick2001,
    author = "S. Goschnick and L. Sterling",
    title = "ShadowBoard: an Agent-orientated Model-View-Controller (Ao{MVC}) Architecture for a Digital Self",
    booktitle = "Proceedings of the Seventh International Conference on Distributed Multimedia Systems",
    address = "Taipei",
    pages = "24--29",
    keywords = "agentlab, context-aware applications",
    year = "2001",
    
    }
    


  10. Clinton Heinze, Simon Goss, Torgny Josefsson, Kerry Bennett, Sam Waugh, Ian J. Lloyd, Graeme Murray, and Johnathan Oldfield. Interchanging agents and humans in military simulation. In Proceedings of the Innovative applications of artificial intelligence conference (IAAI2001) - held in conjunction with the American Association for Artificial Intelligence conference (AAAI) ., Seattle, pages 27--34, 2001.
    Keywords: agent-oriented software engineering, agents, simulation, agentlab.
    @InProceedings{Heinze2001,
    author = "Clinton Heinze and Simon Goss and Torgny Josefsson and Kerry Bennett and Sam Waugh and Ian J. Lloyd and Graeme Murray and Johnathan Oldfield",
    title = "Interchanging agents and humans in military simulation",
    booktitle = "Proceedings of the Innovative applications of artificial intelligence conference (IAAI2001) - held in conjunction with the American Association for Artificial Intelligence conference (AAAI) .",
    address = "Seattle",
    pages = "27--34",
    keywords = "agent-oriented software engineering, agents, simulation, agentlab",
    year = "2001",
    
    }
    


  11. 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.
    @InProceedings{Kazakov2001,
    author = "D. Kazakov and D. Kudenko",
    title = "Machine learning and inductive logic programming for multi-agent systems",
    booktitle = "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",
    address = "Prague, Czech Republic",
    publisher = "Springer Verlag",
    pages = "246--270",
    keywords = "inductive logic programming, machine learning, agents, honours reading",
    year = "2001",
    
    }
    


  12. E. Kazmierczak, L. Sterling, and A. Senyard. Software Engineering for High Integrity Systems. In Proceedings of the 6th World Congress of Chemical Engineering, Melbourne, pages 1--6, 2001.
    Keywords: agentlab, agent-oriented software engineering.
    @InProceedings{Kazmierczak2001,
    author = "E. Kazmierczak and L. Sterling and A. Senyard",
    title = "Software Engineering for High Integrity Systems",
    booktitle = "Proceedings of the 6th World Congress of Chemical Engineering",
    address = "Melbourne",
    pages = "1--6",
    keywords = "agentlab, agent-oriented software engineering",
    year = "2001",
    
    }
    


  13. David Kinny. The Psi Calculus: An Algebraic Agent Language. In Proceedingso fATAL 2001, pages 32--50, 2001.
    Keywords: agentlab, models of interaction and context aware applications.
    @InProceedings{Kinny2001b,
    author = "David Kinny",
    title = "The Psi Calculus: An Algebraic Agent Language",
    booktitle = "Proceedingso fATAL 2001",
    pages = "32--50",
    keywords = "agentlab, models of interaction and context aware applications",
    year = "2001",
    
    }
    


  14. David Kinny. Reliable Agent Computation: An Algebraic Approach. In Proceedings of PRIMA 2001, pages 31--47, 2001.
    Keywords: agentlab, models of interaction and context aware applications.
    @InProceedings{Kinny2001d,
    author = "David Kinny",
    title = "Reliable Agent Computation: An Algebraic Approach",
    booktitle = "Proceedings of PRIMA 2001",
    pages = "31--47",
    keywords = "agentlab, models of interaction and context aware applications",
    year = "2001",
    
    }
    


  15. Kendall Lister and Leon Sterling. Agents in a Multi-Cultural World: Towards Ontological Reconciliation. In Proceedings of the Australian Joint Conference on Artificial Intelligence (AI01), pages 321--332, 2001.
    Keywords: agentlab, agent-oriented software engineering.
    @InProceedings{Lister2001,
    author = "Kendall Lister and Leon Sterling",
    title = "Agents in a Multi-Cultural World: Towards Ontological Reconciliation",
    booktitle = "Proceedings of the Australian Joint Conference on Artificial Intelligence (AI01)",
    pages = "321--332",
    keywords = "agentlab, agent-oriented software engineering",
    year = "2001",
    
    }
    


  16. Emma Norling. Learning to Notice: Adaptive Models of Human Operators. In Doina Precup Stone and Peter, editors, Proceedings of the Agents-2001 Workshop on Learning Agents, Montreal, Canada, 2001.
    Keywords: agentlab, models of interaction and context aware applications.
    @InProceedings{Norling2001,
    author = "Emma Norling",
    title = "Learning to Notice: Adaptive Models of Human Operators",
    booktitle = "Proceedings of the Agents-2001 Workshop on Learning Agents",
    editor = "Doina Precup Stone and Peter",
    address = "Montreal, Canada",
    keywords = "agentlab, models of interaction and context aware applications",
    year = "2001",
    
    }
    


  17. Emma Norling and Frank Ritter. Embodying the JACK Agent Architecture. In Proceedings of the 14th Australian Joint Conference on Artificial Intelligence (AI'01), pages 368--377, 2001.
    Keywords: agentlab, models of interaction and context aware applications.
    @InProceedings{Norling2001b,
    author = "Emma Norling and Frank Ritter",
    title = "Embodying the {JACK} Agent Architecture",
    booktitle = "Proceedings of the 14th Australian Joint Conference on Artificial Intelligence (AI'01)",
    pages = "368--377",
    keywords = "agentlab, models of interaction and context aware applications",
    year = "2001",
    
    }
    


  18. Michael Papasimeon and Clint Heinze. Extending the UML for Designing Jack Agents.. In Proceedings of the 13th Australian Software Engineering Conference (ASWEC'01), Canberra, Australia, 2001.
    Keywords: agent-oriented software engineering, agents, agentlab, multi-agent simulation.
    @InProceedings{Papasimeon2001,
    author = "Michael Papasimeon and Clint Heinze",
    title = "Extending the {UML} for Designing Jack Agents.",
    booktitle = "Proceedings of the 13th Australian Software Engineering Conference (ASWEC'01)",
    address = "Canberra, Australia",
    keywords = "agent-oriented software engineering, agents, agentlab, multi-agent simulation",
    year = "2001",
    
    }
    


  19. T Kotagiri Ramamohanarao, James Bailey, and Paolo Busetta. Transaction Oriented Computational Models for Multi-Agent Systems. In Proceedings of 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), Dallas, U.S.A., pages 11--17, 2001.
    Keywords: agentlab, transaction-oriented multi-agent systems, databases.
    @InProceedings{Ramamohanarao2001,
    author = "T Kotagiri Ramamohanarao and James Bailey and Paolo Busetta",
    title = "Transaction Oriented Computational Models for Multi-Agent Systems",
    booktitle = "Proceedings of 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI)",
    address = "Dallas, U.S.A.",
    pages = "11--17",
    keywords = "agentlab, transaction-oriented multi-agent systems, databases",
    year = "2001",
    
    }
    


  20. A. Senyard, L. Sterling, E. Kazmierczak, and P. Dart. Software Engineering Issues for Chemical Engineers. In Proceedings of the 6th World Congress of Chemical Engineering, pages 1--10, 2001.
    Keywords: agentlab, agent-oriented software engineering.
    @InProceedings{Senyard2001,
    author = "A. Senyard and L. Sterling and E. Kazmierczak and P. Dart",
    title = "Software Engineering Issues for Chemical Engineers",
    booktitle = "Proceedings of the 6th World Congress of Chemical Engineering",
    pages = "1--10",
    keywords = "agentlab, agent-oriented software engineering",
    year = "2001",
    
    }
    


  21. 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.
    @InProceedings{Tambe2001,
    author = "Milind Tambe and Bavid V. Pynadeth",
    title = "Towards Heterogeneous Agent Teams",
    booktitle = "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",
    address = "Prague, Czech Republic",
    publisher = "Springer Verlag",
    pages = "187--210",
    keywords = "teamwork, coordination, honours reading",
    year = "2001",
    
    }
    


  22. P. Wallis, H. Mitchard, J. Das, and D. O'Dea. Dialogue Modelling for a Conversational Agent. In Australian Joint Conference on Artificial Intelligence, pages 532--544, 2001.
    Keywords: agentlab, computational linguistics.
    @InProceedings{Wallis2001,
    author = "P. Wallis and H. Mitchard and J. Das and D. O'Dea",
    title = "Dialogue Modelling for a Conversational Agent",
    booktitle = "Australian Joint Conference on Artificial Intelligence",
    pages = "532--544",
    keywords = "agentlab, computational linguistics",
    year = "2001",
    
    }
    


  23. W. R. Wobcke. A Calendar Management Agent with Fuzzy Logic. In Proceedings of the Second Asia-Pacific Conference on Intelligent Agent Technology, 2001.
    Keywords: agentlab, models of interaction and context aware applications.
    @InProceedings{Wobcke2001,
    author = "W. R. Wobcke",
    title = "A Calendar Management Agent with Fuzzy Logic",
    booktitle = "Proceedings of the Second Asia-Pacific Conference on Intelligent Agent Technology",
    keywords = "agentlab, models of interaction and context aware applications",
    year = "2001",
    
    }
    


Thesis
  1. Mohammad Taghi Hajiaghayi. Algorithms for Graphs of (Locally) Bounded Treewidth. PhD thesis, University of Waterloo, 2001.
    Keywords: graph matching, graph theory, algorithms, honours reading.
    @PhdThesis{Hajiaghayi2001,
    author = "Mohammad Taghi Hajiaghayi",
    title = "Algorithms for Graphs of (Locally) Bounded Treewidth",
    school = "University of Waterloo",
    keywords = "graph matching, graph theory, algorithms, honours reading",
    year = "2001",
    
    }
    


  2. David Kinny. Fundamentals of agent computation theory: semantics. PhD, The University of Melbourne, 2001.
    Keywords: agentlab, models of interaction and context aware applications.
    @PhdThesis{Kinny2001,
    author = "David Kinny",
    title = "Fundamentals of agent computation theory: semantics",
    school = "The University of Melbourne",
    type = "PhD",
    keywords = "agentlab, models of interaction and context aware applications",
    year = "2001",
    
    }
    


  3. Hongen Lu. Building multi-agent systems for information gathering from the World Wide Web. PhD, The University of Melbourne, 2001.
    Keywords: agentlab, agent-oriented software engineering.
    @PhdThesis{Lu2001,
    author = "Hongen Lu",
    title = "Building multi-agent systems for information gathering from the World Wide Web",
    school = "The University of Melbourne",
    type = "PhD",
    keywords = "agentlab, agent-oriented software engineering",
    year = "2001",
    
    }
    


Tehnical Reports
  1. L Babai. Communication complexity. Technical Report TR-2001-09, Department of Computer Science, The University of Chicago, 2001 2001.
    Keywords: computational complexity, honours reading.
    @TechReport{Babai2001,
    author = "L Babai",
    title = "Communication complexity",
    institution = "Department of Computer Science, The University of Chicago",
    number = "TR-2001-09",
    type = "Technical Report",
    month = "2001",
    keywords = "computational complexity, honours reading",
    year = "2001",
    
    }
    


  2. Bernard Chazelle. The PCP Theorem. Technical Report 2001, Princeton University, 2001.
    Keywords: computational complexity, honours reading.
    @TechReport{Chazelle2001,
    author = "Bernard Chazelle",
    title = "The {PCP} Theorem",
    institution = "Princeton University",
    number = "2001",
    type = "Technical Report",
    keywords = "computational complexity, honours reading",
    year = "2001",
    
    }
    



Back to publication index



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.

Bibliography last modified: Fri Aug 6 11:18:01 2010 translated from BibTEX by bibtex2html