Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Epistemic reasoning, logic programming, and the interpretation of questions
RISE - Research Institutes of Sweden (2017-2019), ICT, SICS.
RISE, Swedish ICT, SICS, Computer Systems Laboratory.ORCID iD: 0000-0002-4285-101x
1987 (English)Report (Other academic)
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. , p. 16
Series
SICS Research Report, ISSN 0283-3638 ; R87:02
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-22218OAI: oai:DiVA.org:ri-22218DiVA, id: diva2:1041762
Note

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-31 Created: 2016-10-31 Last updated: 2023-06-08Bibliographically approved

Open Access in DiVA

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

Authority records

Janson, Sverker

Search in DiVA

By author/editor
Janson, Sverker
By organisation
SICSComputer Systems Laboratory
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 88 downloads
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

urn-nbn

Altmetric score

urn-nbn
Total: 814 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf