Switch to: Citations

Add references

You must login to add references.
  1. A finite relation algebra with undecidable network satisfaction problem.Robin Hirsch - 1999 - Logic Journal of the IGPL 7 (4):547-554.
    We define a finite relation algebra and show that the network satisfaction problem is undecidable for this algebra.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Backtracking algorithms for disjunctions of temporal constraints.Kostas Stergiou & Manolis Koubarakis - 2000 - Artificial Intelligence 120 (1):81-117.
    Download  
     
    Export citation  
     
    Bookmark   5 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  
  • Disjunctions, independence, refinements.Mathias Broxvall, Peter Jonsson & Jochen Renz - 2002 - Artificial Intelligence 140 (1-2):153-173.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Reasoning about partially ordered events.Thomas Dean & Mark Boddy - 1988 - Artificial Intelligence 36 (3):375-399.
    Download  
     
    Export citation  
     
    Bookmark   14 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  
  • Reasoning about action in polynomial time.Thomas Drakengren & Marcus Bjäreland - 1999 - Artificial Intelligence 115 (1):1-24.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Parameterized Complexity Theory.J. Flum - 2007 - Bulletin of Symbolic Logic 13 (2):246-248.
    Download  
     
    Export citation  
     
    Bookmark   20 citations