 |
Welcome to SAT Live!
If you are a newcomer to the SATisfiability problem, you might want to take a look at wikipedia's page on the boolean satisfiability problem first. You might also find those surveys of interest. For a deeper insight of the current interest on SAT solvers for software and hardware verification, Armin Biere's course on formal systems is a good start. Eugene Goldberg has also a nice and somehow non standard way of introducing modern SAT solvers in his three part course on SAT. Finally, Joao Marques-Silva wrote a nice article on practical applications of boolean satisfiability.
Looking for a SAT solver to play with? the following open source SAT solvers might be a good start: Minisat (C++), Picosat (C), SAT4J (Java). If you are looking for a stochastic local search framework for SAT, you should take a look at UBCSAT.
You can take a look at all the current links,
see the links classified by keywords or add your
own reference (you must be subscribed to SAT Live! or propose it as
anonymous).
If you don't have some links to propose for now
but would like email notification of new additions to the repository,
you can subscribe to the SAT Live!
notification list or register to the site RSS feed (courtesy of Christian Muise, using Dapper).
Finally, a page with some
people interested by the SATisfaction problem is also available.
Last 10 new entries
674 elements available | | | This paper presents a new SAT algorithm that has the full power of extended resolution. Empirical results on an initial implementation indicate that very substantial, although at this stage not necessarily consistent, improvement can be observed. |
| |  | |  |
|  | |
 | | | Call for papers for CROCS at CP-10, the 3rd International Workshop on Constraint Reasoning and Optimization for Computational Sustainability, to be held on September 6, 2010 in St Andrews, Scotland, in conjunction with the CP-10 conference.
For submission and other details, please see http://www.computational-sustainability.org/crocs-at-cp10 |
| |  | |  |
|  | |
 | | An article on "Parallel SAT Solving on Peer-to-Peer Desktop Grids" has been published in the Journal of Grid Computing (Springer).
Abstract
"Satciety is a distributed parallel satisfiability (SAT) solver which focuses on tackling the domain-specific problems inherent to one of the most challenging environments for parallel computing - Peer-to-Peer Desktop Grids. Satciety efficiently addresses issues related to resource volatility and heterogeneity, limited node and network capabilities, as well as non-uniform communication costs. This is achieved through a sophisticated distributed task pool execution model, problem size reduction through multi-stage SAT formula preprocessing, context-aware memory management, and adaptive topology-aware distributed dynamic learning. Despite the demanding conditions prevailing in Desktop Grids, Satciety achieves considerable speedups compared to state-of-the-art sequential SAT solvers." |
| |  | |  |
|  | |
 | | | The Vienna University of Technology is offering 10 PhD
student positions within the doctoral program
"Mathematical Logic in Computer Science"
which is launched in Fall 2010; five of the positions are reserved for
female applicants.
Further details about the program and the application procedure are
available at http://www.dbai.tuwien.ac.at/drkolleg/.
For additional information, please send email to
dk-info@dbai.tuwien.ac.at |
| |  | |  |
|  | |
 | | | The results of the Pseudo Boolean evaluation have been disclosed.
The will be a new evaluation next year. |
| |  | |  |
|  | |
 | | | The results of the MAXSAT 2010 evaluation have just been disclosed.
There will be a new evaluation next year. |
| |  | |  |
|  | |
 | | | The results of the SAT Race 2010 have just been disclosed! |
| |  | |  |
|  | |
 | | | Niklas Sorensson just released Minisat 2.2 today, during the SAT conference.
The source code is now available in a public GIT repository. |
| |  | |  |
|  | |
 | |
JELIA 2010 CALL FOR PARTICIPATION
=================================
12th European Conference on Logics in Artificial Intelligence
Helsinki, Finland, September 13-15, 2010
http://jelia2010.tkk.fi/
Logics provide a formal basis and key descriptive notation for the study
and development of applications and systems in Artificial Intelligence
(AI). With the depth and maturity of formalisms, methodologies, and
systems today, such logics are increasingly important. The European
Conference on Logics in Artificial Intelligence (or Journées Européennes
sur la Logique en Intelligence Artificielle --- JELIA) began back in
1988, as a workshop, in response to the need for a European forum for
the discussion of emerging work in this field. Since then, JELIA has
been organized biennially, with English as the official language, and
with proceedings published in Springer-Verlag's Lecture Notes in
Artificial Intelligence series. In 2010 the conference is organized for
the first time in Scandinavia, following previous meetings mainly taking
place in Central and Southern Europe (see the general website
http://www.jelia.eu/ for details). The increasing interest in this
forum, its international level with growing participation from
researchers outside Europe, and the overall technical quality, has
turned JELIA into a major biennial forum for the discussion of
logic-based approaches to AI.
Registration and Travel Information
===================================
Registration as well as travel and accommodation information is
available on JELIA 2010 web pages http://jelia2010.tkk.fi/
JELIA 2010 Registration Fees
Early (until Aug 9) Late (Aug 10 - Sep 1)
Regular 250 EUR 400 EUR
Student 150 EUR 250 EUR
including JELIA 2010 technical sessions and invited talks, coffee
breaks, the combined JELIA/PGM welcome reception on September 13,
conference Banquet and excursion on September 14, JELIA 2010 LNAI
conference proceedings, and conference accessories (bag, programme,
info, ...)
Scientific Program
==================
The scientific program consists of three invited talks, 26 regular
papers, and 5 system descriptions. See details in the preliminary
program at http://jelia2010.tkk.fi/schedule.shtml
Invited Speakers
================
Gerhard Brewka (http://www.informatik.uni-leipzig.de/~brewka/):
Nonmonotonic Tools for Argumentation
Adnan Darwiche (http://www.cs.ucla.edu/~darwiche/):
Relax, Compensate and then Recover:
A Theory of Anytime, Approximate Inference
Stéphane Demri (http://www.lsv.ens-cachan.fr/~demri/):
Counter Systems for Data Logics
Venue
=====
The conference will be held in the main building of University of
Helsinki, located in the center of Helsinki. Founded in 1550, Helsinki
has been the Finnish capital since 1812, when it was rebuilt in the
Empire style by the orders of the Czar of Russia, hence sharing
architectural similarities with St. Petersburg even today. Located on
the Baltic peninsula centrally between the east and the west, Helsinki
"the Daughter of the Baltic" is a city full of contrasts: light and
white in summer while dark but full of warmth in winter, with a
combination of high-tech, contemporary design, and ever-present nature.
Finnish design has made Helsinki world famous, and recently Helsinki
was appointed World Design Capital 2012.
Co-located events
=================
European Workshop on Probabilistic Graphical Models (PGM)
http://www.helsinki.fi/pgm2010/
|
| |  | |  |
|  | |
 | | | The list of solvers qualified for the SAT Race 2010 is now available.
The result of the SAT Race will be disclosed during the SAT conference, July 11-14 2010, in Edinburgh. |
| |  | |  |
|  | |
more...
© 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.
|
 |