Translator Disclaimer
1 March 1992 Inconsistency checking: an approach based on satisfiability
Author Affiliations +
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.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ram Mohan Bharadwaj and N. Parameswaran "Inconsistency checking: an approach based on satisfiability", Proc. SPIE 1707, Applications of Artificial Intelligence X: Knowledge-Based Systems, (1 March 1992); https://doi.org/10.1117/12.56871
PROCEEDINGS
7 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT

A web QoS strategy based on session for web cluster...
Proceedings of SPIE (February 20 2006)
Case-based reasoning approach for heuristic search
Proceedings of SPIE (March 01 1991)
SIMD approach to IDA* search
Proceedings of SPIE (March 01 1992)
Parallelism In Rule-Based Systems
Proceedings of SPIE (March 29 1988)
Learning to recognize reusable software by induction
Proceedings of SPIE (January 01 1990)

Back to Top