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.
   

   @Book{Fagin1995,
   author = "Ronald Fagin",
   title = "Reasoning about knowledge",
   publisher = "MIT Press",
   address = "Cambridge, Mass.",
   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",
   year = "1995",
   
   }
   




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

   @Book{Mas-Colell1995,
   author = "Andreu Mas-Colell and Michael Dennis Whinston and Jerry R. Green",
   title = "Microeconomic theory",
   publisher = "Oxford University Press",
   address = "New York",
   note = "95018128 Andreu Mas-Colell, Michael D. Whinston, and Jerry R. Green. Includes bibliographical references and index. Ch. 1. Preference and Choice -- Ch. 2. Consumer Choice -- Ch. 3. Classical Demand Theory -- Ch. 4. Aggregate Demand -- Ch. 5. Production -- Ch. 6. Choice Under Uncertainty -- Ch. 7. Basic Elements of Noncooperative Games -- Ch. 8. Simultaneous-Move Games -- Ch. 9. Dynamic Games -- Ch. 10. Competitive Markets -- Ch. 11. Externalities and Public Goods -- Ch. 12. Market Power -- Ch. 13. Adverse Selection, Signaling, and Screening -- Ch. 14. The Principal-Agent Problem --Ch. 15. General Equilibrium Theory: Some Examples --Ch. 16. Equilibrium and Its Basic Welfare Properties --Ch. 17. The Positive Theory of Equilibrium -- Ch. 18. Some Foundations for Competitive Equilibria -- Ch. 19. General Equilibrium Under Uncertainty -- Ch. 20. Equilibrium and Time -- Ch. 21. Social Choice Theory --Ch. 22. Elements of Welfare Economics and Axiomatic Bargaining -- Ch. 23. Incentives and Mechanism Design -- Mathematical Appendix.",
   keywords = "game theory, honours reading",
   year = "1995",
   
   }
   




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:

   "Epistemic logic has grown from its philosophical beginnings to find diverse applications in computer science as a means of reasoning about the knowledge and belief of agents. This book, based on courses taught at universities and summer schools, provides a broad introduction to the subject; many exercises are included together with their solutions. The authors begin by presenting the necessary apparatus from mathematics and logic, including Kripke semantics and the well-known modal logics K, T, S4 and S5. Then they turn to applications in the contexts of distributed systems and artificial intelligence: topics that are addressed include the notions of common knowledge, distributed knowledge, explicit and implicit belief, the interplays between knowledge and time, and knowledge and action, as well as a graded (or numerical) variant of the epistemic operators. The problem of logical omniscience is also discussed extensively. Halpern and Moses' theory of honest formulae is covered, and a digression is made into the realm of non-monotonic reasoning and preferential entailment. Moore's autoepistemic logic is discussed, together with Levesque's related logic of 'all I know'. Furthermore, it is shown how one can base default and counterfactual reasoning on epistemic logic."

   
   

   @Book{Meyer1995,
   author = "J. J. CH Meyer and W. van der Hoek",
   title = "Epistemic Logic for Artificial Intelligence and Computer Science",
   publisher = "Cambridge University Press",
   abstract = "Epistemic logic has grown from its philosophical beginnings to find diverse applications in computer science as a means of reasoning about the knowledge and belief of agents. This book, based on courses taught at universities and summer schools, provides a broad introduction to the subject; many exercises are included together with their solutions. The authors begin by presenting the necessary apparatus from mathematics and logic, including Kripke semantics and the well-known modal logics K, T, S4 and S5. Then they turn to applications in the contexts of distributed systems and artificial intelligence: topics that are addressed include the notions of common knowledge, distributed knowledge, explicit and implicit belief, the interplays between knowledge and time, and knowledge and action, as well as a graded (or numerical) variant of the epistemic operators. The problem of logical omniscience is also discussed extensively. Halpern and Moses' theory of honest formulae is covered, and a digression is made into the realm of non-monotonic reasoning and preferential entailment. Moore's autoepistemic logic is discussed, together with Levesque's related logic of 'all I know'. Furthermore, it is shown how one can base default and counterfactual reasoning on epistemic logic.",
   keywords = "epistemic logic, agents, honours reading, model theory",
   year = "1995",
   
   }
   




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:

   "Computers and Thought showcases the work of the scientists who not only defined the field of artificial intelligence, but who are responsible for having developed it into what it is today. Originally published in 1963, this collection includes twenty classic papers by such pioneers as A. M. Turing and Marvin Minsky who were behind the pivotal advances in artificially simulating human thought processes with computers. Among the now hard-to-find articles are reports of computer programs that play chess and checkers, prove theorems in logic and geometry, solve problems in calculus, balance assembly lines, recognize visual temporal patterns, and communicate in natural language. The reports of simulation of cognitive processes include computer models of human behavior in logic problems, deciding on common stock portfolios, and carrying out social interaction. Models of verbal learning behavior, predictive behavior in two-choice experiments, and concept formation are also included."

   
   

   @Book{Feigenbaum1995,
   editor = "Edward A. Feigenbaum and Julian Feldman and Paul Armer",
   title = "Computers and thought",
   publisher = "AAAI Press ; MIT Press",
   address = "Menlo Park Cambridge",
   edition = "1st AAAI Press",
   note = "edited by Edward A. Feigenbaum & Julian Feldman ; [articles by Paul Armer ... et al.]. ill. ; 23 cm. Originally published: New York : McGraw-Hill, 1963.",
   abstract = "Computers and Thought showcases the work of the scientists who not only defined the field of artificial intelligence, but who are responsible for having developed it into what it is today. Originally published in 1963, this collection includes twenty classic papers by such pioneers as A. M. Turing and Marvin Minsky who were behind the pivotal advances in artificially simulating human thought processes with computers. Among the now hard-to-find articles are reports of computer programs that play chess and checkers, prove theorems in logic and geometry, solve problems in calculus, balance assembly lines, recognize visual temporal patterns, and communicate in natural language. The reports of simulation of cognitive processes include computer models of human behavior in logic problems, deciding on common stock portfolios, and carrying out social interaction. Models of verbal learning behavior, predictive behavior in two-choice experiments, and concept formation are also included.",
   keywords = "artificial intelligence, honours reading, cognitive science",
   year = "1995",
   
   }
   

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

   @InCollection{Davies1995,
   author = "Winton Davies and Peter Edwards",
   title = "Distributed Learning An Agent-Based Approach to Data-Mining",
   booktitle = "Working Notes of the {ICML} '95 Workshop on Agents that Learn from Other Agents",
   editor = "Diana Gordon",
   address = "Tahoe City, CA",
   keywords = "machine learning, honours reading",
   year = "1995",
   
   }
   




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

   @Article{Dung1995,
   author = "Phan Minh Dung",
   title = "On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games",
   journal = "Artificial Intelligence",
   volume = "77",
   pages = "321--357",
   keywords = "argumentation, honours reading",
   year = "1995",
   
   }
   




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

   @Article{Guarino1995,
   author = "Nicola Guarino",
   title = "Formal ontology, conceptual analysis and knowledge representation",
   journal = "International Journal of Human Computer Studies",
   volume = "43",
   pages = "625--640",
   keywords = "ontologies, honours reading, logistics",
   year = "1995",
   
   }
   




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

   @Article{Jennings1995,
   author = "Nicholas R. Jennings",
   title = "Controlling Cooperative Problem Solving in Industrial Multi-Agent Systems Using Joint Intentions",
   journal = "Journal of Artificial Intelligence Research",
   volume = "75",
   number = "2",
   pages = "195--240",
   keywords = "coordination, honours reading",
   year = "1995",
   
   }
   




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

   @Article{Missiaen1995,
   author = "Lode Missiaen and Maurice Bruynooghe and Marc Denecker",
   title = "{CHICA}, An Abductive Planning System Based on Event Calculus",
   journal = "Journal of Logic and Computation",
   volume = "5",
   number = "5",
   pages = "579--602",
   keywords = "planning, event calculus, abductive logic programming, honours reading",
   year = "1995",
   
   }
   




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

   @Article{Muggleton1995,
   author = "Stephen Muggleton",
   title = "Inverse Entailment and Progol",
   journal = "New Generation Computing, Special issue on Inductive Logic Programming",
   volume = "13",
   pages = "245--286",
   keywords = "inductive logic programming, honours reading",
   year = "1995",
   
   }
   




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

   @Article{Russell1995,
   author = "S. Russell and D. Subramanian",
   title = "Provably bounded-optimal agents,",
   journal = "Journal of Artificial Intelligence Research",
   volume = "2",
   pages = "575--609",
   keywords = "agent programming languages, honours reading, logistics, agents",
   year = "1995",
   
   }
   




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

   @Article{Savelsbergh1995,
   author = "M. W. P. Savelsbergh",
   title = "The General Pickup and Delivery Problem",
   journal = "Transportation Science",
   volume = "29",
   number = "1",
   pages = "17--29",
   keywords = "planning, honours reading",
   year = "1995",
   
   }
   




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

   @Article{Veloso1995,
   author = "Manuela Veloso and Jaime Carbonell and Alicia Perez and Daniel Borrajo and Eugene Fink and Jim Blythe",
   title = "Integrating Planning and Learning: The {PRODIGY} Architecture",
   journal = "Journal of Experimental and Theoretical Artificial Intelligence",
   volume = "7",
   number = "1",
   pages = "81--120",
   keywords = "planning, machine learning, honours reading",
   year = "1995",
   
   }
   




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

    @Article{Wooldridge1995,
    author = "Michael Wooldridge and Nicholas R. Jennings",
    title = "Intelligent Agents: Theory and Practice",
    journal = "Knowledge Engineering Review",
    volume = "10",
    number = "2",
    pages = "115--152",
    keywords = "agents, honours reading",
    year = "1995",
    
    }
    

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

   @InProceedings{Bailey1995,
   author = "James Bailey and Michael Georgeff and David Kemp and David Kinny and Kotagiri Ramamohanarao",
   title = "Second International Workshop on Rules in Datbase Systems, Lecutre Notes in Computer Science Vol 985",
   pages = "342--356",
   keywords = "agent programming languages, honours reading",
   year = "1995",
   
   }
   




