Quantification in a Three-Valued Logic for Natural Language Question-Answering Systems
Proceedings of the Sixth International Joint Conference on Artificial Intelligence. .
Abstract
This paper examines quantification in relation to a typed three-valued logical system which was developed to serve as the internal query language ~or virtual data bases acceptinp, n&tural languap,e (NL) consultation. Such a system is capable, amonu, other things, of reflectinp certain NL presuppositions, handling relations amonr, sets and copin~ with certain NL ambiguitieb, within a simple though natural and ~airly vast NL subset. In our approach, quantification is dealt with through a sinv,le mechanism by which all NL quantifiers introduce the formula "those(x,p)", denoting the set of all those x's in x's associated domain which satis~y statement p. The meaning of each particular NL quantifier-- including any presuppositions it may induce-- is rendered through particular constraints upon the set (e.g., cardinality constraints).
@inproceedings{ijcai1979p43,
title = {Quantification in a Three-Valued Logic for Natural Language Question-Answering Systems},
author = {Dahl, Verónica},
booktitle = {Proceedings of the Sixth International Joint Conference on
Artificial Intelligence, {IJCAI-79}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Bruce G. Buchanan},
year = {1979},
month = {8},
url = {https://ijcai.org/proceedings/1979/43},
}
TY - CPAPER TI - Quantification in a Three-Valued Logic for Natural Language Question-Answering Systems AU - Dahl, Verónica T2 - Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79 PB - International Joint Conferences on Artificial Intelligence PY - 1979 UR - https://ijcai.org/proceedings/1979/43 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
