The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Conferences in DBLP

Theory and Applications of Satisfiability Testing (sat)
2004 (conf/sat/2004)

  1. Ling Zhao, Martin Müller 0003
    Game-SAT: A Preliminary Report. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  2. Darsh P. Ranjan, Daijue Tang, Sharad Malik
    A Comparative Study of 2QBF Algorithms. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  3. Steven David Prestwich, Colin Quirke
    Local Search for Very Large SAT Problems. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  4. Stefan Porschen, Ewald Speckenmeyer
    Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  5. Nicola Galesi, Oliver Kullmann
    Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  6. Alex S. Fukunaga
    Efficient Implementations of SAT Local Search. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  7. Guoqiang Pan, Moshe Y. Vardi
    Search vs. Symbolic Techniques in Satisfiability Solving. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  8. Vasco M. Manquinho, João P. Marques Silva
    Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  9. Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, Daher Kaiss
    Boolean Ring Satisfiability. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  10. Evgeny Dantsin, Alexander Wolpert
    Derandomization of Schuler's Algorithm for SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  11. Inês Lynce, João P. Marques Silva
    On Computing Minimum Unsatisfiable Cores. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  12. Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, Toniann Pitassi
    Combining Component Caching and Clause Learning for Effective Model Counting. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  13. Daniel Sheridan
    The Optimality of a Fast CNF Conversion and its Use with SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  14. Hantao Zhang, Dapeng Li, Haiou Shen
    A SAT Based Scheduler for Tournament Schedules. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  15. Miroslav N. Velev
    Encoding Global Unobservability for Efficient Translation to SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  16. Dave A. D. Tompkins, Holger H. Hoos
    UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  17. Christian Thiffault, Fahiem Bacchus, Toby Walsh
    Solving Non-clausal Formulas with DPLL search. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  18. Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik
    Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  19. Sathiamoorthy Subbarayan, Dhiraj K. Pradhan
    NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  20. Zbigniew Stachniak
    A Note on Satisfying Truth-Value Assignments of Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  21. Carsten Sinz, Wolfgang Küchlin
    Verifying the On-Line Help System of SIEMENS Magnetic Resonance Tomographs using SAT (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  22. Carsten Sinz
    Visualizing the Internal Structure of SAT Instances (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  23. Danila A. Sinopalnikov
    Satisfiability Threshold of the Skewed Random k-SAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  24. Lengning Liu, Miroslaw Truszczynski
    Local Search with Bootstrapping. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  25. Harold S. Connamacher
    A Random Constraint Satisfaction Problem That Seems Hard for DPLL. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  26. Marco Benedetti, Sara Bernardini
    Incremental Compilation-to-SAT Procedures. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  27. Marijn Heule, Hans van Maaren
    Aligning CNF- and Equivalence-reasoning. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  28. Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
    An Algebraic Approach to the Complexity of Generalized Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  29. Olivier Bailleux, Yacine Boufkhad
    Full CNF Encoding: The Counting Constraints Case. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  30. Ravi Gummadi, N. S. Narayanaswamy, Venkatakrishnan Ramaswamy
    Algorithms for Satisfiability using Independent Sets of Variables. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  31. Éric Grégoire, Richard Ostrowski, Bertrand Mazure, Lakhdar Sais
    Automatic Extraction of Functional Dependencies. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  32. Gilles Audemard, Bertrand Mazure, Lakhdar Sais
    Dealing with Symmetries in Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  33. Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea
    A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  34. Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella
    QBF Reasoning on Real-World Instances. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  35. Carlos Ansótegui, Felip Manyà
    Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  36. Shlomo Hoory, Stefan Szeider
    Computing Unsatisfiable k-SAT Instances with Few Occurrences per Variable. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  37. Jinbo Huang, Adnan Darwiche
    Using DPLL for Efficient OBDD Construction. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  38. Hubie Chen, Víctor Dalmau
    Looking Algebraically at Tractable Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  39. Matthew D. T. Lewis, Tobias Schubert, Bernd Becker
    Early Conflict Detection Based BCP for SAT Solving. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  40. Elsa Carvalho, João P. Marques Silva
    Using Rewarding Mechanisms for Improving Branching Heuristics. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  41. Hans Kleine Büning, Xishun Zhao
    Equivalence Models for Quantified Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  42. HoonSang Jin, Fabio Somenzi
    CirCUs: A Hybrid Satisfiability Solver. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  43. Renato Bruni, Andrea Santori
    Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  44. Haixia Jia, Cristopher Moore, Bart Selman
    From Spin Glasses to Hard Satisfiable Formulas. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  45. Yannet Interian
    Approximation Algorithm for Random MAX-kSAT. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  46. Zhuo Huang, Hantao Zhang, Jian Zhang
    Improving First-order Model Searching by Propositional Reasoning and Lemma Learning. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  47. Armin Biere
    Resolve and Expand. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  48. Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
    Detecting Backdoor Sets with Respect to Horn and Binary Clauses. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002