uu.seUppsala universitets publikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Reflection Principles in Computational Logic
Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för ADB och datalogi.
1998 (engelsk)Doktoravhandling, monografi (Annet vitenskapelig)
Abstract [en]

We introduce the concept of reflection principles as a knowledge representation paradigm in a computational logic setting. Reflection principles are expressed as certain kinds of logic schemata intended to capture the basic properties of the domain knowledge to be modelled. Reflection is then used to instantiate these schemata to answer specific queries about the domain.

This differs from other approaches to reflection mainly in the following three ways. First, it uses logical instead of procedural reflection. Second, it aims at a cognitively adequate declarative representation of various forms of knowledge and reasoning, as opposed to reflection as a means for controlling computation or deduction. Third, it facilitates the building of a complex theory by allowing a simpler theory to be enhanced by a compact metatheory, contrary to the construction of metatheories that are only conservative extensions of the basic theory.

A computational logic system for embedding reflection principles, called RCL (for Reflective Computational Logic), is presented in full detail. The system is an extension of Horn clause resolution-based logic, and is devised in a way that makes important features of reflection parametric as much as possible, so that they can be tailored according to specific needs of different application domains. Declarative and procedural semantics of the logic are described and correctness and completeness of reflection as logical inference are proved. Examples of reflection principles for three different application areas are shown.

The proposed approach to reflection is powerful and flexible enough to be integrated into different frameworks. We show how the use of reflection principles can be integrated into a framework of rational, reactive agents to enhance their reasoning capabilities. Finally, relationship with a variety of distinct sources within the literature on relevant topics is discussed.

sted, utgiver, år, opplag, sider
Uppsala universitet, 1998. , s. 154
Serie
Uppsala theses in computing science, ISSN 0283-359X ; 30
HSV kategori
Forskningsprogram
Datalogi
Identifikatorer
URN: urn:nbn:se:uu:diva-817ISBN: 91-506-1298-0 (tryckt)OAI: oai:DiVA.org:uu-817DiVA, id: diva2:170565
Disputas
1998-09-25, Room 1211, Polacksbacken, Uppsala University, Uppsala, 13:15 (engelsk)
Veileder
Tilgjengelig fra: 1998-09-04 Laget: 1998-09-04 Sist oppdatert: 2018-01-13bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric

isbn
urn-nbn
Totalt: 852 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf