A complete classification of tractability in Allen's algebra relative to subsets of basic relations (Q1277697): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twenty-one large tractable subclasses of Allen's algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for reasoning about time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about temporal relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839154 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:51, 28 May 2024

scientific article
Language Label Description Also known as
English
A complete classification of tractability in Allen's algebra relative to subsets of basic relations
scientific article

    Statements

    A complete classification of tractability in Allen's algebra relative to subsets of basic relations (English)
    0 references
    0 references
    0 references
    2 March 1999
    0 references
    0 references
    temporal reasoning
    0 references
    computational complexity
    0 references
    Allen's algebra
    0 references
    tractability
    0 references
    complete classification
    0 references