Switch to: Citations

Add references

You must login to add references.
  1. Search rearrangement backtracking and polynomial average time.Paul Walton Purdom - 1983 - Artificial Intelligence 21 (1-2):117-133.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics.Bernard Nudel - 1983 - Artificial Intelligence 21 (1-2):135-178.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • A Temporal Logic for Reasoning about Processes and Plans.Drew McDermott - 1982 - Cognitive Science 6 (2):101-155.
    Much previous work in artificial intelligence has neglected representing time in all its complexity. In particular, it has neglected continuous change and the indeterminacy of the future. To rectify this, I have developed a first‐order temporal logic, in which it is possible to name and prove things about facts, events, plans, and world histories. In particular, the logic provides analyses of causality, continuous change in quantities, the persistence of facts (the frame problem), and the relationship between tasks and actions. It (...)
    Download  
     
    Export citation  
     
    Bookmark   82 citations  
  • The complexity of some polynomial network consistency algorithms for constraint satisfaction problems.Alan K. Mackworth & Eugene C. Freuder - 1985 - Artificial Intelligence 25 (1):65-74.
    Download  
     
    Export citation  
     
    Bookmark   71 citations  
  • Consistency in networks of relations.Alan K. Mackworth - 1977 - Artificial Intelligence 8 (1):99-118.
    Download  
     
    Export citation  
     
    Bookmark   109 citations  
  • Mechanizing temporal knowledge.Kenneth Kahn & G. Anthony Gorry - 1977 - Artificial Intelligence 9 (1):87-108.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Increasing tree search efficiency for constraint satisfaction problems.Robert M. Haralick & Gordon L. Elliott - 1980 - Artificial Intelligence 14 (3):263-313.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • Towards a general theory of action and time.James F. Allen - 1984 - Artificial Intelligence 23 (2):123-154.
    Download  
     
    Export citation  
     
    Bookmark   79 citations  
  • Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition.Rina Dechter - 1990 - Artificial Intelligence 41 (3):273-312.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Temporal data base management.Thomas L. Dean & Drew V. McDermott - 1987 - Artificial Intelligence 32 (1):1-55.
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Constraint propagation with interval labels.Ernest Davis - 1987 - Artificial Intelligence 32 (3):281-331.
    Download  
     
    Export citation  
     
    Bookmark   16 citations