Semantics of Belief Change Operators for Intelligent Agents : Iteration, Postulates, and Realizability / K. Sauerwald.

Format:

Book

Author/Creator:

Sauerwald, K., author.

Series:

Dissertations in Artificial Intelligence

Dissertations in Artificial Intelligence Series ; Volume 352

Language:

English

Subjects (All):

Human-computer interaction.

Intelligent agents (Computer software).

Physical Description:

1 online resource (368 pages)

Edition:

First edition.

Place of Publication:

Berlin, Germany : Akademische Verlagsgesellschaft AKA GmbH, [2022]

Summary:

This doctoral dissertation by Kai Sauerwald explores the semantics of belief change operators in intelligent agents, particularly focusing on iteration, postulates, and realizability. Rooted in the foundational work of Alchourrón, Gärdenfors, and Makinson (AGM), the study advances the theory of belief change, which is crucial for modeling intelligent behavior in dynamic environments. The dissertation examines the characterization of belief revision and contraction using total preorders over possible worlds, and it introduces novel revision operators that extend beyond classical theories. The work contributes significantly to the field by addressing both prioritized and non-prioritized belief changes, offering a comprehensive analysis of iteration principles, and proposing extensions relevant to cognitive logics. The intended audience includes researchers and professionals in artificial intelligence, particularly those interested in knowledge representation and reasoning. Generated by AI.

Contents:

Title Page

Contents

Introduction

Motivation and Research Context

Research Questions and Contributions

Organization of the Thesis

Previous Publications

Preliminaries and Propositional Logic

Background on Belief Change

One-Shot AGM Belief Change

Iterable Change in Propositional Logic

Characterizations in Propositional Logic

Further remarks

Base Revision in Tarskian Logics

Introduction to Part I

Revision in Base Logics

Preliminaries

Base Revision in Propositional Logic

Approach for Arbitrary Base Logics

One-Way Representation Theorem

Two-Way Representation Theorem

Base Changes and Syntax Independence

Interim Conclusion and Remarks

Characterization of TPO-Representability

Total-Preorder-Representability

Critical Loops

TPO-Representability to Absence of Critical Loops

No Critical Loops to TPO-Representability

Characterization Theorems and Example

Conclusion and Discussion Generated by AI.

Notes:

Includes bibliographical references and index.

Description based on publisher supplied metadata and other sources.

Part of the metadata in this record was created by AI, based on the text of the resource.

Description based on print version record.

Other Format:

Print version: Sauerwald, K. Semantics of Belief Change Operators for Intelligent Agents: Iteration, Postulates, and Realizability

ISBN:

9781643683256

OCLC:

1354207005