An alternative proof method for possibilistic logic and its application to terminological logics

Abstract

Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be es­ timated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possi­ bility degree or a necessity degree that ex­ presses to what extent the formula is pos­ sibly or necessarily true. Possibilistic reso­ lution yields a calculus for possibilistic logic which respects the semantics developed for possibilistic logic. A drawback, which possibilistic resolution in­ herits from classical resolution, is that it may not terminate if applied to formulas belong­ ing to decidable fragments of first-order log­ ic. Therefore we propose an alternative proof method for possibilistic logic. The main fea­ ture of this method is that it completely ab­ stracts from a concrete calculus but uses as basic operation a test for classical entailment. We then instantiate possibilistic logic with a terminological logic, which is a decidable subclass of first-order logic but nevertheless much more expressive than propositional log­ ic. This yields an extension of terminological logics towards the representation of uncer­ tain knowledge which is satisfactory from a semantic as well as algorithmic point of view.

DOI: 10.1016/0888-613X(94)00015-U

Extracted Key Phrases

Statistics

01020'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

89 Citations

Semantic Scholar estimates that this publication has 89 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Hollunder1994AnAP, title={An alternative proof method for possibilistic logic and its application to terminological logics}, author={Bernhard Hollunder}, journal={Int. J. Approx. Reasoning}, year={1994}, volume={12}, pages={85-109} }