2. Lawrence Cavedon, Lin Padgham, Anand Rao, and Liz Sonenberg. Revisiting rationality for agents with intentions. In Proceedings of the Eighth Australian Joint Conference on AI, pages 131--138, 1995.
   Keywords: agentlab.
   

   @InProceedings{Cavedon1995,
   author = "Lawrence Cavedon and Lin Padgham and Anand Rao and Liz Sonenberg",
   title = "Revisiting rationality for agents with intentions",
   booktitle = "Proceedings of the Eighth Australian Joint Conference on AI",
   pages = "131--138",
   keywords = "agentlab",
   year = "1995",
   
   }
   




3. Lawrence Cavedon and Gil Tidhar. A Logical Framework for Multi-Agent Systems and Joint Attitudes. In Proceedings of DAI 1995, pages 16--30, 1995.
   Keywords: agentlab.
   

   @InProceedings{Cavedon1995b,
   author = "Lawrence Cavedon and Gil Tidhar",
   title = "A Logical Framework for Multi-Agent Systems and Joint Attitudes",
   booktitle = "Proceedings of DAI 1995",
   pages = "16--30",
   keywords = "agentlab",
   year = "1995",
   
   }
   




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

   @InProceedings{Fisher1995,
   author = "Michael Fisher and Richard Owens",
   title = "Executable modal and temporal logics : {IJCAI} '93 Workshop, Chambery, France, August 28, 1993 : proceedings",
   booktitle = "Lecture notes in computer science ; 897. Lecture notes in artificial intelligence.",
   address = "Berlin ; New York",
   publisher = "Springer",
   pages = "180",
   note = "95001416 International Joint Conference on Artificial Intelligence, (1993 : Chambéry, France) Michael Fisher, Richard Owens, eds. Updated papers presented at the Workshop on Executable Modal and Temporal Logics. An Introduction to Executable Modal and Temporal Logics / Michael Fisher and Richard Owens -- Temporal Logic Programming with Metric and Past Operators / Christoph Brzoska -- A Combination of Clausal and Non Clausal -- Temporal Logic Programs / Shinji Kono -- Temporal Logic and Annotated Constraint Logic Programming / Thom Fruhwirth -- Efficiently Executable Temporal Logic Programs / Stephan Merz -- Towards a Semantics for Concurrent METATEM / Michael Fisher -- Constraint Deduction in an Interval-based Temporal Logic / Jana Koehler and Ralf Treinen -- Towards First-Order Concurrent METATEM / Mark Reynolds -- Solving Air-Traffic Problems with {"}Possible Worlds{"} / Marcos Cavalcanti -- Investigations into the Application of Deontic Logic / Nienke den Haan. Lecture notes in computer science ; 897. Lecture notes in computer science. Lecture notes in artificial intelligence.",
   keywords = "modal logic, honours reading, temporal logic",
   year = "1995",
   
   }
   




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

   Abstract:

   "The problem of logical omniscience reappears in the popular Kripke semantics for logics of knowledge. Under such semantics, a knower i has an accessibility relation approximately=/sub i/ which is usually an equivalence relation, but need not be assumed to be such for this discussion. Intuitively, s approximately=/sub i/ t means that the worlds s and t result in the same state of information for i. Then the formula K/sub i/( phi ) holds at a possible world (or state) s iff phi holds at all t accessible from s, i.e. at all t such that s approximately=/sub i/ t. It follows immediately that if phi is logically true then K/sub i/( phi ) holds at s, since it must hold at all such t. Also if K/sub i/( phi ) and K/sub i/( phi to psi ) hold at s then so does K/sub i/( psi ). Thus what i knows at s includes all logical truths and is closed under logical consequence. Given this state of affairs, i of course has no need of reasoning since i already knows everything that i might derive through it. But since real people (or processors) do not have these advantages, a more realistic theory of knowledge must allow for a knower not to know some logical truths or not to know some consequences of things that she knows. Recent literature has had a fair number of papers addressed to this issue but the problem is still largely open. Our purpose here is to survey some of the previous work and offer one or two suggestions. (15 References)."

   
   

   @InProceedings{Parikh1995,
   author = "R. Parikh",
   title = "Logical omniscience",
   booktitle = "Logic and Computational Complexity. International Workshop LCC '94. Selected Papers. Springer-Verlag. 1995",
   pages = "22--9",
   abstract = "The problem of logical omniscience reappears in the popular Kripke semantics for logics of knowledge. Under such semantics, a knower i has an accessibility relation approximately=/sub i/ which is usually an equivalence relation, but need not be assumed to be such for this discussion. Intuitively, s approximately=/sub i/ t means that the worlds s and t result in the same state of information for i. Then the formula K/sub i/( phi ) holds at a possible world (or state) s iff phi holds at all t accessible from s, i.e. at all t such that s approximately=/sub i/ t. It follows immediately that if phi is logically true then K/sub i/( phi ) holds at s, since it must hold at all such t. Also if K/sub i/( phi ) and K/sub i/( phi to psi ) hold at s then so does K/sub i/( psi ). Thus what i knows at s includes all logical truths and is closed under logical consequence. Given this state of affairs, i of course has no need of reasoning since i already knows everything that i might derive through it. But since real people (or processors) do not have these advantages, a more realistic theory of knowledge must allow for a knower not to know some logical truths or not to know some consequences of things that she knows. Recent literature has had a fair number of papers addressed to this issue but the problem is still largely open. Our purpose here is to survey some of the previous work and offer one or two suggestions. (15 References).",
   keywords = "model theory, honours reading",
   year = "1995",
   
   }
   




