Difference between revisions of "CSL 2016"

From Openresearch
Jump to navigation Jump to search
Line 29: Line 29:
  
 
==Topics==
 
==Topics==
 +
Suggested topics of interest include (but are not limited to):
 +
*automated deduction and interactive theorem proving,
 +
*constructive mathematics and type theory,
 +
*equational logic and term rewriting,
 +
*automata and games, game semantics,
 +
*modal and temporal logic,
 +
*model checking,
 +
*decision procedures,
 +
*logical aspects of computational complexity,
 +
*finite model theory,
 +
*computational proof theory,
 +
*bounded arithmetic and propositional proof complexity,
 +
*logic programming and constraints,
 +
*lambda calculus and combinatory logic,
 +
*domain theory,
 +
*categorical logic and topological semantics,
 +
*database theory,
 +
*specification, extraction and transformation of programs,
 +
*logical aspects of quantum computing,
 +
*logical foundations of programming paradigms,
 +
*verification and program analysis,
 +
*linear logic,
 +
*higher-order logic,
 +
*nonmonotonic reasoning
 +
 +
 
==Submissions==
 
==Submissions==
 
==Important Dates==
 
==Important Dates==

Revision as of 10:43, 27 August 2021

CSL 2016
25th EACSL Annual Conference on Computer Science Logic
Ordinal 25
Event in series CSL
Dates 2016/08/29 (iCal) - 2016/09/01
Presence presence
Homepage: http://csl16.lif.univ-mrs.fr/
Location
Location: Marseille, France
Loading map...

Important dates
Abstracts: 2016/04/08
Papers: 2016/04/15
Submissions: 2016/07/03
Notification: 2016/06/11
Papers: Submitted 97 / Accepted 37 (38.1 %)
Committees
General chairs: Laurent Regnier, Jean-Marc Talbot
PC chairs: Laurent Regnier, Jean-Marc Talbot
Workshop chairs: Luigi Santocanale
Table of Contents

,



The 25th EACSL Annual Conference on Computer Science Logic (CSL) 2016


Topics

Suggested topics of interest include (but are not limited to):

  • automated deduction and interactive theorem proving,
  • constructive mathematics and type theory,
  • equational logic and term rewriting,
  • automata and games, game semantics,
  • modal and temporal logic,
  • model checking,
  • decision procedures,
  • logical aspects of computational complexity,
  • finite model theory,
  • computational proof theory,
  • bounded arithmetic and propositional proof complexity,
  • logic programming and constraints,
  • lambda calculus and combinatory logic,
  • domain theory,
  • categorical logic and topological semantics,
  • database theory,
  • specification, extraction and transformation of programs,
  • logical aspects of quantum computing,
  • logical foundations of programming paradigms,
  • verification and program analysis,
  • linear logic,
  • higher-order logic,
  • nonmonotonic reasoning


Submissions

Important Dates

  • Abstract submission deadline : April 8, 2012 (AoE)
  • Paper submission deadline: April 15, 2016 (AoE)
  • Author notification: June 11, 2016
  • Final version deadline: July 3, 2016 (AoE)
  • Early registration deadline: August 14, 2016 (local time, GMT+2)
  • Conference: August 29–September 1, 2016
  • Workshops: August 28, September 2 and September 3, 2016