Jacek Malec
Department of Computer Science, Lund University, Sweden
Download article
Published in: The Swedish AI Society Workshop May 27-28; 2009 IDA; Linköping University
Linköping Electronic Conference Proceedings 35:9, p. 49-53
Published: 2009-05-27
ISBN:
ISSN: 1650-3686 (print), 1650-3740 (online)
The problem of nding a suitable formal approach to describe on-going reasoning process has been open since the very beginning of AI. In this paper we argue that active logic might be a formalism useful in this context. Active logic is rst introduced; then we analyse resource limitations that constrain the space of possible practical realisations of such reasoners. Finally some steps towards creating a practical active logic reasoner are presented.
[1] M. L. Anderson; W. Gomaa; J. Grant; and D. Perlis. Active logic semantics for a single agent in a static world. Arti cial Intelligence; 172:1045-1063; 2008.
[2] M. Asker. Logical reasoning with temporalconstraints. Master’s thesis; Department of Computer Science; Lund University; August 2003. Available at http://fileadmin.cs.lth.se/ai/xj/- MikaelAsker/exjobb0820.ps.
[3] M. Asker and J. Malec. Reasoning with limited resources: An LDS-based approach. In et al. B. Tessem; editor; Proc. Eight Scandi- navian Conference on Arti cial Intelligence; pages 13-24. IOS Press; 2003.
[4] M. Asker and J. Malec. Reasoning with limited resources: Active logics expressed as labelled deductive systems. Bulletin of the Pol- ish Academy of Sciences; Technical Sciences; 53(1); 2005.
[5] W. Chong; M. O’Donovan-Anderson; Y. Okamoto; and D. Perlis. Seven days in the life of a robotic agent. Technical report; University of Maryland; 2002.
[6] DARPA. Urban Challenge. http://www.darpa.mil/GRANDCHALLENGE/- overview.asp; 2007.
[7] J. Delnaye. Automatic theorem proving in active logics. Master’s thesis; Department of Computer Science; Lund University; June 2008. Available at http://fileadmin.cs.lth.se/ai/xj/- JulienDelnaye/report.pdf.
[8] J. Drapkin; M. Miller; and D. Perlis. A memory model for real-time commonsense reasoning. Technical Report TR-86-21; Department of Computer Science; University of Maryland; 1986.
[9] J. Elgot-Drapkin. Step Logic: Reasoning Sit- uated in Time. PhD thesis; Department of Computer Science; University of Maryland; 1988.
[10] J. Elgot-Drapkin. Step-logic and the threewise- men problem. In Proc. AAAI; pages 412-417; 1991.
[11] J. Elgot-Drapkin; S. Kraus; M. Miller; M. Nirkhe; and D. Perlis. Active logics: A uni ed formal approach to episodic reasoning. Technical report; Department of Computer Science; University of Maryland; 1999.
[12] D. Gabbay. Labelled Deductive Systems; Vol. 1. Oxford University Press; 1996.
[13] T. O. Heins. A case study of active logic. Master’s thesis; Department of Computer Science; Lund University; January 2009. Available at http://fileadmin.cs.lth.se/ai/xj/- ThorbenHeins/report.pdf.
[14] F. Heintz. DyKnow. A Stream-Based Knowledge Processing Middleware Framework. PhD thesis; Department of Computer Science; Linkoping University; Sweden; 2009. Linkoping Studies in Science and Technology; Dissertation No. 1240.
[15] C. Hewitt. Common sense for concurrency and strong paraconsistency using unstrati ed inference and re ection. Technical report; http://carlhewitt.info; 2008. Available at: http://commonsense.carlhewitt.info.
[16] M. Nirkhe; S. Kraus; and D. Perlis. Situated reasoning within tight deadlines and realistic space and computation bounds. In Proc. Com- mon Sense 93; 1993.
[17] K. Purang; D. Purushothaman; D. Traum; C. Andersen; D. Traum; and D. Perlis. Practical reasoning and plan execution with active logic. In Proceedings of the IJCAI’99 Work- shop on Practical Reasoning and Rationality; 1999.
[18] B. Selman and H. Kautz. Knowledge compilation and theory approximation. JACM; 43(2):193-224; 1996.
