Hunter, A; (2003) Probable consistency checking for sets of propositional clauses. In: Nielsen, TD and Zhang, NL, (eds.) SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, PROCEEDING. (pp. 464 - 476). SPRINGER-VERLAG BERLIN
Full text not available from this repository.
Inconsistencies inevitably arise in knowledge during practical reasoning. In a logic-based approach, this gives rise to the need for consistency checking. Unfortunately, this can be difficult. In classical propositional logic, this is intractable. However, there is a useful alternative to the notion of consistency called probable consistency. This offers a weakening of classical consistency checking where polynomial time tests are done on a set of formulae to determine the probability that the set of formulae is consistent. In this paper, we present a framework for probable consistency checking for sets of clauses, and analyse some classes of polynomial time tests.
|Title:||Probable consistency checking for sets of propositional clauses|
|Event:||7th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty|
|Location:||AALBORG UNIV, AALBORG, DENMARK|
|Dates:||2003-07-02 - 2003-07-05|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only: edit this record