Abstract
Johnson-Laird proposes a semantic theory of human reasoning taking into account finite human capacities. We cast this into logical formalism and define a notion of restricted semantic entailment. Corresponding to any set of logical structures, R, there is a restricted entailment with parameter R. The family of restricted entailments, generated as R varies over sets of structures, is shown to be a complete lattice and to approximate ordinary entailment in the sense of domain theory. A given restricted entailment, \(\vDash_{R}\) say, can be modelled in a modal language with an operator ↓ R . The modal language is sound and complete and there is a correspondence result: \(X\vDash_{R} \varphi\) iff \(\downarrow\!\!_{R} X \Vdash \downarrow\!\!_{R}\varphi\), where X is a set of first-order sentences and ϕ is first-order. This forms the basis for the proposal that \(\vDash_{R}\) be identified with agent reasoning and that ↓ R encapsulate an agent. The existence of the lattice structure mentioned above means that several agents can be integrated into a super-agent or else distilled into a sub-agent by taking joins or meets.
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
Ebbinghaus, H.D., Flum, J., Thomas, W.: Mathematical Logic. Springer, Heidelberg (1984)
Cherniak, C.: Minimal Rationality. MIT Press, Cambridge (1986)
Johnson-Laird, P.N.: Mental Models. Cambridge University Press, Cambridge (1983)
Johnson-Laird, P.N., Byrne, R.M.J.: Deduction. Lawrence Erlbaum Associates, Hove (1991)
Cameron, P.J.: Sets, Logic and Categories. Springer, Heidelberg (1999)
Kelley, J.L.: General Topology. D. Van Nostrand Company (1955)
Flax, C.L.: Algebraic Aspects of Entailment: Approximation, Belief Revision and Computability. PhD thesis, Macquarie University, Sydney, NSW 2109, Australia (2002), Available from http://www.comp.mq.edu.au/~flax/
Moschovakis, Y.N.: Notes on Set Theory. Springer, Heidelberg (1994)
Gärdenfors, P.: Knowledge in Flux. MIT Press, Cambridge (1988)
Stoltenberg-Hansen, V., Linström, I., Griffor, E.R.: Mathematical Theory of Domains. Cambridge Tracts in Theoretical Computer Science, vol. 22. Cambridge University Press, Cambridge (1994)
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT, Cambridge (1995)
Fitting, M., Mendelsohn, R.L.: First-order Modal Logic. Kluwer Academic Publishers, Dordrecht (1998)
Wooldridge, M.: An Introduction to Multiagent Systems. John Wiley, Chichester (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flax, L. (2004). A Proposal for Reasoning in Agents: Restricted Entailment. In: Leite, J., Omicini, A., Sterling, L., Torroni, P. (eds) Declarative Agent Languages and Technologies. DALT 2003. Lecture Notes in Computer Science(), vol 2990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25932-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-25932-9_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22124-1
Online ISBN: 978-3-540-25932-9
eBook Packages: Springer Book Archive