Switch to: References

Add citations

You must login to add citations.
  1. The computational complexity of propositional STRIPS planning.Tom Bylander - 1994 - Artificial Intelligence 69 (1-2):165-204.
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  • Modeling a dynamic and uncertain world I.Steve Hanks & Drew McDermott - 1994 - Artificial Intelligence 66 (1):1-55.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Complexity, decidability and undecidability results for domain-independent planning.Kutluhan Erol, Dana S. Nau & V. S. Subrahmanian - 1995 - Artificial Intelligence 76 (1-2):75-88.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Temporal reasoning based on semi-intervals.Christian Freksa - 1992 - Artificial Intelligence 54 (1-2):199-227.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Solving infinite-domain CSPs using the patchwork property.Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak & George Osipov - 2023 - Artificial Intelligence 317 (C):103880.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An initial study of time complexity in infinite-domain constraint satisfaction.Peter Jonsson & Victor Lagerkvist - 2017 - Artificial Intelligence 245 (C):115-133.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • An algorithm for probabilistic planning.Nicholas Kushmerick, Steve Hanks & Daniel S. Weld - 1995 - Artificial Intelligence 76 (1-2):239-286.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • On the nature and role of modal truth criteria in planning.Subbarao Kambhampati & Dana S. Nau - 1996 - Artificial Intelligence 82 (1-2):129-155.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the computational complexity of temporal projection, planning, and plan validation.Bernhard Nebel & Christer Bäckström - 1994 - Artificial Intelligence 66 (1):125-160.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Qualitative and quantitative simulation: bridging the gap.Daniel Berleant & Benjamin J. Kuipers - 1997 - Artificial Intelligence 95 (2):215-255.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Reasoning about causality between distributed nonatomic events.Ajay D. Kshemkalyani - 1997 - Artificial Intelligence 92 (1-2):301-315.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
  • Querying temporal and spatial constraint networks in PTIME☆☆A preliminary version of this paper appeared in the proceedings of AAAI-99. A different version of this paper (aimed at a database audience) appeared in the proceedings of the workshop STDBM99. [REVIEW]Manolis Koubarakis & Spiros Skiadopoulos - 2000 - Artificial Intelligence 123 (1-2):223-263.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A unifying approach to temporal constraint reasoning.Peter Jonsson & Christer Bäckström - 1998 - Artificial Intelligence 102 (1):143-155.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Point algebras for temporal reasoning: Algorithms and complexity.Mathias Broxvall & Peter Jonsson - 2003 - Artificial Intelligence 149 (2):179-220.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-6f97f49787-r597v uwo