Tree tuple languages from the logic programming point of view
type: Item
instance of: scholarly article
title: Tree tuple languages from the logic programming point of view
zbMATH Open document ID: 1113.68038
author: Sébastien Limet
author: Gernot Salzer
published in: Journal of Automated Reasoning
publication date: 2007-05-03T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5149179
zbMATH Keywords: inductive definitions over language expressions
MaRDI profile type: Publication
full work available at URL: s10817-006-9064-8
OpenAlex ID: W1985272693
cites work: Unification theory
cites work: Set constraints with intersection
cites work: Q4273671
cites work: Hyperresolution and automated model building
cites work: Resolution decision procedures
cites work: Q4282510
cites work: Set constraints and automata
cites work: Q4411842
cites work: Q2771057
cites work: Q4503902
cites work: Theoretical Aspects of Computing – ICTAC 2005
cites work: Q3836513
cites work: Q3339245
cites work: Q4411948
cites work: Q4391453
cites work: Rational tree relations
cites work: Q4255518
cites work: Q4483918
cites work: Haskell overloading is DEXPTIME-complete
cites work: Grid structures and undecidable constraint theories
DOI: 10.1007/S10817-006-9064-8
description: scientific article; zbMATH DE number 5149179