The BLM semantics may be inconsistent

Authors:
Jianhua Chen
Affiliations:
Louisiana State University, Baton Rouge, LA
Venue:
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Year:
1992

Citing 4
Cited 0

Generalized disjunctive well-founded semantics for logic programs: procedural semantics

Methodologies for intelligent systems, 5
Unfounded sets and well-founded semantics for general logic programs

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Strong Semantics for Logic Programs

ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
On Indefinite Databases and the Closed World Assumption

Proceedings of the 6th Conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

A declarative semantics for logic programs must guarantee logical consistency. In this short note, we point out that the fixed-point semantics by Baral et al. (the BLM semantics) [1] for disjunctive programs may give rise to an inconsistent state. We show that the source of the inconsistency problem is that the BLM-semantics does not use the information in the derived rules. A refined semantics which avoids the inconsistency problem using the notion of derived rules will be presented in a separate paper.