Share Email Print

Proceedings Paper

Inconsistency checking: an approach based on satisfiability
Author(s): Ram Mohan Bharadwaj; N. Parameswaran
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In this paper we construct a propositional formula for each hypothesis in a knowledge base. This is done by traversing the knowledge network constructed from a given knowledge base. The basis for this work is the fact that, for any hypothesis f, both f and NOT f can not be proved simultaneously in a consistent knowledge base. Thus the presence of a satisfiable formula of the form (f and NOT f) indicates an inconsistency in the knowledge base. Since consistency checking in a knowledge base is proved to be an NP-complete problem, distributing the task will be advantageous. Unlike the earlier attempts to check inconsistency of knowledge bases, our approach gives flexibility to distribute the consistency checking, in a distributed environment.

Paper Details

Date Published: 1 March 1992
PDF: 7 pages
Proc. SPIE 1707, Applications of Artificial Intelligence X: Knowledge-Based Systems, (1 March 1992); doi: 10.1117/12.56871
Show Author Affiliations
Ram Mohan Bharadwaj, Indian Institute of Technology/Madras (India)
N. Parameswaran, Univ. of New South Wales (Australia)

Published in SPIE Proceedings Vol. 1707:
Applications of Artificial Intelligence X: Knowledge-Based Systems
Gautam Biswas, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?