Switch to: References

Add citations

You must login to add citations.
  1. Complexity classification in qualitative temporal constraint reasoning.Peter Jonsson & Andrei Krokhin - 2004 - Artificial Intelligence 160 (1-2):35-51.
    Download  
     
    Export citation  
     
    Bookmark  
  • 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  
  • Qualitative constraint satisfaction problems: An extended framework with landmarks.Sanjiang Li, Weiming Liu & Shengsheng Wang - 2013 - Artificial Intelligence 201 (C):32-58.
    Download  
     
    Export citation  
     
    Bookmark   3 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-zlfb6 uwo