Determining the consistency of partial tree descriptions
From MaRDI portal
Publication:1028903
DOI10.1016/j.artint.2006.12.004zbMath1168.68546OpenAlexW2064224621MaRDI QIDQ1028903
Publication date: 9 July 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2006.12.004
Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Hardness of Network Satisfaction for Relation Algebras with Normal Representations ⋮ Combining tree partitioning, precedence, and incomparability constraints ⋮ Constraint Satisfaction Problems with Infinite Templates ⋮ The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- The complexity of reconstructing trees from qualitative characters and subtrees
- Local and global relational consistency
- Relation algebras and their application in temporal and spatial reasoning
- A first-order axiomatization of the theory of finite trees
- The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees
- Constraint Satisfaction with Countable Homogeneous Templates
- Reasoning about temporal relations
- A Sufficient Condition for Backtrack-Free Search
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Algorithms on Strings, Trees and Sequences
- Expressive power and complexity in algebraic logic
- Reasoning about temporal relations
- Computer Science Logic
- Classifying the Complexity of Constraints Using Finite Algebras
- The constraint language for lambda structures
