scientific article; zbMATH DE number 1948181
From MaRDI portal
Publication:4411842
zbMath1020.03012MaRDI QIDQ4411842
Publication date: 10 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2471/24710473.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Logic programming (68N17) Combinatory logic and lambda calculus (03B40)
Related Items (4)
Alternating two-way AC-tree automata ⋮ Tree tuple languages from the logic programming point of view ⋮ Manipulating Tree Tuple Languages by Transforming Logic Programs1 1Extended abstract; see http://www.logic.at/css/ftp03.pdf for the proofs. ⋮ Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically
This page was built for publication:
