Switch to: References

Add citations

You must login to add citations.
  1. New models for generating hard random boolean formulas and disjunctive logic programs.Giovanni Amendola, Francesco Ricca & Miroslaw Truszczynski - 2020 - Artificial Intelligence 279 (C):103185.
    Download  
     
    Export citation  
     
    Bookmark  
  • Backtracking algorithms for disjunctions of temporal constraints.Kostas Stergiou & Manolis Koubarakis - 2000 - Artificial Intelligence 120 (1):81-117.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • The TSP phase transition.Ian P. Gent & Toby Walsh - 1996 - Artificial Intelligence 88 (1-2):349-358.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Implicates and prime implicates in Random 3-SAT.Robert Schrag & James M. Crawford - 1996 - Artificial Intelligence 81 (1-2):199-222.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On market-inspired approaches to propositional satisfiability.William E. Walsh, Makoto Yokoo, Katsutoshi Hirayama & Michael P. Wellman - 2003 - Artificial Intelligence 144 (1-2):125-156.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Extending and implementing the stable model semantics.Patrik Simons, Ilkka Niemelä & Timo Soininen - 2002 - Artificial Intelligence 138 (1-2):181-234.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • Modelling and solving temporal reasoning as propositional satisfiability.Duc Nghia Pham, John Thornton & Abdul Sattar - 2008 - Artificial Intelligence 172 (15):1752-1782.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Planning as satisfiability: Heuristics.Jussi Rintanen - 2012 - Artificial Intelligence 193 (C):45-86.
    Download  
     
    Export citation  
     
    Bookmark   4 citations