Temporal constraint networks (Q1182161): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/0004-3702(91)90006-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2130182605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining knowledge about temporal intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a general theory of action and time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables Per Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Algebra Applied to Path-finding Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint propagation with interval labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3489503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network-based heuristics for constraint-satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree clustering for constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesizing constraint expressions / 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: Q3050157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On binary constraint problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic structures for transitive closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / 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: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Linear Inequalities by Computing Loop Residues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Solving Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Full chains of twists for orthogonal algebras. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:54, 15 May 2024

scientific article
Language Label Description Also known as
English
Temporal constraint networks
scientific article

    Statements

    Temporal constraint networks (English)
    0 references
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    decomposition
    0 references
    path consistency algorithm
    0 references
    Floyd-Warshall all pairs- shortest paths algorithm
    0 references
    temporal reasoning
    0 references
    temporal constraint satisfaction problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers