Change search
ReferencesLink to record
Permanent link

Direct link
Epistemic reasoning, logic programming, and the interpretation of questions
Number of Authors: 2
1987 (English)Report (Refereed)
Abstract [en]

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
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14406OAI: diva2:1035695
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.Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(2298 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 2298 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link