Elementary Deduction Problem for Locally Stable Theories with Normal Forms
نویسندگان
چکیده
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 Diophantine equations. A translation between natural deduction and sequent calculus allows us to use the same approach to decide the elementary deduction problem for locally stable theories. As an application, we model the theory of blind signatures and derive an algorithm to decide IDP in this context, extending previous decidability results.
منابع مشابه
A Proof Theoretic Analysis of Intruder Theories
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...
متن کاملRegular Lie Groups and a Theorem of Lie-palais
In 1984 Milnor had shown how to deduce the Lie-Palais theorem on integration of infinitesimal actions of finite-dimensional Lie algebras on compact manifolds from general theory of regular Lie groups modelled on locally convex spaces. We show how, in the case of effective action, one can eliminate from Milnor’s argument the abstract Lie-Cartan theorem, making the deduction rather elementary. A ...
متن کاملInclusional Theories in Declarative Programming
When studying speciic deduction techniques and strategies for operational semantics of logic programming languages special emphasis was put on the equality relation, due to its interest in a variety of diierent domains. But recently special emphasis has been put on partial order relations, and speciically on inclusions, as a basis for several diierent specii-cation frameworks. It is therefore a...
متن کاملReduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures
The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational theory implemented as a convergent rewriting system which involves rules for addition, multiplication and exponentiation. The whole deductive power of the intruder is modeled as a sequent calculus that, modulo this rewriting s...
متن کاملCortical bases of elementary deductive reasoning: inference, memory, and metadeduction.
Elementary deduction is the ability of unreflectively drawing conclusions from explicit or implicit premises, on the basis of their logical forms. This ability is involved in many aspects of human cognition and interactions. To date, limited evidence exists on its cortical bases. We propose a model of elementary deduction in which logical inferences, memory, and meta-logical control are separab...
متن کامل