Backtracking algorithms for disjunctions of temporal constraints (Q1575430): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Towards a general theory of action and time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing Mathematical Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint satisfaction techniques in job shop scheduling problem solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental results on the crossover point in random 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: From local to global consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental evaluation of preprocessing algorithms for constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3493325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Temporal constraint networks / 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: Twenty-one large tractable subclasses of Allen's algebra / 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: The satisfiability constraint gap / 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: Q4386920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards efficient universal planning: A randomized approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theoretical evaluation of selected backtracking algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: From local to global consistency in temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of query evaluation in indefinite temporal constraint databases / rank
 
Normal rank
Property / cites work
 
Property / cites work: On binary constraint problems / 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: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some pitfalls for experimenters with random SAT / 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: Reasoning about temporal relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical study of phase transitions in binary constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processing disjunctions in temporal constraint networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating hard satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating the phase transition in binary constraint satisfaction problems / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0004-3702(00)00019-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2103943372 / rank
 
Normal rank

Latest revision as of 11:17, 30 July 2024

scientific article
Language Label Description Also known as
English
Backtracking algorithms for disjunctions of temporal constraints
scientific article

    Statements

    Backtracking algorithms for disjunctions of temporal constraints (English)
    0 references
    0 references
    21 August 2000
    0 references
    temporal reasoning
    0 references
    constraint satisfaction problems
    0 references
    search
    0 references
    scheduling
    0 references
    spatio-temporal databases
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers