Elementary Deduction Problem for Locally Stable Theories with Normal Forms

Abstract

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 emphelementary 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

Intruder deduction problem for locally stable theories with normal forms and inverses

“…Preliminary results have been presented at LSFA 2012 [5], but here we give a new decidability algorithm for the IDP, which runs in polynomial (resp. non-deterministic polynomial) time w.r.t.…”