[FOM] LPAR-18 Call for Papers and Workshops
Geoff Sutcliffe by way of Martin Davis <martin@eipye.com>
geoff at cs.miami.edu
Tue Oct 11 14:02:11 EDT 2011
===========================
LPAR-18
2nd CALL FOR PAPERS
CALL FOR WORKSHOP PROPOSALS
===========================
============================================================
The 18th International Conference on
Logic for Programming, Artificial Intelligence and Reasoning
============================================================
Merida, Venezuela - March 11-15, 2012
www.LPAR-18.info
This is the second call for papers for LPAR-18 and the first call for workshop
proposals. Information about workshop proposals is included at the end of this
call.
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 logic, 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 18th LPAR
will be held in Merida, Venezuela.
Logic is a fundamental organizing principle in nearly all areas in Computer
Science. It runs a multifaceted gamut from the foundational to the applied.
At one extreme, it underlies computability and complexity theory and the formal
semantics of programming languages. At the other extreme, it drives billions
of gates every day in the digital circuits of processors of all kinds. Logic
is in itself a powerful programming paradigm, but it is also the
quintessential
specification language for anything ranging from real-time critical systems to
networked infrastructures. Logical techniques link implementation and
specification through formal methods such as automated theorem proving and
model checking. Logic is also the stuff of knowledge representation and
artificial intelligence. Because of its ubiquity, logic has acquired a central
role in Computer Science education.
Topics
------
New results in the fields of computational logic and applications are welcome.
Also welcome are more exploratory presentations, which may examine open
questions and raise fundamental concerns about existing theories and practices.
Topics of interest include, but are not limited to:
* Automated reasoning
* Verification
* Interactive theorem proving and proof assistants
* Model checking
* Implementations of logic
* Satisfiability modulo theories
* Rewriting and unification
* Logic programming
* Satisfiability checking
* Constraint programming
* Decision procedures
* Logic and games
* Logic and the Web
* Ontologies and large knowledge bases
* Logic and databases
* Modal and temporal logics
* Program analysis
* Foundations of security
* Description logics
* Non-monotonic reasoning
* Uncertainty reasoning
* Logics for vague and inconsistent data
* Specification using logic
* Logic in artificial intelligence
* Logic and types
* Logical foundations of programming
* Logical aspects of concurrency
* Logic and computational complexity
* Knowledge representation and reasoning
* Logic of distributed systems
Programme Chairs
----------------
* Nikolaj Bjorner
* Andrei Voronkov
Conference Chair
----------------
* Geoff Sutcliffe
Workshop Chair
--------------
* Laura Kovacs
Local Arrangements Chair
------------------------
* Blanca Abraham
PC - preliminary
----------------
* Jose Aguilar
* Elvira Albert
* Franz Baader
* Gilles Barthe
* Peter Baumgartner
* Armin Biere
* Nikolaj Bjorner
* Thierry Coquand
* Veronike Cortier
* Luca De Alfaro
* Christian Fermueller
* John Harrison
* Pascal Van Hentenryck
* Manuel Hermengildo
* Barbara Jobstmann
* Deepak Kapur
* Konstantin Korovin
* Laura Kovacs
* Carsten Lutz
* Parthasarathy Madhusudan
* Aart Middeldorp
* Dale Miller
* Cesar Munoz
* Albert Oliveras
* Lawrence Paulson
* Ruzica Piskac
* Francesca Rossi
* Grigore Rosu
* Torsten Schaub
* Natarajan Shankar
* Wolfgang Thomas
* Cesare Tinelli
* Andrei Voronkov
* Toby Walsh
* Christoph Weidenbach
* Frank Wolter
Submission Details
------------------
Submissions of two kinds are welcome:
* Regular papers that describe solid new research results. They can be
up to 15 pages long in LNCS style, including figures and references,
but excluding appendices (that reviewers are not required to read).
* Experimental and tool papers that describe implementations of systems,
report experiments with implemented systems, or compare implemented
systems. They can be up to 8 pages long in the LNCS style.
Both types of papers can be electronically submitted in PDF via EasyChar:
http://www.easychair.org/conferences/?conf=lpar18.
Prospective authors are required to register a title and an abstract a week
before the paper submission deadline (see below).
Participation
-------------
Authors of accepted papers are required to ensure that at least one of them
will be present at the conference.
Important Dates
---------------
* Abstract submission: 23 October 2011
* Paper submission: 1 November 2011
* Notification of acceptance: 20 December 2011
* Camera-ready papers: 10 January 2012
* Conference: 11-15 March 2012
Workshop Proposals
------------------
LPAR-18 workshops will be held on March 10, either as one-day or half-day
events. If you would like to propose a workshop for LPAR-18, please contact
the workshop chair via email (lkovacs at complang.tuwien.ac.at), by the proposal
deadline, November 15th.
To help planning, workshop proposals should contain the following data:
* Name of the workshop.
* Brief description of the workshop, including workshop topics.
* Contact information of the workshop organizers.
* An estimate of the audience size.
* Proposed format of the workshop (for example, regular talks,
tool demos, poster presentations, etc.).
* Duration of the workshop (one-day or half-day).
* Potential invited speakers (if any).
* Procedures for selecting papers and participants.
* Special technical or AV needs.
Important workshop dates
------------------------
* Workshop proposals: 15 November 2011
* Notification of workshops proposals: 1 December 2011
More information about the FOM
mailing list