Abstract
Assume a recursive routine for evaluating expressions against an assignment function that stores accumulated binding information for variable names. This paper proposes adding an If operation that allows for what is evaluated to be automatically selected during the runtime of evaluation based on the state of the assignment function. This can (a) allow a single encoding of content that would otherwise require distinct expressions, and (b) equip an expression with a way to recover from situations that would cause unwelcome results from evaluation. The new operation is demonstrated to be an essential component for allowing a robust interpretation of unknown lexical items and for feeding an automated regulation of binding dependencies determined on a grammatical basis.
Keywords
- semantic evaluation
- assignment function
- binding dependencies
- predicate logic
- robust interpretation
- grammatical roles
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berkling, K.J.: A symmetric complement to the lambda-calculus. Interner Bericht ISF-76-7, GMD, St. Augustin, Germany (1976)
Berko, J.: The child’s learning of English morphology. Word 14, 150–177 (1958)
Butler, A.: Scope control and grammatical dependencies. Journal of Logic, Language and Information 16, 241–264 (2007)
Davidson, D.: The logical form of action sentences. In: Rescher, N. (ed.) The Logic of Decision and Action. University of Pittsburgh Press, Pittsburgh (1967); Reprinted in: Davidson, D.: Essays on Actions and Events, pp. 105–122. Claredon Press, Oxford (1980)
Dekker, P.: Meaning and use of indefinite expressions. Journal of Logic, Language and Information 11, 141–194 (2002)
van Eijck, J.: Incremental dynamics. Journal of Logic, Language and Information 10, 319–351 (2001)
Hendriks, D., van Oostrom, V.: Adbmal-calculus. Department of Philosophy. Utrecht University (2003)
Hollenberg, M., Vermeulen, C.F.M.: Counting variables in a dynamic setting. Journal of Logic and Computation 6, 725–744 (1996)
Nakashima, H., Noda, I., Handa, K.: Organic programming language GAEA for multi-agents. In: Proceedings of the Second International Conference on Multiagent Systems (ICMAS 1996). AAAI (1996)
Parsons, T.: Events in the Semantics of English. MIT Press, Cambridge (1990)
Tarski, A., Vaught, R.L.: Arithmetical extensions of relational systems. Compositio Mathematica 13, 81–102 (1956)
Vermeulen, C.F.M.: Sequence semantics for dynamic predicate logic. Journal of Logic, Language and Information 2, 217–254 (1993)
Vermeulen, C.F.M.: Variables as stacks: A case study in dynamic model theory. Journal of Logic, Language and Information 9, 143–167 (2000)
Visser, A., Vermeulen, C.F.M.: Dynamic bracketing and discourse representation. Notre Dame Journal of Formal Logic 37, 321–365 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Butler, A., Yoshimoto, K. (2012). Towards a Self-selective and Self-healing Evaluation. In: Okumura, M., Bekki, D., Satoh, K. (eds) New Frontiers in Artificial Intelligence. JSAI-isAI 2011. Lecture Notes in Computer Science(), vol 7258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32090-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-32090-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32089-7
Online ISBN: 978-3-642-32090-3
eBook Packages: Computer ScienceComputer Science (R0)
