LiU Electronic Press

Author:

Title:

A three-valued approach to non-monotonic reasoning

Department:

Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab

Linköping University, The Institute of Technology

Publication type:

Licentiate thesis, comprehensive summary (Other academic)

Language:

English

Place of publ.:
Linköping, Sweden
Publisher:
Linköping University

Pages:

117

Series:

Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971; 230

Year of publ.:

1990

URI:

urn:nbn:se:liu:diva-42020

Permanent link:

http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-42020

ISBN:

91-7870-672-6

Local ID:

LIU-TEK-1990:30

Subject category:

Computer Science

SVEP category:

Computer science

Abstract(en)
:

The subject of this thesis is the formalization of a type of non-monotonic reasoning using a three-valued logic based on the strong definitions of Kleene. Non-monotonic reasoning is the rule rather than the exception when agents, human or machine, must act where information about the environment is uncertain or incomplete. Information about the environment is subject to change due to external causes, or may simply become outdated. This implies that inferences previously made may no longer hold and in turn must be retracted along with the revision of other information dependent on the retractions. This is the variety of reasoning we would like to find formal models for.

We start by extending Kleene-s three-valued logic with an "external negation" connective where ~ a is true when a is false or unknown. In addition, a default operator D is added where D a is interpreted as "a is true by default. The addition of the default operator increases the expressivity of the language, where statements such as "a is not a default" are directly representable. The logic has an intuitive model theoretic semantics without any appeal to the use of a fixpoint semantics for the default operator. The semantics is based on the notion of preferential entailment, where a set of sentences G preferentially entails a sentence a, if and only if a preferred set of the models of G are models of a. We also show that one version of the logic belongs to the class of cumulative non-monotonic formalisms which are a subject of current interest.

A decision procedure for the propositional case, based on the semantic tableaux proof method is described and serves as a basis for a QA-system where it can be determined if a sentence a is preferentially entailed by a set of premises G. The procedure is implemented.

Presentation:

1990-06-14, Seminarierummet, hus E, Campus Valla, Linköpings universitet, Linköping, 13:15 (English)

Degree:

Licentiate of Philosophy

Available from:

2009-10-10

Created:

2009-10-10

Last updated:

2013-11-25

Statistics:

0 hits