 |
15 elements available | | 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: | 275 | | 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: | 553 | | 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
|
| | | | |
| | |
| |
