I> This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal model semantics of positive disjunct...

We consider the decidability problem of intruder deduction in security protocol analysis, that is, deciding whether a given message M can be deduced from a set of messages Σ, under the class of convergent equational theories, modulo associativity and commutativity (AC) of certain binary operators. The traditional formulations of intruder deduction are usually given in natural-deduction-like sys...

We introduce the formalism of deduction graphs as a generalization of both Gentzen-Prawitz style natural deduction and Fitch style flag deduction. The advantage of this formalism is that subproofs can be shared, like in flag deductions (and unlike natural deduction), but also that the linearisation used in flag deductions is avoided. Our deduction graphs have both nodes and boxes, which are col...

We consider a standard system of sequents and a system of extended natural deduction (which is a modification of natural deduction) for intuitionistic predicate logic and connect the special cuts, maximum cuts, from sequent derivations and maximum segments from derivations of extended natural deduction. We show that the image of a sequent derivation without maximum cuts is a derivation without ...

Partial deduction is known as an optimization technique in logic programming. In the context of abductive logic programming, however, we present in this paper that normal partial deduction does not preserve explanations for abductive reasoning. Then we provide an alternative method of partial deduction, called abductive partial deduction, which is shown to preserve the meanings of abductive log...

> The idea of lean deduction is to achieve maximal efficiency from minimal means. Every possible effort is made to eliminate overhead. Logic programming languages provide an ideal tool for implementing lean deduction, as they offer a level of abstraction that is close to the needs for building firstorder deduction systems. In this paper we describe the principle of lean deduction and present le...

We study the problem of probabilistic deduction with conditional constraints over basic events. We show that globally complete probabilistic deduction with conditional constraints over basic events is NP-hard. We then concentrate on the special case of probabilistic deduction in conditional constraint trees. We elaborate very eecient techniques for globally complete probabilistic deduction. In ...