Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure (Q543614): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2010.10.004 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.artint.2010.10.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050262935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of point-based approaches to qualitative temporal reasoning / 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: Q5693201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Minimal Point Algebra Constraints by Metagraph Closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining topological and size information for spatial reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for qualitative reasoning about time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5750447 / 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: On binary constraint problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining qualitative and quantitative constraints in temporal reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks of constraints: Fundamental properties and applications to picture processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about temporal relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporally distributed symptoms in technical diagnosis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about qualitative temporal information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386938 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2010.10.004 / rank
 
Normal rank

Latest revision as of 21:03, 9 December 2024

scientific article
Language Label Description Also known as
English
Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
scientific article

    Statements

    Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure (English)
    0 references
    0 references
    0 references
    17 June 2011
    0 references
    qualitative temporal reasoning
    0 references
    temporal relations and constraints
    0 references
    point algebra
    0 references
    point calculus
    0 references
    simple interval algebra
    0 references
    minimal relations
    0 references
    temporal CSP
    0 references
    constraint-based reasoning
    0 references
    graph-based reasoning
    0 references
    tractable reasoning
    0 references

    Identifiers