6. Adrian Pearce and Terry Caelli. On the efficiency of spatial learning. In Proceedings of the second Asian conference on computer vision 1995 (ACCV95); Singapore, Parkville, Australia, pages 79--82, 1995.
   Keywords: machine learning, agentlab.
   

   @InProceedings{Pearce1995,
   author = "Adrian Pearce and Terry Caelli",
   title = "On the efficiency of spatial learning",
   booktitle = "Proceedings of the second Asian conference on computer vision 1995 (ACCV95); Singapore",
   address = "Parkville, Australia",
   pages = "79--82",
   keywords = "machine learning, agentlab",
   year = "1995",
   
   }
   




7. Lorenza Saitta. State of the Art in Machine Learning. In The Newsletter of the European Network of Excellence in Machine Learning, 1995.
   Note: Special Issue.
   Keywords: machine learning, honours reading.
   

   @InProceedings{Saitta1995,
   author = "Lorenza Saitta",
   title = "State of the Art in Machine Learning",
   booktitle = "The Newsletter of the European Network of Excellence in Machine Learning",
   note = "Special Issue",
   keywords = "machine learning, honours reading",
   year = "1995",
   
   }
   




8. Venkatesh Srinivasan Leon Sterling. A Generic Scheduling Framework developed in Prolog. In Logic Programming: Formal Methods and Practical Applications 1995, pages 301--322, 1995.
   Keywords: agentlab.
   

   @InProceedings{Leon_Sterling1995,
   author = "Venkatesh Srinivasan Leon Sterling",
   title = "A Generic Scheduling Framework developed in Prolog",
   booktitle = "Logic Programming: Formal Methods and Practical Applications 1995",
   pages = "301--322",
   keywords = "agentlab",
   year = "1995",
   
   }
   




