Determining the consistency of partial tree descriptions (Q1028903): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2006.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064224621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A first-order axiomatization of the theory of finite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction with Countable Homogeneous Templates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3365840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about temporal relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local and global relational consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relation algebras and their application in temporal and spatial reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constraint language for lambda structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressive power and complexity in algebraic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about temporal relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank
 
Normal rank

Latest revision as of 19:01, 1 July 2024

scientific article
Language Label Description Also known as
English
Determining the consistency of partial tree descriptions
scientific article

    Statements

    Determining the consistency of partial tree descriptions (English)
    0 references
    0 references
    0 references
    9 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    tree descriptions
    0 references
    constraint satisfaction problems
    0 references
    graph algorithms
    0 references
    left-linear point algebra
    0 references
    0 references