|
|
| Line 1: |
Line 1: |
| | {{Event | | {{Event |
| − | |Acronym=CSL 2006 | + | |Acronym=AdHoc-Now 2002 |
| − | |Title=20th International Workshop on Computer Science Logic | + | |Title=International Conference on AD-HOC Networks and Wireless |
| − | |Ordinal=20
| + | |In Event Series=Event Series:ADHOC-NOW |
| − | |Type=Workshop
| + | |Single Day Event=yes |
| − | |Homepage=http://www.inf.u-szeged.hu/~csl06/ | + | |Start Date=2002 |
| − | |DblpConferenceId=csl/csl2006 | + | |Event Status=as scheduled |
| − | |City=Szeged | + | |Event Mode=on site |
| − | |Country=Country:HU | + | |Type=Conference |
| − | |has program chair=Zoltan Esik | + | |Year=2002 |
| − | |Submitted papers=108 | |
| − | |Accepted papers=37
| |
| − | |has Proceedings Link=https://link.springer.com/content/pdf/10.1007%2F11874683.pdf
| |
| − | |has Proceedings DOI=https://doi.org/10.1007/11874683
| |
| − | |has Proceedings Bibliography=https://link.springer.com/book/10.1007%2F11874683 | |
| − | |pageCreator=User:Curator 75
| |
| | |pageEditor=User:Curator 75 | | |pageEditor=User:Curator 75 |
| | + | |pageCreator=Orapi |
| | |contributionType=1 | | |contributionType=1 |
| − | |In Event Series=Event Series:CSL
| |
| − | |Single Day Event=no
| |
| − | |Start Date=2006/09/25
| |
| − | |End Date=2006/09/29
| |
| − | |Event Status=as scheduled
| |
| − | |Event Mode=on site
| |
| − | }}
| |
| − | {{Event Deadline
| |
| − | |Abstract Deadline=2006/04/24
| |
| − | |Paper Deadline=2006/05/01
| |
| − | |Notification Deadline=2006/06/12
| |
| − | |Submission Deadline=2006/04/24
| |
| | }} | | }} |
| | {{Event Deadline}} | | {{Event Deadline}} |
| | {{S Event}} | | {{S Event}} |
| − | The 20th International Workshop on Computer Science Logic (CSL) 2006
| |
| − |
| |
| − |
| |
| − | ==Topics==
| |
| − | Suggested topics of interest include:
| |
| − | *automated deduction and interactive theorem proving
| |
| − | *constructive mathematics and type theory
| |
| − | *equational logic and term rewriting
| |
| − | *automata and formal logics
| |
| − | *modal and temporal logic
| |
| − | *model checking
| |
| − | *logical aspects of computational complexity
| |
| − | *finite model theory
| |
| − | *computational proof theory
| |
| − | *logic programming and constraints
| |
| − | *lambda calculus and combinatory logic
| |
| − | *categorical logic and topological semantics
| |
| − | *domain theory
| |
| − | *database theory
| |
| − | *specification
| |
| − | *extraction and transformation of programs
| |
| − | *logical foundations of programming paradigms
| |
| − | *verification of security protocols
| |
| − | *linear logic
| |
| − | *higher-order logic
| |
| − | *nonmonotonic reasoning
| |
| − | *logics and type systems for biology
| |
| − |
| |
| − |
| |
| − | ==Submissions==
| |
| − | Submitted papers must be in Springer's LNCS style and of no more than 15 pages, presenting work not previously published. They must not be submitted concurrently to another conference with refereed proceedings. The PC chair should be informed of closely related work submitted to a conference or journal by 1 April 2006. Papers authored or coauthored by members of the Programme Committee are not allowed.
| |
| − |
| |
| − | Submitted papers must be in English and provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a technical appendix which will be read at the reviewer's discretion. The title page must contain: title and author(s), physical and e-mail addresses, identification of the corresponding author, an abstract of no more than 200 words, and a list of keywords.
| |
| − |
| |
| − |
| |
| − | ==Important Dates==
| |
| − | Title & abstract: 24 April, 2006<br>
| |
| − | Full paper: 1 May, 2006<br>
| |
| − | Notification: 12 June, 2006<br>
| |
| − | Final papers: 3 July, 2006<br>
| |
