This paper discusses and compares various answers to the question when argumentation is deductive. includes an answer questions defeasible whether a subclass of deductive or it distinct form argumentation. It concluded that as conceived by Philosophers like Pollock Rescher formalised in ASPIC+ framework systems Defeasible Logic Programming, are semantically different categories. For this reason...

This paper presents, from a user point of view, a deductive database system based on Hereditary Harrop Formulas with Constraints and Negation, HH¬(C). The Prolog implementation of this system is based on a fixpoint semantics proposed in a previous work. The answer to a query posed to a database is intended as a constraint of the constraint system associated to C. We have developed several solve...

This paper presents C-CLASSIC , a Description Logic (DL) which is expressive enough to be practically useful and which can handle default knowledge. C-CLASSIC has been given an intensional semantics (CL) in which concepts are denoted by a normal form of the set of their properties (rather than the set of their instances as is the case in model-theoric semantics). Therefore, the subsumption algo...

We present a tool, called Cascade, to check assertions in C programs as part of a multi-stage verification strategy. Cascade takes as input a C program and a control file (the output of an earlier stage) that specifies one or more assertions to be checked together with (optionally) some restrictions on program behaviors. For each assertion, Cascade produces either a concrete trace violating the...