
Possibility and Necessity Functions over Nonclassical Logics
We propose an integration of possibility theory into nonclassical logic...
read it

A repetitionfree hypersequent calculus for firstorder rational Pavelka logic
We present a hypersequent calculus G^3Ł∀ for firstorder infinitevalued...
read it

On the Semantics and Automated Deduction for PLFC, a Logic of Possibilistic Uncertainty and Fuzziness
Possibilistic logic is a wellknown graded logic of uncertainty suitable...
read it

Tableaubased decision procedure for nonFregean logic of sentential identity
Sentential Calculus with Identity (SCI) is an extension of classical pro...
read it

Dialogues for proof search
Dialogue games are a twoplayer semantics for a variety of logics, inclu...
read it

Automated Reasoning Using Possibilistic Logic: Semantics, Belief Revision and Variable Certainty Weights
In this paper an approach to automated deduction under uncertainty,based...
read it

Proof Complexity of Substructural Logics
In this paper, we investigate the proof complexity of a wide range of su...
read it
An Alternative Proof Method for Possibilistic Logic and its Application to Terminological Logics
Possibilistic logic, an extension of firstorder logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a firstorder formula is equipped with a possibility degree or a necessity degree that expresses to what extent the formula is possibly or necessarily true. Possibilistic resolution yields a calculus for possibilistic logic which respects the semantics developed for possibilistic logic. A drawback, which possibilistic resolution inherits from classical resolution, is that it may not terminate if applied to formulas belonging to decidable fragments of firstorder logic. Therefore we propose an alternative proof method for possibilistic logic. The main feature of this method is that it completely abstracts 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 o f firstorder logic but nevertheless much more expressive than propositional logic. This yields an extension of terminological logics towards the representation of uncertain knowledge which is satisfactory from a semantic as well as algorithmic point of view.
READ FULL TEXT
Comments
There are no comments yet.