Preserving consistency across abstraction mappings

Authors:
Josh D. Tenenberg
Affiliations:
Computer Science Department, University of Rochester, Rochester, NY
Venue:
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
Year:
1987

Citing 1
Cited 4

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)

Perception-Based Granularity Levels in Concept Representation

ISMIS '00 Proceedings of the 12th International Symposium on Foundations of Intelligent Systems
Formalizing the abstraction process in model-based diagnosis

SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Abstraction and complexity measures

SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Multistrategy Operators for Relational Learning and Their Cooperation

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

An abstraction mapping over clausal form theories in first-order predicate calculus is presented that involves the renaming of predicate symbols. This renaming is not 1-1, in the sense that several predicate symbols Ri,..., Rn from the original theory are all replaced by a single symbol R in the abstract theory. In order to preserve consistency, however, the clauses that distinguish the Ri's must be discarded in the abstract theory. This leads to a simple semantics; the union of the extensions of each of the Ri's in any model of the original theory forms the extension of R in a model of the abstract theory.