9. Gil Tidhar, Mario C. Selvestrel, and Clinton Heinze. Modelling Teams and Team Tactics in Whole Air Mission Modelling. In Proceedings of IEA/AIE 1995, pages 373--381, 1995.
   Keywords: agentlab.
   

   @InProceedings{Tidhar1995,
   author = "Gil Tidhar and Mario C. Selvestrel and Clinton Heinze",
   title = "Modelling Teams and Team Tactics in Whole Air Mission Modelling",
   booktitle = "Proceedings of IEA/AIE 1995",
   pages = "373--381",
   keywords = "agentlab",
   year = "1995",
   
   }
   

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

   @TechReport{Halpern1995,
   author = "Joseph Y. Halpern",
   title = "Reasoning about knowledge: a survey",
   institution = "IBM Almaden Research Center",
   note = "Appears in Handbook of Logic in Artificial Intelligence and Logic Programig, Vol 4. D. Gabbay, C.J. Hogger, and J. A. Robinson, eds, Oxford University Press, 1995, pp 1-34.",
   number = "1995",
   type = "Technical Report",
   keywords = "agents, honours reading",
   year = "1995",
   
   }
   




2. Howden, Lin Padgham, and Liz Sonenberg. An Exploration of Incremental Update for Defeasible Inheritance Reasoners. Technical Report 95/7, Department of Computer Science, University of Melbourne, Australia, 1995.
   Keywords: agentlab.
   

   @TechReport{Howden1995,
   author = "Howden and Lin Padgham and Liz Sonenberg",
   title = "An Exploration of Incremental Update for Defeasible Inheritance Reasoners",
   institution = "Department of Computer Science, University of Melbourne, Australia",
   number = "95/7",
   type = "Technical Report",
   keywords = "agentlab",
   year = "1995",
   
   }
   

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.