TY - BOOK TI - STAROS User and System Structure Manual AU - Gehringer, Edward F. AU - Chansler, Robert J. DA - 1981/// PY - 1981/// PB - Department of Computer Science, Carnegie-Mellon University ER - TY - RPRT TI - An attributed LL(1) compilation of Pascal into the lambda-calculus AU - Kaltofen, E. AU - Abdali, S.K. A3 - Rensselaer Polytechnic Institute Mathematical Sciences Department DA - 1981/// PY - 1981/// M1 - CS-8103 M3 - Technical Report PB - Rensselaer Polytechnic Institute Mathematical Sciences Department SN - CS-8103 ER - TY - CONF TI - A generalized class of polynomials that are hard to factor AU - Kaltofen, Erich AU - Musser, David R. AU - Saunders, B. David T2 - the fourth ACM symposium AB - A class of univariate polynomials is defined which make the Berlekamp-Hensel factorization algorithm take an exponential amount of time. The class contains as subclasses the Swinnerton-Dyer polynomials discussed by Berlekamp and a subset of the cyclotomic polynomials. Aside from shedding light on the complexity of polynomial factorization this class is also useful in testing implementations of the Berlekamp-Hensel and related algorithms. C2 - 1981/// C3 - Proceedings of the fourth ACM symposium on Symbolic and algebraic computation - SYMSAC '81 DA - 1981/// DO - 10.1145/800206.806394 PB - ACM Press SN - 0897910478 UR - http://dx.doi.org/10.1145/800206.806394 DB - Crossref ER - TY - JOUR TI - A Truth Maintenance System**This research was conducted at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the Laboratory's artificial intelligence research is provided in part by the Advanced Research Projects Agency of the Department of Defense under Office of Naval Research contract number N00014-75-C-0643, and in part by NSF grant MCS77-04828. AU - Doyle, Jon T2 - Readings in Artificial Intelligence AB - Abstract : To choose their actions, reasoning programs must be able to make assumptions and subsequently revise their beliefs when discoveries contradict these assumtions. The Truth Maintenance System (TMS) is a problem solver subsystem for performing these functions by recording and maintaining the reasons for program beliefs. Such recorded reasons are useful in constructing explanations for program actions and in guiding the course of action of a problem solver. This paper describes (1) the representations and structure of the TMS, (2) the mechanisms used to revise the current set of beliefs, (3) how dependency-directed backtracking changes the current set of assumptions, (4) techniques for summarizing explanations of beliefs, (5) how to organize problem solvers into 'dialectically arguing' modules, (6) how to revise models of the belief systems of others, and (7) methods for embedding control structures in patterns of assumptions. We stress the need of problem solvers to choose between alternate systems of beliefs, and outline a mechanism by which a problem solver can employ rules guiding choices of what to believe, what to want, and what to do. (Author) DA - 1981/// PY - 1981/// DO - 10.1016/b978-0-934613-03-3.50039-8 SP - 496-516 ER - TY - JOUR TI - A model for deliberation, action, and introspection AU - Doyle, Jon T2 - SIGART Bull. AB - This thesis investigates the problem of controlling or directing the reasoning and actions of a computer program. The basic approach explored is to view reasoning as a species of action, so that a program might apply its reasoning powers to the task of deciding what inferences to make as well as to deciding what other actions to take. A design for the architecture of reasoning programs is proposed. This architecture involves self-consciousness, intentional actions, deliberate adaptations, and a form of decision-making based on dialectical argumentation. A program based on this architecture inspects itself, describes aspects of itself to itself, and uses this self-reference and these self-descriptions in making decisions and taking actions. The program's mental life includes awareness of its own concepts, beliefs, desires, intentions, inferences, actions, and skills. All of these are represented by self-descriptions in a single sort of language, so that the program has access to all of these aspects of itself, and can reason about them in the same terms. DA - 1981/1// PY - 1981/1// DO - 10.1145/1056748.1056749 VL - 1 IS - 75 SP - 10-10 ER - TY - RPRT TI - STAROS User and System Structure Manual AU - Gehringer, Edward F. AU - Chansler, Robert J. A3 - Department of Computer Science, Carnegie-Mellon University DA - 1981/6// PY - 1981/6// M3 - Technical Report PB - Department of Computer Science, Carnegie-Mellon University ER -