Switch to: Citations

Add references

You must login to add references.
  1. Recursive conditioning.Adnan Darwiche - 2001 - Artificial Intelligence 126 (1-2):5-41.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • A Spatial Logic Based on Regions and Connection.David Randell, Cui A., Cohn Zhan & G. Anthony - 1992 - KR 92:165--176.
    Download  
     
    Export citation  
     
    Bookmark   56 citations  
  • On the Homogeneous Countable Boolean Contact Algebra.Ivo Düntsch & Sanjiang Li - 2013 - Logic and Logical Philosophy 22 (2):213-251.
    In a recent paper, we have shown that the class of Boolean contact algebras (BCAs) has the hereditary property, the joint embedding property and the amalgamation property. By Fraïssé’s theorem, this shows that there is a unique countable homogeneous BCA. This paper investigates this algebra and the relation algebra generated by its contact relation. We first show that the algebra can be partitioned into four sets {0}, {1}, K, and L, which are the only orbits of the group of base (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Temporal constraint networks.Rina Dechter, Itay Meiri & Judea Pearl - 1991 - Artificial Intelligence 49 (1-3):61-95.
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • Constants and finite unary relations in qualitative constraint reasoning.Peter Jonsson - 2018 - Artificial Intelligence 257 (C):1-23.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Reasoning about partially ordered events.Thomas Dean & Mark Boddy - 1988 - Artificial Intelligence 36 (3):375-399.
    Download  
     
    Export citation  
     
    Bookmark   14 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  
  • Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms.Peter Jonsson, Victor Lagerkvist & George Osipov - 2021 - Artificial Intelligence 296 (C):103505.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Relation algebras of intervals.Robin Hirsch - 1996 - Artificial Intelligence 83 (2):267-295.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Decomposition and tractability in qualitative spatial and temporal reasoning.Jinbo Huang, Jason Jingshi Li & Jochen Renz - 2013 - Artificial Intelligence 195 (C):140-164.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus.Jochen Renz & Bernhard Nebel - 1999 - Artificial Intelligence 108 (1-2):69-123.
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Fixed-parameter complexity in AI and nonmonotonic reasoning.Georg Gottlob, Francesco Scarcello & Martha Sideri - 2002 - Artificial Intelligence 138 (1-2):55-86.
    Download  
     
    Export citation  
     
    Bookmark   11 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