LICS 2008

From ConfIDent

"Error: Invalid time." is not a number. "Error: Invalid time." is not a number.

Deadlines
2008-01-07
7
Jan
2008
Submission
Metrics
Submitted Papers
116
Accepted Papers
39
Venue

Pittsburgh, Pennsylvania, United States of America

Loading map...
The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest for submissions include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, higher-order logic, hybrid systems, lambda and combinatory calculi, linear logic, logical aspects of computational complexity, logical frameworks, logics in artificial intelligence, logics of programs, logic programming, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, reasoning about security, rewriting, specifications, type systems and type theory, and verification. We welcome submissions in emergent areas, such as bioinformatics and quantum computation, if they have a substantial connection with logic.

Important Dates

Authors are required to submit a paper title and a short abstract of about 100 words before submitting the extended abstract of the paper. All submissions will be electronic.

    * Titles & Short Abstracts Due: January 7, 2008
    * Extended Abstracts Due: January 14, 2008
    * Author Notification: March 10, 2008
    * Camera-ready Papers Due: April 7, 2008

All deadlines are firm; late submissions will not be considered. Detailed information about electronic paper submission via Easy Chair will be posted at the LICS website.
	

This CfP was obtained from WikiCFP

Cookies help us deliver our services. By using our services, you agree to our use of cookies.