%A David Neal %A Virgil Wallentine %T Experiences with the portability of Concurrent Pascal %R Technical Report CS 77-09 %I Department of Computer Science, University of Kansas %D October 1977 %P 21 %A Frank M. Brown %T Reasoning in a hierarchy of deontic defaults %R TR-86-2 %I Department of Computer Science, University of Kansas %P 11 %X A commonsense theory of reasoning is presented which models our intuitive ability of reason about defaults involving both deontic and doxastic logic. The concepts of this theory do not involve fixed points or Kripke semantics but instead are explicitly defined in a modal quantificational logic which captures the modal notion of logical truth. An example involving derivations of obligations from both a robot's beliefs and a hierarchy of deontic defaults is given. To be published in the proceedings of the 1986 Canadian Artificial Intelligence Conference. %A Frank M. Brown %T Toward a commonsense theory of nonmonotonicity %R TR-86-3 %I Department of Computer Science, University of Kansas %P 12 %X A logical theory of nonmonotonic reasoning is presented which permits a commonsense approach to defaults. The axioms and inference rules for a modal logic based on the concept of logical truth are described herein along with basic theorems about nonmonotonic reasoning. An application to the frame problem in robot plan formation is presented. To be published in the proceedings of the Eight International Conference on Automated Deduction. %A Frank M. Brown %T A comparison of the commonsense and fixed point theories of nonmonotonicity %R TR-86-4 %I Department of Computer Science, University of Kansas %P 12 %X The mathematical fixed point theories of nonmonotonic reasoning are examined and compared to a commonsense theory of nonmonotonic reasoning which models our intuitive ability to reason about defaults. It is shown that all of the known problems of the fixed point theories are solved by the commonsense theory. The concepts of this commonsense theory do not involve mathematical fixed points, but instead are explicitly defined in a monotonic modal quantificational logic which captures the modal notion of logical truth. %A Frank M. Brown %T An experimental logic based on the fundamental deduction principle %R TR-86-5 %I Department of Computer Science, University of Kansas %P 120 %X Experimental logic can be viewed as a branch of logic dealing with the actual construction of useful deductive systems and their application to various scientific disciplines. In this paper we describe an experimental deductive system called the SYMbolic EVALuator (i.e. SYMEVAL) which is based on a rather simple, yet startling principle about deduction, namely that deduction is fundamentally a process of replacing expressions by logically equivalent expressions. This principle applies both to logical and domain dependent axioms and rules. Unlike more well known logical inference systems which do not satisfy this principle, herein is described a system of logical axioms and rules called the SYMMETRIC LOGIC which is based on this principle. Evidence for this principle is given by proving theorems and performing deduction in the areas of set theory, logic programming, natural language analysis, program verification, automatic complexity analysis, and inductive reasoning. To be published in the international journal Artificial Intelligence. %A Frank M. Brown %T Automatic deduction in set theory %R TR-86-6 %I Department of Computer Science, University of Kansas %P 24 %X A proof of the definability of ordered pairs in set theory is described and discussed. This proof was obtained in an entirely automatic way using the SYMEVAL deduction system and the SYMMETRIC LOGIC axioms. The analogous point in this proof where other theorem proving methods and systems have failed to prove this theorem are described. The ability of this system to automatically derive one half of this theorem from the other half is also discussed, thus showing that this kind of deduction system can be used to produce answers other than just yes/no answers to mathematical questions. %A Frank M. Brown %T An experimental logic %R TR-86-7 %I Department of Computer Science, University of Kansas %P 17 %X The fundamental deduction principle, SYMEVAL deductive system, and SYMMETRIC LOGIC are introduced. Theorems are proved in the area of set theory, complexity analysis and program verification. %A Frank M. Brown %T Logic programming with an experimental logic %R TR-86-8 %I Department of Computer Science, University of Kansas %P 18 %X In this paper we describe the experimental programming logic which uses the deductive system SYMEVAL which is based on the fundamental deduction principle. Theorems and deductions are performed in the area of logic programming and then discussed as they relate to the above principle. %A Glenn O. Veach %T The belief of knowledge: preliminary report %R TR-86-15 %I Department of Computer Science, University of Kansas %X As various researchers have attempted to present logics which capture epistemic concepts they have encountered several difficulties. After surveying the critiques of past efforts we propose a logic which avoids these same faults. We also closely explore fundamental issues involved in representing knowledge in ideal and rational agents and show how the similarities and differences are preserved in the logic we present. Several examples are given as supporting evidence for our conclusions. To be published in the proceedings of the 2nd Kansas Conference: Knowledge-Based Software Development. 12 pp. %A Glenn O. Veach %T An annotated bibliography of systems and theory for distributed artificial intelligence %R TR-86-16 %I Department of Computer Science, University of Kansas %X This paper summarizes, with extensive comment, the results of an initial investigation of the work in distributed AI. Some forty-plus articles representing the major schools of thought and development are cited and commented upon. %A Frank M. Brown %T Semantical systems for intensional logics based on the modal logic S5+Leib %R TR-86-17 %I Department of Computer Science, University of Kansas %X This paper contains two new results. First it describes how semantical systems for intensional logics can be represented in the particular modal logic which captures the notion of logical truth. In particular, Kripke semantics is developed from this modal logic. The second result is the development in the modal logic of a new semantical system for intensional logics called B-semantics. B-semantics is compared to Kripke semantics and it is suggested that it is a better system in a number of ways.