Publication:4411842
From MaRDI portal
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
03B25: Decidability of theories and sets of sentences
03B35: Mechanization of proofs and logical operations
68N17: Logic programming
03B40: Combinatory logic and lambda calculus
Related Items
Manipulating Tree Tuple Languages by Transforming Logic Programs1 1Extended abstract; see http://www.logic.at/css/ftp03.pdf for the proofs., Tree tuple languages from the logic programming point of view, Alternating two-way AC-tree automata, Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically