Determining the consistency of partial tree descriptions
type: Item
instance of: scholarly article
title: Determining the consistency of partial tree descriptions
zbMATH Open document ID: 1168.68546
author: Manuel Bodirsky
author: Martin Kuetz
published in: Artificial Intelligence
publication date: 2009-07-09T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 92D15
zbMATH DE Number: 5576663
zbMATH Keywords: tree descriptions
zbMATH Keywords: constraint satisfaction problems
zbMATH Keywords: graph algorithms
zbMATH Keywords: left-linear point algebra
MaRDI profile type: Publication
full work available at URL: j.artint.2006.12.004
OpenAlex ID: W2064224621
cites work: Maintaining knowledge about temporal intervals
cites work: A first-order axiomatization of the theory of finite trees
cites work: Q4736847
cites work: Computer Science Logic
cites work: Constraint Satisfaction with Countable Homogeneous Templates
cites work: Q3365840
cites work: Classifying the Complexity of Constraints Using Finite Algebras
cites work: Reasoning about temporal relations
cites work: Q3995219
cites work: Q3325928
cites work: Local and global relational consistency
cites work: Relation algebras and their application in temporal and spatial reasoning
cites work: The constraint language for lambda structures
cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
cites work: A Sufficient Condition for Backtrack-Free Search
cites work: Algorithms on Strings, Trees and Sequences
cites work: Expressive power and complexity in algebraic logic
cites work: The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees
cites work: The complexity of reconstructing trees from qualitative characters and subtrees
DOI: 10.1016/J.ARTINT.2006.12.004
description: scientific article; zbMATH DE number 5576663