#### Filter Results:

#### Publication Year

1997

2014

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We describe an approach for developing knowledge-based medical decision support systems based on the new technology of case-based reasoning. This work is based on the results of the Inreca European project and preliminary results from the Inreca + project which mainly deals with medical applications. One goal was to start from case-based reasoning… (More)

This paper continues a systematic approach to build natural deduction calculi and corresponding proof procedures for non-classical logics. Our attention is now paid to the framework of paraconsistent logics. These logics are used, in particular, for reasoning about systems where paradoxes do not lead to the 'deductive explosion', i.e., where formulae of the… (More)

In this paper we extend our clausal resolution method for linear time temporal logics to a branching-time framework. Thus, we propose an eecient deductive method useful in a variety of applications requiring an expressive branching-time temporal logic in AI. The branching-time temporal logic considered is Computation Tree Logic (CTL), often regarded as the… (More)

We present a natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. The system extends the natural deduction construction of the classical propositional logic. This will open the prospect to apply our technique as an automatic reasoning tool in a deliberative decision making framework across various AI… (More)

We present a proof-searching algorithm for the classical first order natural deduction calculus and prove its correctness. For any given task (if this task is indeed solvable), a searching algorithm terminates, either finding a corresponding natural deduction proof or giving a set of constraints, from which a counterexample can be extracted. Proofs of the… (More)

We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to apply our technique as an automated reasoning tool in a number of emerging computer science applications and in a deliberative decision making framework across various AI… (More)

In this paper we extend our clausal resolution method for linear temporal logics to a branching-time framework. The branching-time temporal logics considered are Computation Tree Logic (CTL), often regarded as the simplest useful logic of this class, and Extended CTL (ECTL), which is CTL extended with fairness operators. The key elements of the resolution… (More)