May 2019 - finite-model-theory - lists.rwth-aachen.de

Several PhD and Postdoc positions in Formal Methods and Web Security at TU Wien, Austria - Deadline: 31.5.2019

by Mihaela Rozman

Several PhD and Postdoc positions in Formal Methods and Web Security at TU Wien funded by ERC Consolidator Grant WHAT: The Security & Privacy group at TU Wien ( <https://secpriv.tuwien.ac.at> https://secpriv.tuwien.ac.at) is currently looking for several outstanding Ph.D. and postdoc candidates to conduct research within the ERC Consolidator Project "Foundations and Tools for Client-Side Web Security". The project will develop a holistic approach to client-side web security, laying its theoretical foundations and developing innovative security enforcement technologies. The project is a multidisciplinary research effort, promising practical impact and delivering breakthrough advancements in various disciplines, such as web security, JavaScript semantics, software engineering, and program verification. APPLICATION: Successful applicants should have a background and interest in at least one of the following areas: - security - web technologies - formal methods - semantics of programming languages - verification - Doctoral applicants should have recently completed (or be close to complete) a master or bachelor with honours degree. Postdoctoral applicants should have an excellent publication record with at least one top-tier conference in one of the aforementioned areas. + The employment is full-time (40 hrs/week) and the salary is internationally competitive (the yearly entry-level gross salary is approx. 40K EUR for PhD students and 53K for postdocs). + The working language at the university is English, knowledge of German is not required. APPLICATION: Interested candidates should send - a motivation letter - transcripts of records (Bachelor and Master, for PhD applicants) - a publication list (for postdoc applicants) - a research statement (for postdoc applicants) - a curriculum vitae - contact information for two referees to Univ. Prof. Matteo Maffei <mailto:matteo.maffei@tuwien.ac.at> matteo.maffei(a)tuwien.ac.at DEADLINE: The application deadline is May 31, 2019. ABOUT TU WIEN (Vienna University of Technology), AUSTRIA: TU Wien offers an outstanding research environment and numerous professional development opportunities. The Faculty of Informatics is the largest one in Austria and is consistently ranked among the best in Europe. Ph.D. students have the possibility to join the LogiCS doctoral school ( <http://logic-cs.at> http://logic-cs.at). Vienna features a vibrant and excellence-driven research landscape, with several leading research institutes (e.g., University of Vienna, IST, AIT, SBA) and universities continuously establishing collaborations in various fields, including security and privacy. Finally, Vienna has been consistently ranked by Mercer over the last years the best city for quality of life worldwide.

5 years, 4 months

1
0
0 0

RAMiCS2020 - CFP

by Michael Winter

CALL FOR PAPERS 18th International Conference on Relational and Algebraic Methods in Computer Science RAMiCS 2020 08. April to 11. April 2020, Palaiseau, France URL: http://ramics18.gforge.inria.fr/ IMPORTANT DATES: Abstract Submission: 06. October 2019 Paper Submission: 13. October 2019 Author Notification: 15. December 2019 Final Version: 16. January 2020 RAMiCS 2020: 08. April to 11. April 2020 GENERAL INFORMATION: Since 1994, the RAMiCS conference series has been the main venue for research on relation algebras, Kleene algebras and similar algebraic formalisms, and their applications as conceptual and methodological tools in computer science and beyond. TOPICS: We invite submissions in the general fields of algebras relevant to computer science and applications of such algebras. Topics include but are not limited to: * Theory - algebras such as semigroups, residuated lattices, semirings, Kleene algebras, relation algebras and quantales - their connections with program logics and other logics - their use in the theories of automata, concurrency, formal languages, games, networks and programming languages - the development of algebraic, algorithmic, category-theoretic, coalgebraic and proof-theoretic methods for these theories - their formalisation with theorem provers * Applications - tools and techniques for program correctness, specification and verification - quantitative and qualitative models and semantics of computing systems and processes - algorithm design, automated reasoning, network protocol analysis, social choice, optimisation and control - industrial applications WATA 2020 WATA 2020, the 10th International Workshop on Weighted Automata: Theory and Applications, will take place just after RAMICS, from 14 to 17 April, in Marseille. We encourage participants to combine the two events. SUBMISSION INSTRUCTIONS: Submission is via EasyChair at https://www.easychair.org/conferences/?conf=ramics2020 All papers will be peer-reviewed by at least three referees. The proceedings will be published in an LNCS volume by Springer, ready at the conference. Submissions must not be published or under review for publication elsewhere. Submissions must be in English using a PDF not exceeding 16 pages in LNCS style. Submissions must provide sufficient information to judge their merits. Additional material may be provided in a clearly marked appendix or by a reference to a manuscript on a web site. Experimental data, software or mathematical components for theorem provers must be available in sufficient detail for referees. Deviation from these requirements may lead to rejection. One author of each accepted paper is expected to present the paper at the conference. Accepted papers must be produced with LaTeX. Formatting instructions and LNCS style files are available at http://www.springer.de/comp/lncs/authors.html As for earlier RAMiCS conferences, we intend to publish a journal special issue with revised and extended versions of a selection of the best papers. COMMITTEES: Organising Committee -------------------- Conf. & PC Co-Chair: Peter Jipsen, Chapman University, USA Conf. & PC Co-Chair: Uli Fahrenberg, École polytechnique, France Conf. & PC Co-Chair: Michael Winter, Brock University, Canada Programme Committee ------------------- Roland Backhouse University of Nottingham, UK Rudolf Berghammer Kiel University, Germany Manuel Bodirsky TU Dresden, Germany Jules Desharnais Laval University, Canada Amina Doumane PPS, France Uli Fahrenberg École polytechnique, France Hitoshi Furusawa Kagoshima University, Japan Mai Gehrke LIAFA, France Walter Guttmann University of Canterbury, New Zealand Robin Hirsch University College London, UK Peter Höfner CSIRO, Australia Marcel Jackson La Trobe University, Australia Jean-Baptiste Jeannin University of Michigan, USA Peter Jipsen Chapman University, USA Wolfram Kahl McMaster University, Canada Dexter Kozen Cornell University, USA Tadeusz Litak FAU Erlangen-Nürnberg, Germany Wendy MacCaull St. Francis Xavier University, Canada Roger Maddux Iowa State University, USA Annabelle McIver Macquarie University, Australia Szabolcs Mikulas University of London, UK Ali Mili NJIT, USA Jose Oliveira University of Minho, Portugal Alessandra Palmigiano Technical University of Delft, Netherlands Damien Pous CNRS - ENS Lyon, France Mehrnoosh Sadrzadeh Queen Mary University of London, UK Luigi Santocanale LIS, Aix-Marseille Université, France John Stell University of Leeds, UK Georg Struth University of Sheffield, UK Michael Winter Brock University, Canada

5 years, 4 months

1
0
0 0

FSCD 2019 - Early registration ends soon (May 13th)

by Sandra Alves

(Apologies for multiple copies of this announcement. Please circulate.) ================================================================== EARLY REGISTRATION ENDS MAY 13th Program available at: http://easyconferences.eu/fscd2019/program/ ================================================================== CALL FOR PARTICIPATION Fourth International Conference on Formal Structures for Computation and Deduction (FSCD 2019) 24 -- 30 June 2019, Dortmund, Germany http://easyconferences.eu/fscd2019/ <http://easyconferences.eu/fscd2019/> FSCD covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, models of computation (e.g. quantum computing, probabilistic computing, homotopy type theory), semantics and verification in new challenging areas (e.g. blockchain protocols or deep learning algorithms). REGISTRATION The registration page is already open and linked from: http://easyconferences.eu/fscd2019/registration-2/ <http://easyconferences.eu/fscd2019/registration-2/> The early registration deadline is *** 13 May 2019 ***. (for more details please visit the conference webpage). INVITED SPEAKERS Titles and abstracts available at http://easyconferences.eu/fscd2019/invited-speakers/ <http://easyconferences.eu/fscd2019/invited-speakers/> * Beniamino Accattoli (INRIA, Paris, France) https://sites.google.com/site/beniaminoaccattoli/ <https://sites.google.com/site/beniaminoaccattoli/> * Amy Felty (University of Ottawa, Canada) http://www.site.uottawa.ca/~afelty/ <http://www.site.uottawa.ca/~afelty/> * Sarah Winkler (University of Innsbruck, Austria) http://cl-informatik.uibk.ac.at/users/swinkler/ <http://cl-informatik.uibk.ac.at/users/swinkler/> * Hongseok Yang (KAIST, Korea) https://sites.google.com/view/hongseokyang/ <https://sites.google.com/view/hongseokyang/> SATELLITE EVENTS - UNIF: 33rd International Workshop on Unification (http://www.mat.unb.br/unif2019 <http://www.mat.unb.br/unif2019>) - WPTE: 6th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (http://nigam.info/conferences/wpte2019/main.html <http://nigam.info/conferences/wpte2019/main.html>) - IWC: 8th International Workshop on Confluence (http://iwc2019.cic.unb.br <http://iwc2019.cic.unb.br/>) - TLLA: 3rd Trends in Linear Logic and Applications (http://tlla.linear-logic.org/2019 <http://tlla.linear-logic.org/2019>) - SD: 5th International Workshop on Structures and Deduction (http://www.anupamdas.com/sd19 <http://www.anupamdas.com/sd19>) - HOR: 10th International Workshop on Higher-Order Rewriting (http://imft.ftn.uns.ac.rs/HOR2019 <http://imft.ftn.uns.ac.rs/HOR2019>) - IFIP: 22nd IFIP Working Group 1.6: Rewriting (http://cbr.uibk.ac.at/ifip-wg1.6/events/event-2019.html <http://cbr.uibk.ac.at/ifip-wg1.6/events/event-2019.html>) PROGRAM CHAIR Herman Geuvers, Radboud U. Nijmegen CONFERENCE CHAIR Jakob Rehof, TU Dortmund LOCAL WORKSHOP CHAIR Boris Düdder, U. of Copenhagen PROGRAM COMMITTEE H. Geuvers, Radboud U. Nijmegen Z. Ariola, U. of Oregon M. Ayala Rincón, U. of Brasilia A. Bauer, U. of Ljubljana F. Bonchi, U. of Pisa S. Broda, U. of Porto U. Dal Lago, U. of Bologna & Inria U. De'Liguoro, U. of Torino D. Kapur, U. of New Mexico P. Dybjer, Chalmers U. of Technology M. Fernandez, King's College London J. Giesl, RWTH Aachen N. Hirokawa, JAIST S. Lucas, U. Politecnica de Valencia A. Middeldorp, U. of Innsbruck F. Pfenning, Carnegie Mellon U. B. Pientka, McGill U. J. van de Pol, Aarhus U. & U. of Twente F. van Raamsdonk, VU Amsterdam C. Schürmann, ITU Copenhagen P. Severi, U. of Leicester A. Silva, U. College London S. Staton, Oxford U. T. Streicher, TU Darmstadt A. Stump, U. of Iowa N. Tabareau, Inria S. Tison, U. of Lille A. Tiu, Australian National U. T. Tsukada, U. of Tokyo J. Urban, CTU Prague P. Urzyczyn, U. of Warsaw J. Waldmann, Leipzig U. of Applied Sciences STEERING COMMITTEE WORKSHOP CHAIR Jamie Vicary, Oxford U. PUBLICITY CHAIR Sandra Alves , Porto U. FSCD STEERING COMMITTEE S. Alves (Porto U.), M. Ayala-Rincón (Brasilia U.) C. Fuhs (Birkbeck, London U.) D. Kesner (Chair, Paris U.) H. Kirchner (Inria) N. Kobayashi (U. Tokyo) C. Kop (Radboud U. Nijmegen) D. Miller (Inria) L. Ong (Chair, Oxford U.) B. Pientka (McGill U.) S. Staton (Oxford U.) Looking forward to seeing you in Dortmund! ==================================================================

5 years, 5 months

1
0
0 0

EXTENDED DEADLINE SIGLOG/VCLA TRAVEL AWARDS FOR WOMEN IN LOGIC WORKSHOP 2019 (WiL 2019) - May 21, 2019

by Mihaela Rozman

It is our pleasure to announce an extended deadline for the SIGLOG/VCLA Travel Awards for attendees of Women in Logic Workshop 2019 (WiL) associated with the 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 2019. ELIGIBILITY Thanks to the generous support of the SIGLOG and Vienna Center for Logic and Algorithms (VCLA), applications for awards are invited to facilitate students and postdocs, who are the authors of accepted talks and papers to register and travel to the WiL 2019 (June 23, 2019). SIGLOG/VCLA AWARDS -The awardees of the SIGLOG/VCLA Travel Award will be reimbursed for a portion of their travel expenses, and registration costs. -There will be at most one award per paper. APPLICATION PROCESS To submit a nomination for the SIGLOG/VCLA Travel Awards please include: 1. Basic information about the applicant 2. Information about her/his accepted WiL 2019 contribution 3. A statement about how attendance at WiL 2019 will impact the applicant 4. Resume/CV of the applicant 5. A nomination consists of a recommendation letter of up to 300 words by the applicant´s supervisor Please submit using the subject “WiL 2019 – Travel Awards” to the WiL Program Co-chairs, Valeria de Paiva at valeria.depaiva(a)gmail.com and Amy Felty atafelty(a)uottawa.ca SIGLOG/VCLA TRAVEL AWARDS IMPORTANT DATES -Nominations must arrive no later than May 21, 2019 -The winners will be notified by the end of May 25, 2019 More: https://sites.google.com/site/womeninlogic2019/call-for-papers

5 years, 5 months

1
0
0 0

FMCAD 2019 Deadline Extension

by barrett＠cs.stanford.edu

CALL FOR PAPERS International Conference on Formal Methods in Computer-Aided Design (FMCAD) Hyatt Place San Jose Downtown, San Jose, California, USA, Oct 22 - 25, 2019 http://www.fmcad.org/FMCAD19 IMPORTANT DATES Abstract Submission (EXTENDED): May 17, 2019 Paper Submission (EXTENDED): May 24, 2019 Author Response Period: June 17-21, 2019 Author Notification: July 3, 2019 Camera-Ready Version: Aug 16, 2019 All deadlines are 11:59 pm AoE (Anywhere on Earth) FMCAD Tutorial Day: Oct 22, 2019 Regular Program: Oct 23 - 25, 2019 Part of the FMCAD 2019 program - FMCAD Student Forum - Hardware Model Checking Competition CONFERENCE SCOPE AND PUBLICATION FMCAD 2019 is the nineteenth in a series of conferences on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing groundbreaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system design including verification, specification, synthesis, and testing. FMCAD employs a rigorous peer-review process. Accepted papers are distributed through both ACM and IEEE digital libraries. In addition, published articles are made available freely on the conference page; the authors retain the copyright. There are no publication fees. At least one of the authors is required to register for the conference and present the accepted paper. A small number of outstanding FMCAD submissions will be considered for inclusion in a Special Issue of the journal on Formal Methods in System Design (FMSD). TOPICS OF INTEREST FMCAD welcomes submission of papers reporting original research on advances in all aspects of formal methods and their applications to computer-aided design. Topics of interest include (but are not limited to): - Model checking, theorem proving, equivalence checking, abstraction and reduction, compositional methods, decision procedures at the bit- and word-level, probabilistic methods, combinations of deductive methods and decision procedures. - Synthesis and compilation for computer system descriptions, modeling, specification, and implementation languages, formal semantics of languages and their subsets, model-based design, design derivation and transformation, correct-by-construction methods. - Application of formal and semi-formal methods to functional and non-functional specification and validation of hardware and software, including timing and power modeling, verification of computing systems on all levels of abstraction, system-level design and verification for embedded systems, cyber-physical systems, automotive systems and other safety-critical systems, hardware-software co-design and verification, and transaction-level verification. - Experience with the application of formal and semi-formal methods to industrial-scale designs; tools that represent formal verification enablement, new features, or a substantial improvement in the automation of formal methods. - Application of formal methods to verifying safety, connectivity and security properties of networks, distributed systems, smart contracts, blockchains, and IoT devices. SUBMISSIONS Submissions must be made electronically in PDF format via EasyChair: https://easychair.org/conferences/?conf=fmcad2019 Two categories of papers are invited: Regular papers, and Tool & Case Study papers. Regular papers are expected to offer novel foundational ideas, theoretical results, or algorithmic improvements to existing methods, along with experimental impact validation where applicable. Tool & Case Study papers are expected to report on the design, implementation or use of verification (or related) technology in a practically relevant context (which need not be industrial), and its impact on design processes. Both Regular and Tool & Case study papers must use the IEEE Transactions format on letter-size paper with a 10-point font size. Papers in both categories can be either 8 pages (long) or 4 pages (short) in length not including references. Short papers that describe emerging results, practical experiences, or original ideas that can be described succinctly are encouraged. Authors will be required to select an appropriate paper category at abstract submission time. Submissions may contain an optional appendix, which will not appear in the final version of the paper. The reviewers should be able to assess the quality and the relevance of the results in the paper without reading the appendix. Submissions in both categories must contain original research that has not been previously published, nor is concurrently submitted for publication. Any partial overlap with published or concurrently submitted papers must be clearly indicated. If experimental results are reported, authors are strongly encouraged to provide the reviewers access to their data at submission time, so that results can be independently verified. The review process is single blind. STUDENT FORUM Continuing the tradition of the previous years, FMCAD 2019 is hosting a Student Forum that provides a platform for graduate students at any career stage to introduce their research to the wider Formal Methods community, and solicit feedback. Submissions for the event must be short reports describing research ideas or ongoing work that the student is currently pursuing, and must be within the scope of FMCAD. Work, part of which has been previously published, will be considered; the novel aspect to be addressed in future work must be clearly described in such cases. All submissions will be reviewed by a select group of FMCAD program committee members. FMCAD 2019 COMMITTEES PROGRAM CHAIRS: Clark Barrett, Stanford University Jin Yang, Intel Corporation PROGRAM COMMITTEE: Erika Abraham, Aachen University June Andronick, CSIRO|Data61 and UNSW Timos Antonopoulos, Yale University Armin Biere, Johannes Kepler University Per Bjesse, Synopsys Jasmin Blanchette, Inria Nancy Roderick Bloem, Graz University of Technology Gianpiero Cabodi, Politechnico Torino Supratik Chakraborty, IIT Bombay Sylvain Conchon, Universite Paris-Sud Vijay D'Silva, Google Rayna Dimitrova, University of Leicester Malay Ganai, Synopsys Alberto Griggio, Fondazione Bruno Kessler Liana Hadarean, Amazon Joe Hendrix, Galois Marijn Heule, University of Texas at Austin Warren Hunt, University of Texas at Austin Alexander Ivrii, IBM George Karpenkov, Google Panagiotis Manolios, Northeastern University Ken McMillan, Microsoft Research Rajdeep Mukherjee, Cadence Alexander Nadel, Intel Corporation Corina Pasareanu, NASA/CMU Sandip Ray, University of Florida Giles Reger, University of Manchester Anna Slobodova, Centaur Armando Solar-Lezama, Massachusetts Institute of Technology Niklas S��rensson, Mentor Graphics Daryl Stewart, ARM Christoph Sticksel, MathWorks Chao Wang, University of Southern California Georg Weissenbacher, Vienna University of Technology Zhenkun Yang, Intel Corporation Lenore Zuck, University of Illinois at Chicago TUTORIAL CHAIR: Sandip Ray, University of Florida STUDENT FORUM CHAIRS: Grigory Fedyukovich, Princeton University WEBMASTER: Tom van Dijk, Johannes Kepler University LOCAL ARRANGEMENT: Yoni Zohar, Stanford University PUBLICATION CHAIR: Florian Lonsing, Stanford University FMCAD STEERING COMMITTEE: Armin Biere, Johannes Kepler University Alan Hu, University of British Columbia Warren Hunt, University of Texas at Austin Vigyan Singhal, Oski Tech Georg Weissenbacher, Vienna University of Technology

5 years, 5 months

1
0
0 0

QBF 2019 - second call for papers

by HUBERT MING CHEN

[We apologize if you receive multiple copies of this call] ---------------------------------------------------------------------- CALL FOR PAPERS QBF 2019 -------- International Workshop on Quantified Boolean Formulas and Beyond Lisbon, Portugal, July 7, 2019 http://fmv.jku.at/qbf19/ Affiliated to and co-located with: Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'19) Lisbon, Portugal, July 7-12, 2019 ---------------------------------------------------------------------- Quantified Boolean formulas (QBF) are an extension of propositional logic which allows for explicit quantification over propositional variables. The decision problem of QBF is PSPACE-complete, compared to the NP-completeness of the decision problem of propositional logic (SAT). Many problems from application domains such as model checking, formal verification or synthesis are PSPACE-complete, and hence could be encoded in QBF in a natural way. Considerable progress has been made in QBF solving throughout the past years. However, in contrast to SAT, QBF is not yet widely applied to practical problems in academic or industrial settings. For example, the extraction and validation of models of (un)satisfiability of QBFs and has turned out to be challenging, given that state-of-the-art solvers implement different solving paradigms. The goal of the International Workshop on Quantified Boolean Formulas (QBF Workshop) is to bring together researchers working on theoretical and practical aspects of QBF solving. In addition to that, it addresses (potential) users of QBF in order to reflect on the state-of-the-art and to consolidate on immediate and long-term research challenges. The workshop also welcomes work on reasoning with quantifiers in related problems, such as dependency QBF (DQBF), quantified constraint satisfaction problems (QCSP), and satisfiability modulo theories (SMT) with quantifiers. =============== INVITED SPEAKER =============== Alexander Feldman, PARC =============== IMPORTANT DATES =============== May 15: Submission June 1: Notification June 15: Camera-ready versions Please see the workshop webpage for any updates: http://fmv.jku.at/qbf19/ ====================== CALL FOR CONTRIBUTIONS ====================== The workshop is concerned with all aspects of current research on all formalisms enriched by quantifiers, and in particular QBF. The topics of interest include (but are not limited to): Applications, encodings and benchmarks with quantifiers QBF Proof theory and complexity results Experimental evaluations of solvers or related tools Case studies illustrating the power of quantifiers Certificates and proofs for QBF, QCSP, SMT with quantifiers, etc. Formats of proofs and certificates Implementations of proof checkers and verifiers Decision procedures Calculi and their relationships Data structures, implementation details and heuristics Pre- and inprocessing techniques Structural reasoning ========== SUBMISSION ========== Submissions of extended abstracts are invited and will be managed via Easychair: https://easychair.org/conferences/?conf=qbf19 In particular, we invite the submission of extended abstracts on work that has been published already, novel unpublished work, or work in progress. The following forms of submissions are solicited: - Proposals for short tutorial presentations on topics related to the workshop. Tutorial proposals will be reviewed by the PC. The number of accepted tutorials depends on the overall number of accepted papers and talks, with the aim to set up a balanced workshop program. - Talk abstracts reporting on already published work. Such an abstract should include an outline of the planned talk, and pointers to relevant bibliography. - Talk proposals presenting work that is unpublished or in progress. - Submissions which describe novel applications of QBF or related formalisms in various domains are particularly welcome. Additionally, this call comprises known applications which have been shown to be hard for QBF solvers in the past as well as new applications for which present QBF solvers might lack certain features still to be identified. Each submission should have an overall length of 1-4 pages in LNCS format. Authors may decide to include an appendix with additional material. Appendices will be considered at the reviewers' discretion. The accepted extended abstracts will be published on the workshop webpage. The workshop does not have formal proceedings. Authors of accepted contributions are expected to give a talk at the workshop. ======= CONTACT ======= qbf19(a)easychair.org =============================== PROGRAM CHAIRS AND ORGANIZATION =============================== Hubie Chen, Birbeck, University of London Florian Lonsing, Stanford University Martina Seidl, University of Linz, Austria Friedrich Slivovsky, TU Wien, Austria

5 years, 5 months

1
0
0 0

FroCoS and TABLEAUX 2019 (London): SECOND (AND FINAL) DEADLINE EXTENSION

by Andrei Popescu

Dear potential authors and registered authors who wish to polish your submissions, We have decided to issue a second (and final) deadline extension of four days for the 2019 joint editions of the FroCoS and TABLEAUX conferences. The new deadlines are: 10 May 2019 (abstract), 12 May 2019 (paper) We hope to see many of you this September in London! Best wishes, Serenella Cerrito, Andreas Herzig, Andrei Popescu and Franco Raimondi (PC chairs and local organizers) Conference websites: https://frocos2019.org, https://www.tableaux2019.org Contact: chair(a)frocos2019.org, chair(a)tableaux2019.org

5 years, 5 months

1
0
0 0

CfP: AIRLangComp'19: AI aspects in Reasoning, Languages, and Computation 2019

by Roussanka Loukanova

CALL FOR PAPERS 4th International Workshop on AI aspects in Reasoning, Languages, and Computation 2019 (AIRLangComp'19) https://www.fedcsis.org/2019/airlangcomp Leipzig, Germany, 1 - 4 September, 2019 There is general realization that computational models of human reasoning can be improved by integration of heterogeneous resources of information and AI techniques, e.g., multidimensional diagrams, images, language, syntax, semantics, memory. While the event targets promotion of integrated computational approaches, we invite contributions from any individual area related to information, formal and natural languages, computation, reasoning. Topics We welcome submissions of papers on the following topics, without limiting to them, across approaches, methods, theories, and applications: - Reasoning systems --- theories and applications - Proof systems and model checkers - Theories of computation and information - Interactive computation and reasoning - Computation and reasoning with heterogeneous information - Space and time in information, language, computation, reasoning, and memory - Partiality, underspecification, vagueness, and possibilities - Computation and reasoning with heterogeneous or inconsistent information - Logic and (formal and natural) language --- approaches, theories, methods - Logic approaches to computational linguistics - Computational morphology, syntax, semantics, and interfaces between these - Constraint-based and type-theoretic approaches to grammar - Multilingual processing - Logic and theories of computation in machine learning and information retrieval - Mathematics for computational linguistics and cognitive science - Reasoning, information, computation, and memory in computational neuroscience and life sciences - Interdisciplinary approaches to language, computation, reasoning, memory Important Dates - Paper submission (sharp / no extension): May 14, 2019 - Position paper submission: June 4, 2019 - Author notification: June 25, 2019 - Final paper submission and registration: July 10, 2019 - Final deadline for discounted fee: August 1, 2019 -Conference date: September 1-4, 2019 Paper Submission and Publications The publication rules, status, and the submission page for AIRLangComp'19 are the same as for AAIA'19 | FedCSIS: https://www.fedcsis.org/2019/instructions https://www.fedcsis.org/2019/airlangcomp Paper Submission - Authors should submit draft papers (as Postscript, PDF or MSWord file) - The total length of a paper should not exceed 10 pages IEEE style (including tables, figures and references). IEEE style templates are available here - Papers will be refereed and accepted on the basis of their scientific merit and relevance to the workshop - Preprints containing accepted papers will be published on a USB memory stick provided to the FedCSIS participants - Only papers presented at the conference will be published in Conference Proceedings and submitted for inclusion in the IEEE Xplore® database -Conference proceedings will be published in a volume with ISBN, ISSN and DOI numbers and posted at the conference WWW site - Conference proceedings will be indexed in BazEkon and submitted for indexation in: Thomson Reuters - Conference Proceedings Citation Index, SciVerse Scopus, Inspec, Index Copernicus, DBLP Computer Science Bibliography and Google Scholar - Extended versions of selected papers presented during the conference will be published as Special Issue(s) - Organizers reserve right to move accepted papers between FedCSIS events Event Chairs - Grabowski, Adam, Institute of Informatics, University of Bialystok, Bialystok, Poland - Loukanova, Roussanka, Stockholm University, Sweden - Schwarzweller, Christoph, Institute of Informatics, University of Gdansk, Poland Contact: airlangcomp2019(a)fedcsis.org -------------------------------------------------------------

5 years, 5 months

1
0
0 0

2024

2023

2022

2021

2020

2019

2018

finite-model-theory May 2019