We present an algorithm to decide the intruder deduction problem (IDP) for a class of locally stable theories enriched with normal forms. Our result relies on a new and efficient algorithm to solve a restricted case of higher-order associative-commutative matching, obtained by combining the Distinct Occurrences of AC-matching algorithm and a standard algorithm to solve systems of linear Diophan...

We define a translation that maps higher-order formulas provable in a classical extensional setting to semantically equivalent formulas provable in an intuitionistic intensional setting. For the classical extensional higher-order proof system we define a Henkincomplete tableau calculus. For the intuitionistic intensional higher-order proof system we give a natural deduction calculus. We prove t...

The first step for developing an heterogeneous federated database consists in translating local schemas into a canonical data model. This paper offers a method to transform a relational schema into an equivalent object-oriented one. We study in particular the translation of the nary relationship tables (n>2). The canonical data model we are using is the IFO2 data model [16], [17], [24]. We tran...

Deducbve databases have the ability to deduce new facts from a set of facts using a set of rules. They are also useful in the integration of artificial intelligence and database. However, when recursive rules are involved, the amount of deduced facts can become too large to be practically stored, viewed or analyzed. This seriously hinders the usefulness of deductive databases. In order to overc...

Taking our inspiration from modal correspondence theory, we present the idea of correspondence analysis for many-valued logics. As a benchmark case, we study truth-functional extensions of the Logic of Paradox (L P). First, we characterize each of the possible truth table entries for unary and binary operators that could be added to L P by an inference scheme. Second, we define a class of natur...

In recent work it has been shown that infinite state model checking can be performed by a combination of partial deduction of logic programs and abstract interpretation. This paper characterises some classes of problems which can be decided by this approach. In particular, we show that a restricted form of partial deduction is already powerful enough to decide all coverability properties of Pet...

This application proposes a seminar bringing together researchers working in deduction and fields related to arithmetic constraint solving. Current research in deduction can be categorized in three main strands: SMT solvers, automated firstorder provers, and interactive provers. Although dealing with arithmetic is currently in focus of all three for some years, they are still in need of much be...