Reasoning with model-based belief revision semantics: Theory and implementation

Belief revision semantics appear promising as a definition for the meaning of updates to logical knowledge bases. Numerous model-based belief revision semantics have been proposed in the literature in recent years. It is not at all clear, however, how to translate a proposed model-based semantics into a procedure suitable for implementation. As a result, it becomes hard for one to analyze and identify the practical limits of these revision semantics. In this thesis, we propose an architecture for implementing model-based theory revision semantics, discuss the major algorithms implemented in our prototype system, Immortal, analyze the complexity of the algorithms, and report some results from the implementation of the algorithms. The key feature of our algorithms, as shown in the complexity analysis, is that while belief revision is intractable in general, the expected running time of our algorithms will be polynomial for many interesting cases.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Chou, Seng-cho Timothy

Contributors dc:contributor

• Winslett, Marianne

• Computer Science

Statement dc:rights

• Copyright 1992 Chou, Seng-cho Timothy

Language dc:language

eng

Identifier

AAI9215793
(UMI)AAI9215793

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/22706