Towards a Self-selective and Self-healing Evaluation
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.
Keywordssemantic evaluation assignment function binding dependencies predicate logic robust interpretation grammatical roles
Unable to display preview. Download preview PDF.
- Berkling, K.J.: A symmetric complement to the lambda-calculus. Interner Bericht ISF-76-7, GMD, St. Augustin, Germany (1976)Google Scholar
- Berko, J.: The child’s learning of English morphology. Word 14, 150–177 (1958)Google Scholar
- 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)Google Scholar
- Hendriks, D., van Oostrom, V.: Adbmal-calculus. Department of Philosophy. Utrecht University (2003)Google Scholar
- 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)Google Scholar
- Parsons, T.: Events in the Semantics of English. MIT Press, Cambridge (1990)Google Scholar