Validation of Knowledge-Based Systems by Means of Stochastic Search

Authors:
Laure Brisoux;Eric Grégoire;Lakhdar Sais
Affiliations:
-;-;-
Venue:
DEXA '98 Proceedings of the 9th International Workshop on Database and Expert Systems Applications
Year:
1998

Citing 0
Cited 5

KJ3: a tool assisting formal validation of knowledge-based systems

International Journal of Human-Computer Studies
Handling Inconsistency Efficiently in the Incremental Construction of Statified Belief Bases

ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
Taking stock of Turing test: a review, analysis, and appraisal of issues surrounding thinking machines

International Journal of Human-Computer Studies
Overcoming the Christmas Tree Syndrome

ICTAI '99 Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence
Automated parameter estimation of the hodgkin-huxley model using the differential evolution algorithm: Application to neuromimetic analog integrated circuits

Neural Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the use of stochastic search to validate first-order knowledge-based systems is investigated. It is well-known that such techniques can prove efficient in showing that consistency constraints do hold, at least in the propositional case. Powerful heuristics about the trace of stochastic search allow proofs of inconsistency to be obtained as well. But, how stochastic search can be applied to first-order knowledge-bases without giving rise to a combinatorial space explosion remains an open issue. In this paper, a partial instantiation schema is proposed in the context of the incremental consistency/inconsistency problem. It allows forms of depth-limited consistency and inconsistency to be handled in an effective manner, showing promising paths for the development of new efficient consistency checking techniques for first-order knowledge bases.