Epistemic reasoning, logic programming, and the interpretation of questions
Number of Authors: 2
1987 (English)Report (Refereed)
Reasons are given to support the claim that strong connections exist between linguistic theories on question semantics and work within AI and logic programming. Various ways of assigning denotations to questions are compared, and it is argued that the earlier, "naive" version is to be preferred to more recent developments. It is shown that it is possible to use the chosen denotation to give a model-theoretic semantics for the concept of "knowing what", from which a relationship between "knowing what" and "knowing" can provably be derived. An application to logic programming is described, which allows formal reasoning about what a logic database "knows", this being in a sense a generalization of the Closed World Assumption. Finally, a "knows-what" meta-interpreter in Prolog is demonstrated, and proved to be sound and complete for a certain class of database programs.
Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1987, 1. , 16 p.
SICS Research Report, ISSN 0283-3638 ; R87:02
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22218OAI: oai:DiVA.org:ri-22218DiVA: diva2:1041762
Original report number R87002. Also published in Natural Language Understanding and Logic Programming, II, pp. 301-318. V. Dahl and P. Saint-Dizier, editors, North-Holland Press, 1988.2016-10-312016-10-31Bibliographically approved