 |
21 elements available | | [ Apologies for multiple copies ]
CALL FOR PARTICIPATION
Third International SAT/SMT Summer School
Aalto University, Otaniemi Campus
Espoo, Finland, July 3-5th, 2013
http://satsmt2013.ics.aalto.fi/
REGISTRATION:
Registration for the school is now open. Applications for student
grants provided by the EU COST Action Rich-Models Toolkit are due
by March 29th, 2013. Full details of the registration procedure are
available at the school website (http://satsmt2013.ics.aalto.fi/).
ABOUT:
The SAT/SMT Summer School aims at providing graduate students and
researchers from universities and industry with a comprehensive
overview of research and methodology in satisfiability testing (SAT)
and satisfiability modulo theories (SMT). The lectures cover the
foundational and practical aspects of SAT and SMT technologies and
their applications.
The third edition follows the schools that took place at MIT (SAT/SMT
Solver Summer School 2011) and at Fondazione Bruno Kessler (SAT/SMT
School 2012) in Trento, Italy. The 16th International Conference on
Theory and Applications of Satisfiability Testing (SAT 2013) is
arranged at University of Helsinki the following week (see
http://sat2013.cs.helsinki.fi/).
The program will feature four lectures per day, with the first two
days dedicated to SAT and SMT, and the last to special topics. Two
of the lectures will be organized as tutorials giving hands-on
experience on SAT/SMT-based modelling.
List of invited lecturers:
Olaf Beyersdorff, Humboldt-Universität zu Berlin, Germany
Alessandro Cimatti, IRST, Trento, Italy
Leonardo de Moura, Microsoft Research, Redmond, USA
John Franco, University of Cincinnati, USA
Enrico Giunchiligia, University of Genova, Italy
Marijn Heule, University of Texas at Austin, USA
Joao Marques-Silva, University College Dublin, Ireland
Albert Oliveras, Technical University of Catalonia, Barcelona, Spain
Stefan Szeider, Vienna University of Technology, Austria
A more detailed program is available at the school website
(http://satsmt2013.ics.aalto.fi/).
Organizing committee:
Keijo Heljanko, Aalto University,
Tomi Janhunen, Aalto University, and
Matti Jarvisalo, University of Helsinki.
|
| |  | |  |
| | |
| |
Sixteenth International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2013 ---
Helsinki, Finland, July 8-12, 2013
http://sat2013.cs.helsinki.fi/
2ND CALL FOR PROPOSALS FOR SOLVER COMPETITIONS
For SAT 2013, proposals for solver competitions are solicited openly.
See the conference web page (above) for details not in this message.
PROPOSAL SUBMISSION DEADLINE: November 2, 2012
Proposals should be submitted by email to sat2013@easychair.org, either in
ASCII text or as an attachment in PDF form, and should include
in sufficient detail the information outlined below.
Proposals with incomplete information may be submitted, in case the deadline
is a bit early. Please indicate in your proposal a plan and/or schedule
for getting the remaining information.
Solver competitions for SAT solvers and their extensions
are a traditional part of the SAT conferences.
The goal is to foster the development of both core SAT solvers as well as
their extensions (including, but not restricted to structural SAT solving,
MaxSAT, MUS computation, QBF, SMT, etc) and SAT-based systems for important
application domains.
Organization of the accepted solver competitions is expected to be
separate from the SAT 2013 conference organization.
The organizers of the accepted competitions are expected to be present
at SAT 2013. Results of the accepted competitions are expected to
be presented during the main conference, and time for these reports will
be allocated within the main conference schedule.
Please provide the following information in your proposal:
+ Competition title.
+ Names and affiliations of organizers.
+ Duration and schedule of the competition.
+ Description of the competition task and the evaluation procedure.
+ Is the competition new or has it been organized before?
In the latter case information on previous competitions should be given.
+ What computing resources are required and how will they be provided?
Should multiple proposals be submitted for similar competitions, possibilities
of combining the competition organizations into one may be considered.
|
| | | | |
| | |
| | | [ We apologize if you receive multiple copies of this call. ]
-------------------------------------------------------------------------
1ST CALL FOR WORKSHOPS, COMPETITIONS, AND TUTORIALS
Sixteenth International Conference on
THEORY AND APPLICATIONS OF SATISFIABILITY TESTING
--- SAT 2013 ---
Helsinki, Finland, July 8-12, 2013
http://sat2013.cs.helsinki.fi/
-------------------------------------------------------------------------
THIS DOES NOT CONTAIN A CALL FOR PAPERS. THAT CALL WILL APPEAR SOON.
-------------------------------------------------------------------------
PROPOSAL SUBMISSION DEADLINE: November 2, 2012
Proposals should be submitted by email to sat2013@easychair.org, either in
ASCII text or as an attachment in PDF form, and should include
in sufficient detail the information outlined below.
Proposals with incomplete information may be submitted, in case the deadline
is a bit early. Please indicate in your proposal a plan and/or schedule
for getting the remaining information.
------------------------------------------------------------------------- |
| | | | |
| | |
|  | |  | | | | | Date: | 05-Sep-2012 | | Title: | ASPCOMP 2013: 4th OPEN Answer Set Programming Competition: Call for Benchmark Problems (EXTENDED DEADLINE)
| | Hits: | 328 | | Contributed by: | Anonymous | | Keywords: | Deduction Rules, DPLL, Minimal models, #P, Computational logic, QBF, Structure of problems, Benchmark, SAT application, Randomised Problem Generation, SAT tools, CSP, Logic, QBF, programming language, General Interest, call for papers, conference information, Non-monotonic reasoning, Satisfiability Modulo Theory, Constraint Programming, SAT/CP, Answer Set Programming, null, null, null, null, null |
| | | |  |  | |
| |
........................................................................
4th OPEN Answer Set Programming Competition 2013
Call for Benchmark Problems
University of Calabria - Vienna University of Technology
Fall/Winter 2012/2013
http://aspcomp2013.mat.unical.it/
........................................................................
The 4th Open Answer Set Programming Competition is open to ASP systems
and *any other system* based on a declarative specification paradigm.
The event is currently finalizing its Call for Benchmarks stage.
== Call for Benchmark Problems ==
Participants will compete on a selected collection of declarative
specifications of benchmark problems, taken from a variety of domains as
well as real world applications, and instances thereof.
These include, but are not limited to:
- Deductive database tasks on large data-sets
- Sequential and Temporal Planning
- Classic and Applicative graph problems
- Puzzles and Combinatorics
- Scheduling, Timetabling, and other resource allocation problems
- Combinatorial Optimization Problems
- Ontology reasoning
- Automated Theorem Proving and Model Checking
- Reasoning tasks over large propositional instances
- Constraint Programming problems
- Other AI problems
We encourage to provide help by proposing and/or devising new challenging
benchmark problems.
The submission of problems arising from applications of practical impact
are strongly encouraged; problems used in the former ASP Competitions,
or variants thereof, can be re-submitted.
Benchmark authors are expected to produce a problem specification and an
instance set (or a generator thereof). The detailed benchmark problems
submission procedure is available at:
http://www.mat.unical.it/aspcomp2013/BenchmarkSubmission.
=== About the ASP Competition Series ===
Answer Set Programming is a well-established paradigm of declarative
programming with close relationship to other declarative modeling
paradigms and languages, such as SAT Modulo Theories, Constraint
Handling Rules, FO(.), PDDL, CASC, and many others.
Since the first informal editions (Dagstuhl 2002 and 2005), ASP systems
compare themselves in the nowadays customary ASP Competition: the 4th
ASP Competition will be run jointly at the University of Calabria
(Italy) and the Vienna University of Technology (Austria), in the first
half of 2013. The event is the sequel to the ASP Competition series,
held at the University of Potsdam (Germany) in 2006-2007, at the
University of Leuven (Belgium) in 2009, and at University of Calabria
(Italy) in 2011. The current competition takes place in cooperation with
the 13th International Conference on Logic Programming and Nonmonotonic
Reasoning (LPNMR 2013), where the results will be announced.
The ASP competition is held as an open tournament. The "Model & Solve"
competition track fosters the spirit of integration among communities,
and is thus open to all types of solvers: ASP systems, SAT solvers, SMT
solvers, CP systems, FOL theorem provers, Description Logics reasoners,
planning reasoners, or any other. The "System" competition track is
instead set up on a fixed language based on the answer set semantics.
== Important Dates ==
* Problem selection stage
- Problem submission deadline: Sep 20th, 2012 (*EXTENDED*)
* Competition stage
- "Model & Solve" submission deadline: Mar 1st, 2013
- "System" submission deadline: Mar 1st, 2013
* Sep 15-19th, 2013
- Announcement of results and awards at LPNMR 2013 - Corunna, Spain
== Further Information ==
For further information please visit the competition web site:
http://aspcomp2013.mat.unical.it/
or contact us by email: aspcomp2013@kr.tuwien.ac.at.
|
| | | | |
| | |
| | | | | | | | Date: | 22-Feb-2012 | | Title: | SAT'12 workshop CFP: CSPSAT'12
| | Hits: | 267 | | Contributed by: | Yael Ben-Haim | | Keywords: | CSP, pseudo boolean optimization, call for papers, Linear Constraints, multi-value, Satisfiability Modulo Theory, Constraint Programming, SAT/CP, SAT/CP Integration, Hybrid solver, Cardinality solving, Pseudo-Boolean Solving, null, null, null, null |
| | | | | | |
| |
*******************************************************************************
* Call for Papers and Participation *
* *
* *
* *
* Second International Workshop on the *
* Cross-Fertilization Between CSP and SAT *
* (CSPSAT'12) *
* *
* *
* *
* in conjunction with SAT 2012 *
* *
* Trento, Italy *
* *
* June 16, 2012 *
* *
* http://sysrun.haifa.il.ibm.com/hrl/cspsat2012/ *
* *
******************************************************************************* |
| | | | |
| | |
| |
-------------------------------------------------------------------------
CALL FOR PARTICIPATION AT THE
Second International SAT/SMT Summer School
Trento, Italy, June 12-15th, 2012
http://satsmtschool2012.fbk.eu/
-------------------------------------------------------------------------
NEWS:
Registration and grant application are now open! The full details are
available at the school website (http://satsmtschool2012.fbk.eu).
Grant application deadline: 15th March 2012
Registration deadline: 6th June 2012
ABOUT:
The SAT/SMT Summer School 2012 (2nd edition) aims at providing graduate
students and researchers from universities and industry with a
comprehensive overview of the research in SAT, SMT, and their
application. The lectures cover the foundational and practical aspects
of SAT and SMT solvers, as well as their application to verification,
planning, scheduling, and optimization problems.
This second edition follows the Summer School of 2011 organized by Vijay
Ganesh at MIT, and is co-located with the SAT 2012 conference. The
school will take place in Trento, Italy, from June 12th to June 15th
2012.
The program will feature four lectures per day, with the first two days
dedicated to SAT and SMT foundations, and the last two to applications
on various domains.
List of speakers:
- Armin Biere (Johannes Kepler University, Linz, Austria)
- Leonardo de Moura (Microsoft Research Redmond, USA)
- Bruno Dutertre (SRI International, USA)
- Martin Fränzle (Carl von Ossietzky Universität Oldenburg, Germany)
- John Franco (University of Cincinnati, USA)
- Silvio Ghilardi (Università di Milano, Italy)
- Patrice Godefroid (Microsoft Research Redmond, USA)
- Holger Hoos (University of British Columbia, Vancouver, Canada)
- Tomi Janhunen (Aalto University, Finland)
- Pete Manolios (Northeastern University, USA)
- Joao Marques-Silva (University College Dublin, Ireland)
- Ken McMillan (Microsoft Research Redmond, USA)
- Jussi Rintanen (Austrialian National University, Australia)
- Fabio Somenzi (University of Colorado, Boulder, USA)
- Gunnar Stålmarck (Prover Technology and Gain Sweden AB, Sweden)
- Cesare Tinelli (University of Iowa, USA)
A more detailed program is available at the school website
(http://satsmtschool2012.fbk.eu).
The school organizers,
Alberto Griggio (griggio@fbk.eu) and
Stefano Tonetta (tonettas@fbk.eu)
|
| | | | |
| | |
| |
The SAT/SMT Summer School 2012 (2nd edition) aims at providing graduate
students and researchers from universities and industry with a
comprehensive overview of the research in SAT, SMT, and their
application. The lectures cover the foundational and practical aspects
of SAT and SMT solvers, as well as their application to verification,
planning, scheduling, and optimization problems.
This second edition follows the Summer School of 2011 organized by Vijay
Ganesh at MIT, and is co-located with the SAT 2012 conference. The
school will take place in Trento, Italy, from June 12th to June 15th
2012.
The program will feature four lectures per day, with the first two days
dedicated to SAT and SMT foundations, and the last two to applications
on various domains.
List of speakers:
- Armin Biere (Johannes Kepler University, Linz, Austria)
- Leonardo de Moura (Microsoft Research Redmond, USA)
- Bruno Dutertre (SRI International, USA)
- Martin Fränzle (Carl von Ossietzky Universität Oldenburg, Germany)
- John Franco (University of Cincinnati, USA)
- Silvio Ghilardi (Università di Milano, Italy)
- Patrice Godefroid (Microsoft Research Redmond, USA)
- Holger Hoos (University of British Columbia, Vancouver, Canada)
- Tomi Janhunen (Aalto University, Finland)
- Pete Manolios (Northeastern University, USA)
- Joao Marques-Silva (University College Dublin, Ireland)
- Ken McMillan (Microsoft Research Redmond, USA)
- Jussi Rintanen (Austrialian National University, Australia)
- Fabio Somenzi (University of Colorado, Boulder, USA)
- Gunnar Stålmarck (Prover Technology and Gain Sweden AB, Sweden)
- Cesare Tinelli (University of Iowa, USA)
A more detailed program is available at the school website
(http://satsmtschool2012.fbk.eu).
It is expected that we will be able to provide a limited number of
grants for students that will attend the school. More details about the
procedure for applying and the registration deadlines will appear on the
school website as soon as possible. Interested students are however
encouraged to contact us at any moment.
The school organizers,
Alberto Griggio <griggio@fbk.eu> and
Stefano Tonetta <tonettas@fbk.eu> |
| | | | |
| | |
| |
The Institute of Cryptography and Security and the Institute of Theoretical Informatics
of Karlsruhe Institute of Technology announce COMPUTING 2011, a symposium devoted to the 75th anniversary of two pioneering works on the theory of computation:
‘On Computable Numbers, with an Application to the Entscheidungsproblem’ by Alan Turing
and ‘An Unsolvable Problem of Elementary Number Theory’ by Alonzo Church.
The symposium will review the work of Church and Turing and its influence on contemporary
Theoretical Computer Science.
Talks at the symposium are intended to cover—among others—topics like
- Different Models of Computing (including, e.g., Parallel, Quantum, and Molecular/DNA Computing),
- Complexity (including Computational and Parameterized Complexity),
- Decidability of various Logical and Computational Systems,
- Termination Analysis,
- Computational Geometry.
The symposium will consist of invited talks given by both established and junior scientists.
COMPUTING 2011 will be co-located with Deduktionstreffen 2011.
More information is available at http://baldur.iti.kit.edu/Computing2011/ .
|
| | | | |
| | |
| | HWMCC'11 follows HWMCC'07, HWMCC'08, and HWMCC'10 as the fourth competitive event for hardware model checkers. It is affiliated to FMCAD'11, October 30 - November 2, Austin, TX, USA.
Our goal is to keep up the driving force in improving model checkers. We also want to motivate implementors to present their work to a broader audience. Last but not least the competition collects realistic benchmarks and makes them available.Researchers from both academia and industry are invited to submit solvers and benchmarks. In the competition all entrants have to solve a set of benchmark instances in AIGER format. For this year we plan to check models with multiple properties and will also have some first experience with liveness properties.
Benchmarks in reasonable formats (AIGER,SMV,BLIF etc.) can be submitted any time.
Please send intentions to submit a model checker and/or first versions by the end of September to Armin Biere. Final versions of model checkers due at the end of first week of October: October 8
For more information please see the webpage |
| | | | |
| | |
| | | CALL FOR PARTICIPATION
SARA 2011
Ninth Symposium on Abstraction, Reformulation, and Approximation
July 17-18, 2011
Parador de Cardona, Spain
(near Barcelona, location of IJCAI 11, July 19-22)
Preliminary Program: http://logic.stanford.edu/sara2011/program.html
Registration: http://logic.stanford.edu/sara2011/cfpart.html
Overview
The ninth Symposium on Abstraction, Reformulation and Approximation will be held on July 17-18, 2011 at the Parador de Cardona in Catalonia, Spain, 60 miles Northwest of Barcelona. The symposium will be co-located with the Symposium on Combinatorial Search (SoCS), which will be held at the Parador de Cardona immediately before SARA. SARA 2011 will be followed by the International Joint Conference on Artificial Intelligence (IJCAI 11), which will be held in Barcelona.
The aim of the Symposium is to provide a forum for interaction among researchers in all areas of Artificial Intelligence and Computer Science with an interest in Abstraction, Reformulation, or Approximation (ARA). Topics include (1) the theory of Abstraction, Reformulation, and Approximation, (2) methods for selecting which of several applicable ARA techniques is best for a given problem, (3) techniques for automatically constructing and selecting appropriate abstractions, reformulations, and approximations, (4) empirical and theoretical studies of the costs and benefits of ARA, and (5) applications of ARA to automated reasoning, automatic programming, cognitive modeling, constraint programming, constraint satisfaction, databases, design, diagnosis, general game playing, general problem solving, machine learning, planning, robotics, scheduling, search, simulation, theorem proving.
Program
The Symposium will consist of paper presentations, discussion sessions, and invited presentations. This year, our keynote speaker will be Stuart Russell from the University of California at Berkeley.
Registration
To register for the symposium, send an email message to the program chairs. You can also register on site, but the organizers would prefer an early email message in order to prepare the logistics for the symposium. |
| | | | |
| | |
| |
Program (subject to last-minute changes)
*09:00-10:40 Design of SAT and QBF systems*
EagleUP: Solving Random 3-SAT using SLS with Unit Propagation
-- Oliver Gableske and Marijn Heule
Reusing the Assignment Trail in CDCL Solvers
-- Peter Van Der Tak, Marijn Heule and Antonio Ramos
Counter Implication Restart
-- Tomohiro Sonobe, Mary Inaba and Ayumu Nagai
Contributions to the Theory of Practical QBF Solving
-- Allen Van Gelder
10:40-11:00 coffee break
*11:00-11:50 Application to Package Dependency Management*
Multi-Criteria Optimization in ASP and its Application to Linux Package
Configuration
-- Martin Gebser, Roland Kaminski, Benjamin Kaufmann and Torsten Schaub
PackUp: Tools for Package Upgradability Solving
-- Mikolas Janota, Ines Lynce, Joao Marques-Silva and Vasco Manquinho
*11:50-12:00 JSAT system description requirements discussion*
- binary vs source code availability
- JSAT hosted vs author's hosted system
12:00-13:30 lunch
*13:30-14:30 Invited talk*
SAT technology at Intel
-- Alexander Nadel
14:30-14:45 coffee break
*14:45-16:00 On the design of Parallel SAT solvers*
SArTagnan - A parallel portfolio SAT solver with lockless physical
clause sharing
-- Stephan Kottler and Michael Kaufmann
Parallel SAT Solving - Using More Cores
-- Norbert Manthey
Deterministic Parallel DPLL: System Description
-- Youssef Hamadi, Said Jabbour, Cedric Piette and Lakhdar Sais
16:00-16:15 brief break
*16:15-17:30 SAT related tools*
Controlling a Solver Execution: the runsolver Tool.
-- Olivier Roussel
The MSUnCore MaxSAT solver
-- Antonio Morgado, Federico Heras and Joao Marques-Silva
TG-Pro: A SAT-based ATPG System
-- Huan Chen and Joao Marques-Silva
To register for the PoS 2011 workshop, visit
http://www.lri.fr/SAT2011/?page=accomodation
The wording on that page and subsequent pages is ambiguous.
You may register for a workshop (and accommodations) without registering
for the SAT 2011 main conference.
Do NOT register for both PoS and the concurrent CSPSAT workshop.
(If you have already registered for SAT 2011, you will need to register for
PoS on site. Please send an email to pos11@easychair.org if you plan to
do this, so we can plan for the number of people to expect.)
Thank you
Daniel Le Berre and Allen Van Gelder
|
| | | | |
| | |
| |
*******************************************************************************
* Call for Papers and Participation *
* *
* First International Workshop on the Cross-Fertilization Between CSP and SAT *
* (CSPSAT'11) *
* *
* in conjunction with SAT 2011 *
* Ann Arbor, Michigan, USA *
* June 18, 2011 *
* http://sysrun.haifa.il.ibm.com/hrl/cspsat2011/ *
*******************************************************************************
|
| | | | |
| | |
| |
CALL FOR PARTICIPATION
PCCR 2010
Parameterized Complexity of Computational Reasoning
Satellite Workshop of MFCS & CSL
Brno, Czech Republic, 28 August 2010
http://www.kr.tuwien.ac.at/drm/pccr2010
This workshop aims to support a fruitful exchange of ideas between the
research on parameterized complexity on one side and the research on various
forms of computational reasoning (such as nonmonotonic, probabilistic, and
constraint-based reasoning) on the other. The workshop features invited
and contributed talks and presentations of surveys and new technical results.
Invited speakers are:
* Mike Fellows, Charles Darwin University
* Nicola Galesi, Sapienza University of Rome
* Gregory Gutin, University of London
* Petr Hlineny, Masaryk University Brno
* Reinhard Pichler, Vienna University of Technology
List of Presentations:
* Mike Fellows: An Overview of Parameterized Complexity and Recent Research
Directions in Constraint Satisfaction and Artificial Intelligence
* Gregory Gutin, Keynote Talk: Complexity of Permutation Constraint Satisfaction
Problems Parameterized Above Average
* Petr Hlineny: Where Myhill-Nerode Theorem meets Parameterized Algorithmics
* Reinhard Pichler: Bounded Treewidth in Non-Monotonic Reasoning
* M. Praveen: Does Treewidth Help in Modal Satisfiability?
* Fran Rosamond: On the Complexity of Some Constraint Satisfaction Problems with
Global Constraints and Convexity
* Nicola Galesi: The Complexity of Proofs in Parameterized Resolution
* Yijia Chen: Optimal Proof Systems, Slicewise Monotone Parameterized Problems,
and Logics for PTIME
For the schedule of the talks, see http://www.kr.tuwien.ac.at/drm/pccr2010/
For information on how to register and local information please consult the
MFCS-CSL 2010 web-site http://mfcsl2010.fi.muni.cz/
The workshop is organized by Igor Razgon, Marko Samer, Stefan Szeider (chair),
and Stefan Woltran.
|
| | | | |
| | |
| | | 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 |
| | | | |
| | |
| |
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/
|
| | | | |
| | |
| |
---------------------------------------------------------------------
SAT 2010 - 13th International Conference on
Theory and Applications of Satisfiability Testing
Edinburgh, UK, July 11-14, 2010
http://ie.technion.ac.il/SAT10/
as part of FLoC 2010 - Federated Logic Conference
http://www.floc-conference.org/
Call for Participation
---------------------------------------------------------------------
SAT is the primary annual meeting for researchers studying the
propositional satisfiability problem. The technical programme will
consist of presentations of high-quality original research papers, a
tutorial presentation, several invited talks, and presentations of
solver competition results.
Registration, accommodation, and travel/visa information for all FLoC
conferences and workshops is on the FLoC 2010 web pages.
DEADLINES:
Early registration deadline: 17 May 2010
Standard registration: 18 May 2010 - 30 June 2010
Late registration: after 30 June 2010
TECHNICAL PROGRAMME
Presentation of 2 invited SAT talks
Presentation of 4 plenary/keynote FLoC invited talks
Presentation of 35 technical research papers
Presentation of 3 solver competitions
SAT INVITED SPEAKERS
Yehuda Naveh, IBM Haifa Research Lab, Israel
Ramamohan Paturi, University of California, USA
FLoC PLENARY AND KEYNOTE SPEAKERS
David Harel, Weizmann Institute of Science, Israel
Gordon Plotkin, University of Edinburgh, UK
Georg Gottlob, University of Oxford, UK
J Strother Moore, University of Texas, USA
SAT INVITED TUTORIAL SPEAKER
Daniel Kroening, University of Oxford, UK
SAT AFFILIATED COMPETITIONS
MAX-SAT Evaluation 2010
Pseudo-Boolean Competition 2010
SAT-Race 2010
SAT AFFILIATED WORKSHOPS
PPC 2010 - Propositional Proof Complexity (July 9)
POS 2010 - Pragmatics of SAT (July 10)
LoCoCo 2010 - Logics for Component Configuration (July 10)
SMT 2010 - Satisfiability Modulo Theories (with CAV, July 14-15)
LaSh 2010 - Logic and Search (with ICLP, July 15)
SOCIAL EVENTS
Drinks Reception - July 11 at Edinburgh Castle
Conference Banquet - July 13 at "Our Dynamic Earth"
PROCEEDINGS
At registration the proceedings of all FLoC conferences and workshops
will be provided, at no additional cost, on a USB stick. Hard copy SAT
2010 proceedings are optionally available, for an additional
cost. Remember to tick the hard copy proceedings box when you register.
Please note that hard copies are offered at approximately 50% discount
during registration and will possibly not be on sale later on or during
the conference.
REGISTRATION
For on line registration for SAT, please follow the link on the FLoC
website at http://floc-conference.org/registration.html
ACCOMMODATION
Very affordable accommodation can be booked via the FloC registration,
see http://floc-conference.org/accommodation.html
|
| | | | |
| | |
| | Please join us for the Twelfth International Conference on the
Principles of Knowledge Representation and Reasoning (KR 2010), to be
held May 9-13, 2010 at The Sutton Place Hotel, in Toronto, Ontario,
Canada.
The deadline for registration is April 9th!
KR 2010 will be co-located with AAMAS, FOIS, ICAPS, and NMR. Options for cross-registration are
available. |
| | | | |
| | |
| | The fifth competition of pseudo-Boolean solvers is organized as a special event of the SAT 2010 conference. Like the previous evaluations and competitions, the goal is to assess the state of the art in the field of pseudo-Boolean solvers.
The 2010 competition is very similar to the 2009 edition, with 2 exceptions:
- non linear objective functions are allowed
- a special track and a new format are dedicated to maximum satisfiability and weighted max-satisfiability on PB constraints
We encourage you to submit solvers and/or benchmarks to the competition by May 9.
All details are available on the competition web site:
http://www.cril.univ-artois.fr/PB10/ |
| | | | |
| | |
| | CROCS-09 submission deadline extended to August 23, 2009
Call for Papers, Abstracts, and Discussion Topics: CROCS 2009, the First International Workshop on Constraint Reasoning and Optimization for Computational Sustainability, September 20, 2009, Lisbon, Portugal
To be held in conjunction with CP-09, the 15th International Conference on Principles and Practice of Constraint Programming.
For more information on this workshop as well as the newly emerging interdisciplinary field of computational sustainability, please visit http://www.computational-sustainability.org/crocs09.
Best,
Ashish |
| | | | |
| | |
| | | Call for Papers, Abstracts, and Discussion Topics: CROCS 2009
First International Workshop on Constraint Reasoning and Optimization
for Computational Sustainability
September 20, 2009, Lisbon, Portugal
To be held in conjunction with CP-09, the 15th International
Conference on Principles and Practice of Constraint Programming.
For more information on this workshop as well as the newly emerging interdisciplinary field of computational sustainability, please visit http://www.computational-sustainability.org/crocs09.
Best,
Ashish |
| | | | |
| | |
© 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.
|
|
|
