J Drapkin
ABSTRACT
We have suggested that a new kind of logical study that focuses on individual deductive steps is appropriate to agents that must do commonsense reasoning. In order to adequately study such reasoners, a formal description of such “steps” is necessary. Here we carry further this program for the propositional case. In particular we give a result on completeness for reasoning about agents.
- 1.Allen, J. {1984} Towards a general theory of action and time. Artificial Intelligence, 23, pp.123-154. Google Scholar
Digital Library
- 2.Doyle, J. {1982} Some theories of reasoned assumptions: an essay in rational psychology. Dept. of Computer Science, CMU.Google Scholar
- 3.Drapkin, J., Miller, M., and Perlis, D. {1986} A memory model for real-time commonsense reasoning. Technical report, Univ. of Maryland.Google Scholar
- 4.Drapkin, J. and Perils, D. {1986} Step-logics: an alternative approach to limited reasoning. Proc. European Conf. on Artificial Intelligence, 1986.Google Scholar
- 5.Drapkin, J. and Perlis, D. {1986} Analytic completeness in SLo. Technical report, Univ. of Maryland.Google Scholar
- 6.Fagin, R. and Halpern, J. {1985} Belief, awareness, and limited reasoning: preliminary report. Proc. 9th Int'l Joint Conf. on Artificial Intelligence, 1985, pp.491-501.Google Scholar
- 7.Haas, A. {1985} Possible events, actual events, and robots. Computational intelligence, pp.59-70.Google Scholar
- 8.Konolige, K. {1985} A computational theory of belief introspection. Proc. 9th Int'l Joint Conf. on Artificial Intelligence, 1985, pp.503-508.Google Scholar
- 9.Lakemeyer, G. {1986} Steps towards a first-order logic of explicit and implicit belief. Proc. 1986 Conference on Theoretical Aspects of Reasoning about Knowledge, pp.325-340. Google ScholarDigital Library
- 10.Levesque, H. {1984} A logic of implicit and explicit belief. Proc. 3rd National Conf. on Artificial intelligence, pp.198-202.Google Scholar
- 11.McCarthy, J. {1978} Formalization of two puzzles involving knowledge. Unpublished note, Stanford University, Stanford, California.Google Scholar
- 12.McDermott, D. {1982} A temporal logic for reasoning about processes and plans. Cognltire Science, 6, pp.101-155.Google ScholarCross Ref
- 13.Mendelson, E. {1972} Introduction to mathematical logic, van Nostrand. Google ScholarDigital Library
- 14.Moore, R. {1985} A formal theory of knowledge and action. Formal Theories of the Commonsense World, Ablex Publishing Company, pp. 319-358.Google Scholar
- 15.Nilsson, N. {1983} Artificial intelligence prepares for 2001. AI Magazine, 4.Google Scholar
- 16.Vardi, M. {1986} On epistemic logic and logical omniscience, Proc. 1986 Conference on Theoretical Aspects of Reasoning about Knowledge, pp.293-305. Google ScholarDigital Library
Index Terms
- A preliminary excursion into step-logics
Recommendations
Intuitionistic Trilattice Logics
We take up a suggestion by Odintsov (2009, Studia Logica, 91, 407–428) and define intuitionistic variants of certain logics arising from the trilattice SIXTEEN3 introduced in Shramko and Wansing (2005, Journal of Philosophical Logic, 34, 121–153 and ...
Single Step Tableaux for Modal Logics
Single Step Tableaux (SST) are the basis of a calculus for modal logics that combines different features of sequent and prefixed tableaux into a simple, modular, strongly analytic, and effective calculus for a wide range of modal logics.
The paper ...
Computability and completeness in logics of programs (Preliminary Report)
STOC '77: Proceedings of the ninth annual ACM symposium on Theory of computingDynamic logic is a generalization of first order logic in which quantifiers of the form “for all χ...” are replaced by phrases of the form “after executing program α...”. This logic subsumes most existing first-order logics of programs that manipulate ...
Comments