 |
25 elements available | |
======================================================================
SMT Workshop 2013
11th International Workshop on Satisfiability Modulo Theories
Affiliated with SAT 2013, Helsinki, Finland
July 8th - 9th, 2013
http://smt2013.fbk.eu
--- 3rd CALL FOR PAPERS---
======================================================================
Background
----------
Determining the satisfiability of first-order formulas modulo
background theories, known as the Satisfiability Modulo Theories (SMT)
problem, has proved to be an enabling technology for verification,
synthesis, test generation, compiler optimization, scheduling, and
other areas. The success of SMT techniques depends on the development
of both domain-specific decision procedures for each background theory
(e.g., linear arithmetic, the theory of arrays, or the theory of
bit-vectors) and combination methods that allow one to obtain more
versatile SMT tools, usually leveraging Boolean satisfiability (SAT)
solvers. These ingredients together make SMT techniques well-suited
for use in larger automated reasoning and verification efforts.
Aims and Scope
--------------
The aim of the workshop is to bring together researchers and users of
SMT tools and techniques. Relevant topics include but are not limited to:
* Decision procedures and theories of interest
* Combinations of decision procedures
* Novel implementation techniques
* Benchmarks and evaluation methodologies
* Applications and case studies
* Theoretical results
Papers on pragmatic aspects of implementing and using SMT tools, as well
as novel applications of SMT, are especially encouraged.
Important dates
---------------
* Submission deadline - April 14th, 2013
* Notification - May 12th, 2013
* Camera ready versions due - May 19th, 2013
* Workshop - July 8th and 9th, 2013
Paper submission and Proceedings
--------------------------------
Three categories of submissions are invited:
* Extended abstracts: given the informal style of the workshop, we
strongly encourage the submission of preliminary reports of work in
progress. They may range in length from very short (a couple of
pages) to the full 10 pages and they will be judged based on the
expected level of interest for the SMT community. They will be
included in the informal proceedings.
* Original papers: contain original research (simultaneous submissions
are not allowed) and sufficient detail to assess the merits and
relevance of the submission. For papers reporting experimental
results, authors are strongly encouraged to make their data
available.
* Presentation-only papers: describe work recently published or
submitted and will not be included in the proceedings. We see this
as a way to provide additional access to important developments that
SMT Workshop attendees may be unaware of.
Papers in all three categories will be peer-reviewed. Papers should
not exceed 10 pages (Postscript or PDF) and should be in
standard-conforming Postscript or PDF. Technical details may be
included in an appendix to be read at the reviewers' discretion.
Final versions should be prepared in LaTeX using the easychair.cls
class file.
To submit a paper, go to the EasyChair SMT page
http://www.easychair.org/conferences/?conf=smt2013 and follow the
instructions there.
Program Committee
-----------------
* Roberto Bruttomesso (Atrenta), co-chair
* Morgan Deters (New York University)
* Bruno Dutertre (SRI)
* Pascal Fontaine (Loria, INRIA, University of Nancy)
* Malay Ganai (NEC Labs America)
* Alberto Griggio (FBK), co-chair
* Sava Krstic (Intel Corporation)
* Zvonimir Rakamaric (University of Utah)
* Silvio Ranise (FBK)
* Philipp Ruemmer (Uppsala University)
* Ofer Strichman (Technion)
* Cesare Tinelli (The University of Iowa)
* Christoph M. Wintersteiger (Microsoft Research)
Invited Speakers
----------------
Sylvain Conchon Université Paris-Sud
Thomas Sturm Max-Planck-Institut für Informatik
|
| |  | |  |
| | |
| |
IPEC 2013
The 8th International Symposium on
Parameterized and Exact Computation
Sophia Antipolis, France
September 4-6, 2013
http://www.kr.tuwien.ac.at/ipec2013/
IPEC 2013 covers research in all aspects of parameterized/exact
algorithms and complexity. Papers presenting original research in
the area are sought, including but not limited to: new techniques
for the design and analysis of parameterized and exact
algorithms, fixed-parameter tractability results, parameterized
complexity theory, relationship between parameterized complexity
and traditional complexity classifications, applications of
parameterized and exact computation, and implementation issues of
parameterized and exact algorithms. In particular, studies on
parameterized and exact computations for real-world applications
and algorithmic engineering are especially encouraged.
IPEC 2013 will be part of ALGO 2013, which also hosts ESA 2013
and a number of more specialized conferences and workshops. ALGO
2013 will take place September 2-6, 2013, Sophia Antipolis,
France
Authors are invited to submit an extended abstract in English no
longer than 12 pages using at least 11-point font, preferably in
LNCS-style, describing original unpublished
research. Simultaneous submission to other conferences with
published proceedings is not permitted. Additional details as
necessary may be included in a clearly marked appendix that will
be read at the discretion of the program committee. Authors must
submit their papers electronically. A detailed description of the
electronic submission process will be made available at the
symposium website. Program committee members (except the
co-chairs) are allowed to submit papers.
Accepted papers are expected to be published in the symposium
proceedings in the Springer series Lecture Notes in Computer
Science. Authors of accepted papers are expected to present their
work at the symposium, and to incorporate the comments from the
program committee.
The program committee may award an Excellent Student Paper Award
to one or more papers accepted to the symposium. A paper is
eligible for the award if all authors are students at the time of
submission, where a student is someone who has not been awarded a
PhD before the paper submission deadline.
Invited speakers will be announced later.
IMPORTANT DATES
Abstract Submission: June 12, 2013
Paper Submission: June 15, 2013
Notification of Acceptance: 13 July, 2013
Symposium: September 4-6, 2013
PROGRAM COMMITTEE
Faisal Abu-Khzam
Andreas Björklund
Rod Downey
Mike Fellows
Serge Gaspers
Gregory Gutin (co-chair)
Pinar Heggeneres
Eun Jung Kim
Christian Komusiewicz
Daniel Lokshtanov
Venkatesh Raman
Peter Rossmanith
Stefan Szeider (co-chair)
Anders Yeo
|
| | | | |
| | |
|  | |  | | | | | Date: | 12-Jan-2013 | | Title: | [CfP] 4th *OPEN* Answer Set Programming Competition 2013 - CALL FOR PARTICIPANTS - https://www.mat.unical.it/aspcomp2013/
| | Hits: | 303 | | Contributed by: | Anonymous | | Keywords: | Deduction Rules, DPLL, DP, Minimal models, Intelligent Backtracking, Complexity, Computational logic, QBF, Structure of problems, Benchmark, SAT application, Logic, Non-monotonic reasoning, null |
| | | |  |  | |
| |
[apologies for any cross-posting]
---
4th OPEN Answer Set Programming Competition 2013
Call for Participant Systems
University of Calabria - Vienna University of Technology
Fall/Winter 2012/2013
http://aspcomp2013.mat.unical.it/
aspcomp2013@kr.tuwien.ac.at
---
The 4th Open Answer Set Programming (ASP) Competition is now in the Call
for Participant Systems stage.
+--------------------------------------------------------------------+
| The event is open to ASP systems and *any other* system based on a |
| declarative specification paradigm. |
+--------------------------------------------------------------------+
== Call for Participant Systems ==
Participants of the Answer Set Programming Competition will compete on a
selected collection of benchmark problems, taken from a variety of
benchmark problem domains as well as real world applications. These
include, but are not limited to:
* Classic and applicative graph problems
* Scheduling, Timetabling, and other resource allocation problems
* Sequential and Temporal Planning
* Combinatorial Optimization Problems
* Deductive database tasks on large data-sets
* Puzzles and Combinatorics
* Ontology reasoning
* Automated Theorem Proving and Model Checking
* Reasoning tasks over large propositional instances
* Constraint Programming problems
* Other AI problems
The competition consists of two independent main tracks:
* the Model & Solve Track invites any researcher and developer of
declarative knowledge representation systems to participate in an
open challenge for solving sophisticated AI problems with their tools
of choice. Participants submit a solver based on an arbitrary input
format and declarative specifications of the Competition's benchmark
domains;
* the System Track compares dedicated answer set solvers on ASP
benchmarks. Participants compete with a solver for a standard ASP
language.
We encourage to submit parallel and portfolio systems exploiting
multiple cores or multiple algorithms for solving the given instances.
== Important Dates ==
* February 2nd, 2013: Participant registration deadline
* March 1st, 2013: Participant system submission deadline
* March 2nd, 2013: System freeze, the competition runs
* September 15-19, 2013: Announcement of results and award presentation
at LPNMR 2013 in Corunna, Spain
For further information and submission instructions please visit the
competition web site
http://aspcomp2013.mat.unical.it/
or contact us by email: aspcomp2013@kr.tuwien.ac.at
|
| | | | |
| | |
| |
16th Int'l Conf. on THEORY AND APPLICATIONS OF SATISFIABILITY TESTING (SAT 2013)
Helsinki, Finland, July 8-12, 2013
http://sat2013.cs.helsinki.fi/
1st CALL FOR PAPERS (SUMMARY)
See http://sat2013.cs.helsinki.fi/cfp.html for the complete call.
-------------------------------------------------------------------------
The International Conference on Theory and Applications of
Satisfiability Testing (SAT) is the primary annual meeting for
researchers studying the theory and applications of the propositional
satisfiability problem, broadly construed. Besides plain propositional
satisfiability, it includes Boolean optimization (including MaxSAT and
Pseudo-Boolean (PB) constraints), Quantified Boolean Formulas (QBF),
Satisfiability Modulo Theories (SMT), and Constraint Programming (CP)
for problems with clear connections to Boolean-level reasoning.
Many hard combinatorial problems can be encoded as SAT instances, in the
broad sense mentioned above, including problems in formal verification
(hardware and software), artificial intelligence, and operations research.
More recently, biology, cryptology, data mining, machine learning, and
mathematics have been added to the growing list.
The SAT conference aims to further advance the field by soliciting original
theoretical and practical contributions in these areas with a clear
connection to satisfiability.
SAT 2013 takes place in Helsinki, the capital of Finland. Helsinki is a
vibrant Scandinavian and international city with a lot to offer to visitors.
It is also well known for providing a high quality of living and design
on the global scale.
PROGRAM COMMITTEE
=================
See http://sat2013.cs.helsinki.fi/organization.html .
IMPORTANT DATES
===============
(Follow http://sat2013.cs.helsinki.fi/ for updates.)
February 1: Abstract Submission
February 8: Paper Submission
March 18 (approx.): Response from Authors begins, lasts 72 hours
April 3: Acceptance Notifications
April 22: Final Camera-Ready Versions
July 8: Workshops begin
July 9-12: Main Conference
SCOPE
=====
SAT 2013 welcomes scientific contributions addressing different aspects of
the satisfiability problem. interpreted in a broad sense. Domains include
MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulae (QBF),
Satisfiability Modulo Theories (SMT), Constraint Satisfaction Problems (CSP).
Topics include (but are not restricted to)
Theoretical advances (including exact algorithms, proof complexity, and
other complexity issues);
Practical search algorithms;
Knowledge compilation;
Implementation-level details of SAT solving tools and SAT-based systems;
Problem encodings and reformulations;
Applications (including both novel applications domains and
improvements to existing approaches);
Case studies and reports on insightful findings based on rigorous
experimentation.
OUT OF SCOPE
============
Papers claiming to resolve a major long-standing open theoretical
question in mathematics or computer science (such as those for which a
Millennium Prize is offered, see http://www.claymath.org/millennium)
are outside the scope of the conference because there is insufficient
time in the schedule to referee such papers; instead, such papers
should be submitted to an appropriate technical journal.
SUBMISSIONS
===========
Submissions to SAT 2013 are solicited in three paper categories, describing
original contributions:
REGULAR PAPERS (9 to 15 pages, excluding references)
SHORT PAPERS (up to 8 pages, excluding references)
TOOL PAPERS (up to 6 pages, excluding references)
Submissions should not be under review elsewhere nor be submitted elsewhere
while under review for SAT 2013, and should not consist of previously
published material.
All accepted papers will be published in the proceedings of the conference,
which will be published within the Springer LNCS series.
|
| | | | |
| | |
| | | | | | | | Date: | 22-Feb-2012 | | Title: | SAT'12 workshop CFP: CSPSAT'12
| | Hits: | 266 | | 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/ *
* *
******************************************************************************* |
| | | | |
| | |
| | | | | | | | Date: | 03-Feb-2012 | | Title: | SMT Workshop 2012
| | Hits: | 228 | | Contributed by: | Roberto Bruttomesso | | Keywords: | Satisfiability Modulo Theory, SAT/CP Integration, null, null, null, null, null, null, null, null, null, null |
| | | | | | |
| |
======================================================================
SMT Workshop 2012
10th International Workshop on Satisfiability Modulo Theories
Affiliated with IJCAR’2012, Manchester, UK
June 30th - July 1st, 2012
Collocated with The Alan Turing Centenary Conference
http://smt2012.loria.fr
---CALL FOR PAPERS---
======================================================================
Background
----------
Determining the satisfiability of first-order formulas modulo
background theories, known as the Satisfiability Modulo Theories (SMT)
problem, has proved to be an enabling technology for verification,
synthesis, test generation, compiler optimization, scheduling, and
other areas. The success of SMT techniques depends on the development
of both domain-specific decision procedures for each background theory
(e.g., linear arithmetic, the theory of arrays, or the theory of
bit-vectors) and combination methods that allow one to obtain more
versatile SMT tools, usually leveraging Boolean satisfiability (SAT)
solvers. These ingredients together make SMT techniques well-suited
for use in larger automated reasoning and verification efforts.
Aims and Scope
--------------
The aim of the workshop is to bring together researchers and users of
SMT tools and techniques. Relevant topics include but are not limited to:
* Decision procedures and theories of interest
* Combinations of decision procedures
* Novel implementation techniques
* Benchmarks and evaluation methodologies
* Applications and case studies
* Theoretical results
Papers on pragmatic aspects of implementing and using SMT tools, as well
as novel applications of SMT, are especially encouraged.
Important dates
---------------
* Submission deadline - April 16th, 2012
* Notification - May 7th, 2012
* Camera ready versions due - May 28th, 2012
* Workshop - June 30th and July 1st, 2012
Paper submission and Proceedings
--------------------------------
Three categories of submissions are invited:
* Extended abstracts: given the informal style of the workshop, we
strongly encourage the submission of preliminary reports of work in
progress. They may range in length from very short (a couple of
pages) to the full 10 pages and they will be judged based on the
expected level of interest for the SMT community. They will be
included in the informal proceedings.
* Original papers: contain original research (simultaneous submissions
are not allowed) and sufficient detail to assess the merits and
relevance of the submission. For papers reporting experimental
results, authors are strongly encouraged to make their data
available.
* Presentation-only papers: describe work recently published or
submitted and will not be included in the proceedings. We see this
as a way to provide additional access to important developments that
SMT Workshop attendees may be unaware of.
Papers in all three categories will be peer-reviewed. Papers should
not exceed 10 pages (Postscript or PDF) and should be in
standard-conforming Postscript or PDF. Technical details may be
included in an appendix to be read at the reviewers' discretion.
Final versions should be prepared in LaTeX using the easychair.cls
class file.
To submit a paper, go to the EasyChair SMT page
http://www.easychair.org/conferences/?conf=smt2012 and follow the
instructions there.
|
| | | | |
| | |
| |
Reminder: CSPSAT'11: Abstracts due April 17; Full papers on April 24
*******************************************************************************
* 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 Papers and Participation *
* *
* Workshop on incomplete techniques for proving UNSAT *
* (INCSAT'11) *
* *
* in conjunction with SAT 2011 *
* Ann Arbor, Michigan, USA *
* June 23, 2011 *
* http://www.cril.univ-artois.fr/~audemard/incsat/ *
*******************************************************************************
|
| | | | |
| | |
| |
*******************************************************************************
* 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 PAPERS:
34th IEEE Software Engineering Workshop (SEW-34)
20-21 June 2011
Limerick, Ireland
http://www.seworkshop.org
Co-located with
17th International Symposium on Formal Methods (FM 2011)
http://fm2011.lero.ie
Sponsored by IEEE Computer Society, Technical Council on Software Engineering
(pending).
Background
The 34th IEEE Software Engineering Workshop, the longest continually
running Software Engineering event in the world, will be held at the University
of Limerick, Ireland, collocated with FM2011.
Scope
The workshop aims to bring together all those with an interest in software
engineering. Traditionally, the conference attracts industrial and government
practitioners and academics pursuing the advancement of software engineering
principles and techniques. The workshop provides a forum for reporting on past
experiences, for describing new and emerging results and techniques, and for
exchanging ideas on best practice and future directions.
Topics of interest include, but are not limited to:
• Metrics and experience reports
• Software quality assurance
• Formal methods and formal approaches to software development
• Software engineering processes and process improvement
• CMM and CMMI
• Requirements engineering
• Software architectures
• Real-time Software Engineering
• Software maintenance, reuse, and legacy systems
• Agent-based software systems
• Self-managing systems
Submissions
Long papers (maximum 10 pages in IEEE format) and short
industrial/governmental experience reports (maximum 5 pages in IEEE format)
are sought for inclusion in the conference program and publication in
the postproceedings,
which will be published by IEEE CS Press (see
http://www.ieee.org/web/publications/pubservices/confpub/AuthorTools/confer
enceTemplates.html for paper formatting instructions). All submissions will be
reviewed for originality, relevance, and technical detail. At least
one author per
paper will be required to register and present at the workshop. Papers not
presented will not be included in the proceedings.
All submissions must be made in electronic format (.doc, .pdf, or .ps formats
only), via the conference electronic submission site at
http://ls5ocs.cs.tudortmund.
de/ocs/en/home/SEW-2011.
Publication
All accepted papers will be published in the conference post proceedings,
published by IEEE CS Press. Some authors will also be invited to submit a
revised version of their paper for inclusion in Innovations in Systems and
Software Engineering: A NASA Journal (Springer).
Important Dates
1 February 2011 Long and short papers due
20 April 2011 Notification to authors
20-21 June 2011 SEW in Limerick
15 September 2011 Final papers due for Post-Proceedings |
| | | | |
| | |
| | 12th European Conference on Logics in Artificial Intelligence
Helsinki, Finland, September 13-15, 2010
http://jelia2010.tkk.fi/
The aim of JELIA 2010 is to bring together active researchers interested in all aspects concerning the use of logics in Artificial Intelligence to discuss current research, results, problems, and applications of both theoretical and practical nature. JELIA strives to foster links and facilitate cross-fertilisation of ideas among researchers from various disciplines, among researchers from academia and industry, and between theoreticians and practitioners. Authors are invited to submit papers presenting original and unpublished research in all areas related to the use of logics in Artificial Intelligence including:
- Abductive and inductive reasoning
- Answer set programming
- Applications and foundations of logic-based AI systems
- Argumentation systems
- Automated reasoning including satisfiability checking and its extensions
- Computational complexity and expressiveness
- Description logics and other logical approaches to semantic web and ontologies
- Hybrid reasoning systems
- Knowledge representation, reasoning, and compilation
- Logic programming and constraint programming
- Logics for uncertain and probabilistic reasoning
- Logics in machine learning
- Logics in multi-agent systems, games, and social choice
- Non-classical such as modal, temporal, spatial, paraconsistent, and hybrid logics
- Nonmonotonic reasoning, belief revision, and updates
- Planning and diagnosis based on logic
- Preferences
- Reasoning about actions and causality
Important Dates
- Deadline for abstract submission: May 3, 2010
- Deadline for paper submission: May 7, 2010
- Notification of acceptance: June 11, 2010
- Camera Ready Copy: June 30, 2010
Paper Submission
Proceedings will be published by Springer-Verlag in the Lecture Notes on Artificial Intelligence series. Papers should be written in English, and should be formatted according to the standard Springer LNCS style. All submissions must be received by 23:59 GMT on May 3, 2010 (abstract) and May 7, 2010 (full paper), and should be electronically submitted via the link available on the JELIA 2010 web page. There are two categories for submissions:
- A. Regular papers Submissions should not exceed 13 pages including figures, references, etc., and should contain original research, and sufficient detail to assess the merits and relevance of the contribution. Submissions must not have been previously published or be simultaneously submitted for publication elsewhere.
- B. System descriptions Submissions should not exceed 4 pages, and should describe an implemented system and its application area(s). A demonstration is expected to accompany a system presentation. Papers describing systems that have already been presented in JELIA before will be accepted only if significant and clear enhancements to the system are reported and implemented.
|
| | | | |
| | |
| | | | | | | | Date: | 19-Feb-2010 | | Title: | Pragmatics of SAT, a workshop of the SAT conference within the Federated Logic Conference (FLoC) - July 10, 2010 - Edinburgh, Scotland, UK
| | Hits: | 1484 | | Contributed by: | Daniel Le Berre | | Keywords: | Structure of problems, Benchmark, SAT application, SAT tools, branching heuristics, Dynamic restarts, programming language, pseudo boolean optimization, variable ordering heuristic, preprocessors, MAXSAT, distributed parallel dynamic learning, symmetry, General Interest, Boolean functions, SAT-Based, Linear Constraints, Stochastic Satisfiability, SAT-Solver Competition, Satisfiability Modulo Theory, bioinformatics, SAT-solver, Hybrid solver, Pseudo-Boolean Solving, null, null, null, null, null |
| | | | | | |
| |
Pragmatics of SAT
a workshop of the SAT conference within the
Federated Logic Conference (FLoC) 2010 July 10, 2010 - Edinburgh,
Scotland, UK
The aim of the pragmatics of SAT workshop is to allow researchers
concerned with the design of efficient SAT solvers or SAT encodings to
meet and discuss about their latest results. The workshop is also the
place for users of SAT technology to present their applications. This
workshop follows the spirit of Pragmatics of Decision Procedures in
Automated Reasoning organized at FLoC 2006.
Topics
Main areas of interest include, but are not restricted to:
* techniques for debugging or certifying solvers
* visualisation of benchmarks structure
* monitoring solver behaviour
* evaluation of solvers
* efficient data structures
* domain specific encodings
* taking into account multi-core technology
* domain specific heuristics
* new application of sat technology
* system/library description
Submission
There are two possible type of submissions for the workshop. The
papers are supposed to be submitted electronically through EasyChair
as a PDF file using the LNCS style (the same as the SAT conference).
http://www.easychair.org/conferences/?conf=pos10
* Regular papers (up to 14 pages). Accepted papers will be
published in the CEUR-WS electronic proceedings.
* System descriptions (up to 6 pages). Accepted papers will be
published in the JSAT journal, in the new system description category.
The final format of the paper will be different: system descriptions
will be published as a 4 page JSAT style while regular paper will use
a specific workshop style.
Authors should provide enough information and/or data for reviewers to
confirm any performance claims. This includes links to a runnable
system, access to benchmarks, reference to a public performance
results, etc.
The system description category especially targets the authors of the
systems that enter the SAT 2010 conference competitive events (SAT
Race 2010, PB 2010, MAXSAT 2010, QBFEVAL 2010, ...). The aim of this
workshop is to push forward peer-reviewed published system
descriptions as a means to spread technical information regarding the
design of solvers. System descriptions are expected to describe
briefly but precisely the main features of the system, in a specific
version.
Regular papers provide more space to describe in detail a full system
or application, provide experimental results, etc.
Important dates
* Submission deadline: March 26, 2010.
* Authors notification: April 23, 2010.
* Final version due: May 15, 2010.
* The workshop will take place on July 10th, 2010.
Tutorial by Youssef Hamadi: From Parallel SAT to Distributed SAT
This tutorial will present an overview of parallelism in SAT. It will
start with a presentation of classical divide and conquer techniques,
discuss their ancient origin and compare them to more recent
portfolio-based algorithms. It will then present the impact of
clause-sharing on their performances and discuss various strategies
used to control the communication overhead. A particular technique
used to control the classical diversification/intensification tradeoff
will also be presented. Finally, perspectives will be given which will
relate the current parallel SAT technologies to the expected evolution
of computational platforms, leading to distributed SAT solving
scenarios.
Programme Committee
* Josep Argelich
* Armin Biere
* Youssef Hamadi
* Daniel Le Berre
* Olivier Roussel
* Carsten Sinz
* Armando Tacchella
* Allen Van Gelder
|
| | | | |
| | |
| |
Workshop of SAT at FLoC 2010, Edinburgh, Scotland, July 10, 2010
First Call for Papers
Scope:
======
Modern software distributions are based on the notion of components, which
denote units of independent development and deployment. Components provide
the necessary flexibility when organizing a complex software distribution,
but also are a challenge when it comes to selecting components from a large
repository of possible choices, and configuring these components according
to user needs, resource constraints, and interdependencies with other
components. Representing and solving configuration problems is a hot topic
of great importance for many application domains. Some well-known examples
of complex systems of components in the world of Free and Open Source
software are the different distributions for GNU/Linux, BSD, or Eclipse
plugins.
Understanding and solving these questions is an attractive research
topic since the problems to be solved are complex and interesting for
researchers working on solving techniques, and on the other hand have
the potential of high impact on the way the software we all use
everyday is developed and deployed. Not only adequate logical
formalisms to represent a configuration problem are required, but also
sophisticated reasoning technologies to deal with large amounts of
data. Further relevant aspects include diagnosis of failed
configuration settings and an intelligent behavior dealing with user
preferences.
This workshop will focus on logic-based methods for specifying and solving
complex configuration problems for software components. The goal of the
workshop is to bring together both researchers and practitioners active in
the area of component configuration of software systems, using different
modeling and solving techniques, such as constraint and logic programming,
description logics, satisfiability and its extensions. The workshop will be
an opportunity to discuss common and complementary solutions for solving
component configuration.
Invited Talk
============
An invited talk will be given by Carsten Sinz (University of Karlsruhe).
MISC 2010
=========
The first Mancoosi International Solver Competition will be held in
conjunction with the LoCoCo workshop.
Important Dates
===============
Friday, March 26 Submission deadline
Friday, April 23 Notification about acceptance
Friday, May 21 Final paper due
Saturday, July 10 Workshop
Submission and Publication
==========================
We welcome submissions of various types of presentations related to
the topics of the workshop, such as
- full research papers
- abstracts of ongoing work
- tutorial overview papers
- summaries of research projects
- system descriptions, if possible including system demonstration at the
workshop. These must provide the means to download and evaluate the
system, with preference to distribution under an open source licence.
Program Committee
=================
Daniel Le Berre (Universite d'Artois, France)
Roberto Di Cosmo (Universite Paris-Diderot, France)
Georg Gottlob (Oxford University, UK)
Pascal van Hentenryck (Brown University, USA)
Matti Jarvisalo (University of Helsinki, Finland)
Ines Lynce (INESC-ID, Lisbon, Portugal), co-chair
Toni Mancini (Sapienza Universita di Roma, Italy)
Albert Oliveras (Technical University of Catalonia, Barcelona, Spain)
Christian Schulte (KTH, Stockholm, Sweden)
Ralf Treinen (Universite Paris-Diderot, France), co-chair
Nic Wilson (UCC, Cork, Irland) |
| | | | |
| | |
| | JELIA 2010 CALL FOR PAPERS
12th European Conference on Logics in Artificial Intelligence
Helsinki, Finland, September 13-15, 2010
http://jelia2010.tkk.fi/
The aim of JELIA 2010 is to bring together active researchers interested in
all aspects concerning the use of logics in Artificial Intelligence
to discuss current research, results, problems, and applications of both
theoretical and practical nature. JELIA strives to foster links and
facilitate cross-fertilisation of ideas among researchers from
various disciplines, among researchers from academia and industry,
and between theoreticians and practitioners.
Authors are invited to submit papers presenting original and unpublished
research in all areas related to the use of logics in Artificial Intelligence
including:
- Abductive and inductive reasoning
- Answer set programming
- Applications and foundations of logic-based AI systems
- Argumentation systems
- Automated reasoning including satisfiability checking and its extensions
- Computational complexity and expressiveness
- Description logics and other logical approaches to
semantic web and ontologies
- Hybrid reasoning systems
- Knowledge representation, reasoning, and compilation
- Logic programming and constraint programming
- Logics for uncertain and probabilistic reasoning
- Logics in machine learning
- Logics in multi-agent systems, games, and social choice
- Non-classical such as modal, temporal, spatial,
paraconsistent, and hybrid logics
- Nonmonotonic reasoning, belief revision, and updates
- Planning and diagnosis based on logic
- Preferences
- Reasoning about actions and causality
Important Dates
- Deadline for abstract submission: May 3, 2010
- Deadline for paper submission: May 7, 2010
- Notification of acceptance: June 11, 2010
- Camera Ready Copy: June 30, 2010
Paper Submission
Proceedings will be published by Springer-Verlag in the Lecture Notes on
Artificial Intelligence series. Papers should be written in English,
and should be formatted according to the standard Springer LNCS style.
All submissions must be received by 23:59 GMT on May 3, 2010 (abstract)
and May 7, 2010 (full paper), and should be electronically submitted
via the link available on the JELIA 2010 web page.
There are two categories for submissions:
- A. Regular papers
Submissions should not exceed 13 pages including figures, references, etc.,
and should contain original research, and sufficient detail to assess
the merits and relevance of the contribution. Submissions must not have
been previously published or be simultaneously submitted for publication
elsewhere.
- B. System descriptions
Submissions should not exceed 4 pages, and should describe an implemented
system and its application area(s). A demonstration is expected to
accompany a system presentation. Papers describing systems that have
already been presented in JELIA before will be accepted only if significant
and clear enhancements to the system are reported and implemented.
|
| | | | |
| | |
| | |
| | |
| | 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 |
| | | | |
| | |
| | | | | | | | Date: | 11-May-2009 | | Title: | HLDVT 2009: Call for Papers
| | Hits: | 1117 | | Contributed by: | Anonymous | | Keywords: | BDD, Random 3SAT, Verification, EDA, Benchmark, SAT application, Equivalency Reasoning, SAT tools, call for papers, SAT-Based, SAT/CP, Hybrid solver, null, null, null, null, null |
| | | | | | |
| | | Call for Papers
***************************************************************
HLDVT 2009
IEEE International High-Level Design, Validation and Test Workshop
http://www.hldvt.com/09/
Grand Hyatt, San Francisco, California, November 4-6, 2009
***************************************************************
Please visit http://www.hldvt.com/09/HLDVT09_cfp.pdf |
| | | | |
| | |
| |
LaSh08 - WORKSHOP ON LOGIC AND SEARCH
Computation of structures from declarative descriptions
Leuven, Belgium, November 6-7, 2008
http://www.cs.kuleuven.be/~dtai/LaSh08
DEADLINE EXTENSION: August 25, 2008.
IMPORTANT DATES:
Submission: August 25, 2008
Notification: September 15, 2008
Workshop: November 6-7, 2008
SCOPE:
LaSh is the first workshop that aims to bring together researchers
from the areas of Propositional Satisfiability (SAT), Constraint
Programming (CP), and Answer Set Programming (ASP). While so far SAT,
ASP and CP have developed as three independent disciplines, the past
years have shown a trend in which the application domains of SAT, CP
and ASP are more and more overlapping and the languages developed in
these areas tend to converge. There is a growing awareness of the
potential of combining techniques and algorithms from the different
areas.
Objectives
==========
LaSh08 aims to offer a discussion forum for research in SAT, ASP and
CP. We invite contributions on modeling languages,
methodologies, theoretical analysis, techniques, algorithms and
systems. The forum is an occasion to exchange ideas on the
state-of-the-art; to discuss specific technical problems; to formulate
challenges and opportunities ahead; to analyse differences and
simularities between the different areas; to study opportunities for
synergy and integration.
In particular, we would like to foster exchange at least on the
following topics:
-- integrations of SAT, ASP and/or CP technologies
-- comparisons of modeling languages
-- criteria for choice of modeling languages
(for modeling convenience or efficiency)
-- new algorithm directions
-- efficient modeling strategies
-- new applications
-- complexity results, tractable subsets
-- completeness results (e.g. capturing complexity classes)
-- methods for taking advantage of tractability results
-- SAT modulo theories
-- solver implementation techniques,
-- algorithms for grounding
-- modeling languages and constructs
(aggregates, global constraints,..)
-- search control and heuristics in the context of model generation
-- symmetry breaking in model construction
-- optimisation problems in model construction:
-- languages for optimality criteria;
-- algorithms for computing optimal models
LaSh08 will also provide an opportunity for presentation of implemented
systems and tools at a demo session. Thus, we invite submissions of
systems and tools that reflect the above ideas, and aim at facilitating
declarative problem solving, and making it practical and used.
Workshop format:
================
The workshops objective is to create an informal, stimulating
atmosphere for exchange of ideas.
The invited speakers are well-known experts:
* Pascal Van Hentenryck, Brown University,
"Constraint Programming at Work ".
* Robert Nieuwenhuis, Technical University of Catalonia,
"The Barcelogic approach to search: fast and robust but expressive".
A panel with experts of the different fields will be organized to
discuss differences and similarities between the different areas,
opportunities for integration, etc.
Paper Format
=============
Technical papers and application papers must be in the Springer LNCS
format and must not exceed 15 pages.
Experimental and tool papers are intended to describe implementations
of systems, to report experiments with implemented systems, or to
compare implemented systems. They can be at most 8 pages long in the
LNCS style.
The workshop has no formal proceedings; copies of the contributions
will be available.
................................................................
|
| | | | |
| | |
| |
CALL FOR PAPERS
LPAR'08
15th International Conference on Logic for
Programming, Artificial Intelligence and Reasoning
November 23-27, 2008
Carnegie Mellon University
Doha, Qatar
http://www.qatar.cmu.edu/lpar08
The series of International Conferences on Logic for Programming,
Artificial Intelligence and Reasoning (LPAR) is a forum where, year after
year, some of the most renowned researchers in the areas of
automated reasoning, computational logic, programming languages and their
applications come to present cutting-edge results, to discuss advances
in these fields, and to exchange ideas in a scientifically emerging part
of the world. The 2008 edition will be held in Doha, Qatar, on the
premises of the Qatar campus of Carnegie Mellon University.
Submission:
-----------
There are short and long papers. See the web page for more information.
Important Dates
---------------
Abstract submission deadline: 26 May 2008
Paper submission deadline: 06 June 2008
Notification of acceptance: 29 August 2008
Camera-ready papers: 19 September 2008
Short paper submission deadline: 26 September 2008
LPAR'08 Workshops: 22 November 2008
LPAR 2008: 23-27 November 2008
|
| | | | |
| | |
| |
