Deadline Countdown

Heads up on SAT research

SAT related books

Other SAT related sites

Date: 26-Nov-2006 Title: Special issue of JSAT on CFV Hits: 2111 Contributed by: Miroslav Velev Keywords: Deduction Rules, BMC, DPLL, DP, Minimal models, Intelligent Backtracking, #P, Data structure, Quasigroups, Local Search, Repository, BDD, Random 3SAT, Stalmark, Complexity, Randomization, Computational logic, MAC, FC, Verification, Alternative approach, QBF, Structure of problems, EDA, Benchmark, SAT application, Equivalency Reasoning, Randomised Algorithms, Randomised Problem Generation, Instance simplification, Learning, Model Elimination, Satisfiable Problems Generation, SAT tools, Distributed Computing, CSP, Logic, branching heuristics, instance database, threshold conjecture, phase transition, binary clause reasoning, QBF, Dynamic restarts, resolution complexity, message-passing algorithm, Linear Programming, programming language, pseudo boolean optimization, variable ordering heuristic, preprocessors, MAXSAT, distributed parallel dynamic learning, Preprocessing, Unit Propagation, symmetry, General Interest, Cellular Automata, Cellection Framework, call for papers, semidefinite programming, conference information, Genetic Algorithm, Boolean functions, SAT-Based, Linear Constraints, SAT Hardware, Lookahead, Generative SAT library, multi-value, Stochastic Satisfiability, Divide-and-Conquer Algorithms, Non-monotonic reasoning, implicativity, stable set of points, stable set of clusters, Satisfiability Modulo Theory, Constraint Programming, genetic programming, SAT/CP, bioinformatics, resolution determinization, SAT-solver, SAT/CP Integration, Hybrid solver, Visualisation, Pseudo-Boolean Solving, Resolution proof         Dear Colleague, We would like to invite you to submit a paper to the special issue of the Journal on Satisfiability, Boolean Modeling and Computation (JSAT) on the topic of application of constraints to formal verification (CFV). The submission deadline is January 10, 2007. Topics include, but are not limited to, the following: - application of constraint solvers to hardware verification; - application of constraint solvers to software verification; - dedicated solvers for formal verification problems; - tuning SAT for formal verification and testing; - challenging formal verification problems. The submissions have to be in the JSAT format: http://www.isa.ewi.tudelft.nl/Jsat/ and have to be e-mailed to: mvelev@gmail.com If possible, please confirm your intent to submit a paper. We look forward to your submission, Miroslav Velev and Joao Marques-Silva Editors of the special issue of JSAT on CFV

Date: 30-Jun-2005 Title: Java package for conversion into SAT problem. Hits: 4091 Contributed by:       Date: 24-May-2005 Title: Research assistant position for satisfiability research Hits: 1890 Contributed by: Oliver Kullmann Keywords: New research position, Generative SAT library         Hello, at http://www.swan.ac.uk/personnel/vacancies/index.htm under "Post Reference M0385" (Research Vacancies Computer Science) you find the advertisement for a one-year research position in my group (at the University of Wales Swansea, UK). The position is part of a three-year project for the development of a generative C++ library for (generalised) SAT solving (including CSP and generalisations). The position was originally a two-year position, but the person appointed turned out not to be the right person, so it is advertised again, now (unfortunately) only for one year. I hope we will be (very) successful, and that based on this we can find additional funding in case you want to extend the position, but (of course) this cannot be guaranteed. Originally the most important qualification of an applicant was very strong knowledge about modern (!) C++. If you are fluent with generic programming and template meta-programming, you use Boost daily, and even generative programming is not unknown to you, then you are still very(!) welcome. If not, then, due to only one year left for the position, if you have a strong research agenda, you are welcome as well (and we will see what happens with your programming skills; yet I'm prepared to do all the programming myself). Please contact me if you think the position might be right for you. Formally required is only a degree equivalent to a bachelor (i.e., not much), but in most cases a better education would be really needed to fill the position. But if you are not sure, then please contact me and tell me about you! According to my experience now, the most important requirement for the position is that you aim high. I try my best to fill out the role of the made scientist, and if you are more of a "good enough" person, then this will lead to problems (this was basically the main problem with the first appointment for this position). And also a good dose of abstract thinking is required. If you want to start an international career (or continue it somewhat further), then I hope this position is a good choice for you. With best wishes Oliver Kullmann -- Dr. Oliver Kullmann Computer Science Department University of Wales Swansea Faraday Building, Singleton Park Swansea SA2 8PP, UK http://cs-svr1.swan.ac.uk/~csoliver/         © 2000-2001 Business & Technology Research Laboratory. © 2001-2005 Centre de Recherche en Informatique de Lens. Hosted by Innovation and Technology Research Lab. Please send any comment to daniel@satlive.org.