Abstract
Qu-Prolog is an extension of Prolog that was initially designed as an implementation language for interactive theorem provers. It provides built-in support for quantifiers, substitutions and object variables. Recently, Qu-Prolog has been further extended to support multiple threads and high-level communication. The combination of these features makes it ideal as an implementation language for intelligent agents with advanced reasoning capabilities.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Becht, H., Bloesch, A., Nickson, R., Utting, M.: Ergo 4.1 Reference Manual, Technical Report No. 96–31, Software Verification Research Centre, Department of Computer Science, University of Queensland (1996)
Clark, K., Robinson, P.J.: Agents as Multi-threaded Logical Object (to appear)
McCabe, F.G.: The Inter-Agent Communication Model (ICM). Fujitsu Laboratories of America Inc. (2000), http://www.nar.fla.com/icm/
Robinson, P.J.: Qu-Prolog 6.0 User Guide. Technical Report No. 00-20, Software Verification Research Centre, University of Queensland (2000)
Utting, M., Robinson, P., Nickson, R.: Ergo 6: A generic proof engine that uses prolog proof technology. JCM 5, 194–219 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Robinson, P.J., Hinchey, M., Clark, K. (2003). Qu-Prolog: An Implementation Language for Agents with Advanced Reasoning Capabilities. In: Hinchey, M.G., Rash, J.L., Truszkowski, W.F., Rouff, C., Gordon-Spears, D. (eds) Formal Approaches to Agent-Based Systems. FAABS 2002. Lecture Notes in Computer Science(), vol 2699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45133-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-45133-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40665-5
Online ISBN: 978-3-540-45133-4
eBook Packages: Springer Book Archive