Journals in DBLP

Ann. Math. Artif. Intell.
2005, volume: 43, number: 1

1. Franc Brglez, Xiao Yu Li, Matthias F. M. Stallmann
   On SAT instance classes and a method for reliable performance experiments with SAT solvers. [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:1-34 [Journal]
   
2. Renato Bruni
   On exact selection of minimally unsatisfiable subformulae. [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:35-50 [Journal]
   
3. Philippe Chapdelaine, Nadia Creignou
   The complexity of Boolean constraint satisfaction local search problems. [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:51-63 [Journal]
   
4. Eugene Goldberg
   Testing satisfiability of CNF formulas by computing a stable set of points. [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:65-89 [Journal]
   
5. Edward A. Hirsch, Arist Kojevnikov
   UnitWalk: A new SAT solver that uses local search guided by unit clause elimination. [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:91-111 [Journal]
   
6. Hans Kleine Büning, Daoyun Xu
   The complexity of homomorphisms and renamings for minimal unsatisfiable formulas. [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:113-127 [Journal]
   
7. Gabor Kusper
   Solving the resolution-free SAT problem by submodel propagation in linear time. [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:129-136 [Journal]
   
8. Inês Lynce, João P. Marques Silva
   Efficient data structures for backtrack search SAT solvers. [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:137-152 [Journal]
   
9. Simona Cocco, Rémi Monasson
   Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT. [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:153-172 [Journal]
   
10. Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
    Exact 3-satisfiability is decidable in time O(2^0.16254n). [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:173-193 [Journal]
    
11. Steven David Prestwich, Stéphane Bressan
    A SAT approach to query optimization in mediator systems. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:195-210 [Journal]
    
12. Daniele Pretolani
    Probability logic and optimization SAT: The PSAT and CPA models. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:211-221 [Journal]
    
13. Stefan Szeider
    Generalizations of matched CNF formulas. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:223-238 [Journal]
    
14. Allen Van Gelder
    Toward leaner binary-clause reasoning in a satisfiability solver. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:239-253 [Journal]
    
15. Uwe Egly, Reinhard Pichler, Stefan Woltran
    On deciding subsumption problems. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:255-294 [Journal]
    
16. Hans Kleine Büning, Xishun Zhao
    Extension and equivalence problems for clause minimal formulae. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:295-306 [Journal]
    
17. Laurent Simon, Daniel Le Berre, Edward A. Hirsch
    The SAT2002 competition. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:307-342 [Journal]
    
18. Paul W. Purdom, Daniel Le Berre, Laurent Simon
    A parsimony tree for the SAT2002 competition. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:343-365 [Journal]