April 2020 - finite-model-theory - lists.rwth-aachen.de

Computability in Europe 2020 SECOND CALL FOR INFORMAL PRESENTATIONS
by acie＠acie.eu 27 Apr '20

27 Apr '20

COMPUTABILITY IN EUROPE 2020 SECOND CALL FOR INFORMAL PRESENTATIONS CiE 2020: Virtually in Salerno, Italy Due to the Covid-19 outbreak, this edition will be an online conference. June 29 - July 3, 2020 https://www.acie.eu/cie-conference-series/cie2020 https://www.acie.eu IMPORTANT DATES: Deadline for informal presentations submission: 31 May 2020 (The notifications of acceptance for informal presentations will be sent a few days after submission.) CiE 2020 is the 16th conference organized by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017), Kiel (2018), and Durham (2019). TUTORIALS _Fine-Grained Complexity_ - Virginia Vassilevska Williams (MIT) _Computable Analysis_ - Martin Ziegler (Korea Advanced Institute of Science and Technology) INVITED TALKS: _Centralities in Network Analysis_ -- Paolo Boldi (University of Milan) _A game-theoretic approach for the automated synthesis of complex systems _-- Véronique Bruyère (University of Mons) On-the-fly classification of structures -- Ekatarina Fokina (Vienna University of Technology) _A Survey on Analog Models of Computation_ -- Amaury Pouly (CNRS Paris) _On the Repetitive Structure of Words_ -- Antonio Restivo (University of Palermo) _Molecular algorithms using reprogrammable DNA self-assembly_ -- Damien Woods (Maynooth University) HOSTED BY: Department of Computer Science, University of Salerno Due to the Covid-19 outbreak, this edition will be an online conference. SPECIAL SESSIONS: Algorithmic Learning Theory Combinatorial String Matching Computable Topology HAPOC session on Fairness in Algorithms Large scale Bioinformatics and Computational Sciences Modern aspects of Formal Languages Contributed papers will be selected from submissions received by the PROGRAMME COMMITTEE consisting of: Marcella Anselmo University of Salerno (co-chair) Veronica Becher Universidad de Buenos Aires Paola Bonizzoni University of Milano-Bicocca Laura Crosilla University of Oslo Liesbeth De Mol Université de Lille 3 Gianluca Della Vedova University of Milano-Bicocca Jérôme Durand-Lose Université d'Orléans Pawel Gawrychowski University of Wroclaw Mathieu Hoyrup LORIA Juliette Kennedy University of Helsinki Karoliina Lehtinen University of Liverpool Benedikt Loewe Universiteit van Amsterdam Florin Manea Universität Göttingen Timothy McNicholl Iowa State University Klaus Meer BTU Cottbus-Senftenberg Turlough Neary University of Zurich Daniel Paulusma Durham University Arno Pauly Swansea University (co-chair) Karin Quaas University of Leipzig Viola Schiaffonati Politecnico di Milano Markus L. Schmid Humboldt University Berlin Thomas Schwentick Universität Dortmund Marinella Sciortino University of Palermo Victor Selivanov Institute on Informatics Systems Mariya Soskova University of Wisconsin-Madison Peter Van Emde Boas Universiteit van Amsterdam Linda Brown Westrick Pennsylvania State University The CiE conferences serve as an interdisciplinary forum for research in all aspects of computability, foundations of computer science, logic, and theoretical computer science, as well as the interplay of these areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. Continuing the tradition of past CiE conferences, the Program Committee cordially invites all researchers (European and non-European) to submit informal presentations of their recent work. A proposal for an informal presentation must be submitted via EasyChair (https://easychair.org/conferences/?conf=cie2020), using the LNCS style file (available at https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…) and be 1 page; a brief description of the results suffices and an abstract is not required. Informal presentations will not be published in the LNCS conference proceedings. Results presented as informal presentations at CiE 2020 may appear or may have appeared in other conferences with formal proceedings and/or in journals.

1 0

Call for papers - SR 2020, Santiago de Compostela
by Bastien 23 Apr '20

23 Apr '20

Apologies for multiple reception of this message. ******************************************************************************* CALL FOR PAPERS 8TH INTERNATIONAL WORKSHOP ON STRATEGIC REASONING (SR 2020) Satellite workshop of ECAI 2020, Santiago de Compostela, Spain, June 8, 2020 ******************************************************************************* Strategic reasoning is a key topic in multi-agent systems research. The extensive literature in the field includes a variety of logics used for modeling strategic ability. Results from the field are now being used in many exciting domains such as information system security, adaptive strategies for robot teams, and automatic players capable to outperform human experts. A common feature in all these application domains is the requirement for sound theoretical foundations and tools accounting for the strategies that artificial agents may adopt in the situation of conflict and cooperation. The SR international workshop series aims at bringing together researchers working on different aspects of strategic reasoning in computer science, both from a theoretical and a practical point of view. SR 2020 will be held with ECAI 2020 in Santiago de Compostela, Spain. TOPICS OF INTEREST: The topics covered by SR include, but are not limited to, the following: - Logics for reasoning about strategic abilities; - Logics for multi-agent mechanism design, verification, and synthesis; - Logical foundations of decision theory for multi-agent systems; - Strategic reasoning in formal verification; - Automata theory for strategy synthesis; - Strategic reasoning under perfect and imperfect information; - Applications and tools for cooperative and adversarial reasoning; - Robust planning and optimisation in multi-agent systems; - Risk and uncertainty in multi-agent systems; - Quantitative aspects in strategic reasoning. SUBMISSIONS: We invite three types of submissions: (A) original contributions, (B) published work, and (C) challenging open problems. Each submission should be clearly identified as belonging to one of these three categories. In all three categories, submissions will be evaluated by the usual high standards of research publications. In particular, they should contain enough detail to allow the program committee to identify the main contribution of the work, to explain its significance, its novelty, its relevance to the strategic-reasoning audience, and its practical or theoretical implications, and include comparisons with and references to relevant literature. Strong preference will be given to contributions on topics of interest to a broad, interdisciplinary audience and all papers should be written so that they are accessible to such an audience. Submissions should be in PDF, preferably using the EPTCS style (http://style.eptcs.org), and not exceed 12 pages (not including bibliography). Authors are invited to submit their manuscript via EasyChair. Submission webpage: https://easychair.org/conferences/?conf=sr20200 IMPORTANT DATES: Paper submission: March 13, 2020 (AoE) Authors notification: April 15, 2020 Camera-ready deadline: May 15, 2020 Workshop: June 8, 2020 ORGANIZERS: Bastien Maubert, University of Naples "Federico II" (bastien.maubert(a)gmail.com) Nir Piterman, University of Gothenburg (nir.piterman(a)gmail.com) WEBSITE: http://bastien-maubert.fr/sr2020/

1 2

Graphical Models for Security (GraMSec 2020) - Deadline extended until May 4
by Barbara Fila (Kordy) 22 Apr '20

22 Apr '20

*The GraMSec submission deadline is extended to Monday, May 4.* Please find below the full CFP. ====================================================================== GraMSec 2020: The Seventh International Workshop on Graphical Models for Security http://gramsec.uni.lu June 22, 2020 *Online event* Co-located with CSF 2020 *LNCS post-proceedings confirmed* SCOPE The use of graphical security models to represent and analyse the security of systems has gained an increasing research attention over the last two decades. Formal methods and computer security researchers, as well as security professionals from the industry and government, have proposed various graphical security models, metrics, and measurements. Graphical models are used to capture different security facets and address a range of challenges including security assessment, automated defence, secure services composition, security policy validation, and verification. The International Workshop on Graphical Models for Security is an established scientific event dedicated to study and exchange of experiences on graphical security and safety modelling. TOPICS This year, we encourage excellent submissions related, but not restricted, to the following broad headings: 1. Graph representations: mathematical, conceptual, and implemented tools for describing and reasoning about security and safety 2. Logical approaches: formal logical tools for representing and reasoning about graphs and their use as modelling tools in security 3. Machine learning: modelling and reasoning about the role of big data and machine learning in security operations 4. Networks in national security: terrorist networks, counter-terrorism networks; safety in national infrastructure (e.g., utilities and transportation) 5. Risk analysis and management: models and graphical methodologies for security and privacy risk management in business and organisational architectures 6. Social networks: using and reasoning about social graphs, network analysis, network protocols, social mapping, sociometry. 7. Semantics: developing or studying semantic approaches to graph-based models used in security like set theoretic models, categorical models, logical models, etc. 8. Threat modelling: modelling and analysing software systems security, models for DevSecOps, etc. 9. Security requirements: models and tools for describing and analysing requirements on system security and privacy. 10. Visual security: modelling and analytics for security visualisations. 11. Secure systems: safe and secure system design, quantification of security/safety, models for system security/safety evaluation. We welcome a broad range of contributions: from theory to tools and experience reports. Preference will be given to papers likely to stimulate high-quality debate at the Workshop. SUBMISSION GUIDELINES We solicit two types of submissions: - Regular papers (up to 18 pages, excluding the bibliography and well-marked appendices) describing original and unpublished work within the scope of the workshop. - Short papers (up to 10 pages, excluding the bibliography and well-marked appendices) describing original and unpublished work in progress. The reviewers are not required to read the appendices, so the papers should be intelligible without them. All submissions must be prepared using the LNCS style. Each paper will undergo a thorough review process. Submissions should be made using the GraMSec 2020 EasyChair website: https://easychair.org/conferences/?conf=gramsec2020. PUBLICATION As in previous editions, we the post-proceedings will be published in the Lecture Notes in Computer Science (LNCS) series, published by Springer. Proceedings will be published after the workshop, thus permitting the authors to incorporate feedback. VENUE Due to the current coronavirus outbreak, the IEEE CSF Symposium and its associated workshops, including GraMSec, will be held online this year. Details about registration and participation will be soon made available. IMPORTANT DATES Given the situation and the fact that the workshop will be held online, we will keep only one submission deadline. - Paper submissions due: Monday, May 4, 2020 - Notifications: Friday, May 29, 2020 - Workshop: Monday, June 22, 2020 - Camera ready versions due: Friday, August 7, 2020 PROGRAM CHAIRS Harley Eades III, Augusta University, United States of America Olga Gadyatskaya, Leiden Institute of Advanced Computer Science, Leiden University, The Netherlands STEERING COMMITTEE Sushil Jajodia, George Mason University, United States of America Barbara Fila, INSA Rennes, IRISA, France Sjouke Mauw, University of Luxembourg, Luxembourg Christian W. Probst, Unitec, New Zealand Ketil Stølen, SINTEF Digital and University of Oslo, Norway PUBLICITY CHAIR Barbara Fila, INSA Rennes, IRISA, France WEB CHAIR Reynaldo Gil Pons, University of Luxembourg, Luxembourg

1 0

QBF 2020 - updated call for papers
by HUBERT MING CHEN 21 Apr '20

21 Apr '20

CALL FOR PAPERS QBF 2020 -------- International Workshop on Quantified Boolean Formulas and Beyond July 5, 2020 -- to be held virtually https://www.ac.tuwien.ac.at/qbf2020 Affiliated to and co-located with: Int. Conf. on Theory and Applications of Satisfiability Testing (SAT 2020) July 5-9, 2020 UPDATES: The workshop will be held virtually. The deadline has been extended by 2 weeks. ------------------------------------------------------------- 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 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. =============== IMPORTANT DATES =============== May 8: Submission May 26: Notification of acceptance June 11: Final versions of accepted papers due July 5: Workshop Please see the workshop webpage for any updates: https://www.ac.tuwien.ac.at/qbf2020 ====================== 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=qbf2020 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 ======= qbf2020(a)easychair.org ================= PROGRAM COMMITTEE ================= Hubie Chen, Birbeck, University of London (co-chair) Friedrich Slivovsky, Vienna University of Technology (co-chair) Joshua Blinkhorn, Friedrich-Schiller-Universität Jena Mikolas Janota, INESC-ID/IST, University of Lisbon Paqui Lucio, University of the Basque Country Stefan Mengel, CNRS, CRIL Tomáš Peitl, Friedrich-Schiller-Universität Jena Ralf Wimmer, Concept Engineering GmbH & Albert-Ludwigs-Universität Freiburg

1 0

LCC 2020: Second Call for Contributions (Update: Online edition, new date, and extended submission deadline)
by Thomas Zeume 17 Apr '20

17 Apr '20

(Apologies for cross posting.) =================================================================== Second Call for Contributions LCC 2020 21th International Workshop on Logic and Computational Complexity July 6, 2020, VIRTUAL (Saarbruecken, Germany) Collocated with LICS/ICALP 2020 http://www.cs.swansea.ac.uk/lcc/ ==================================================================== LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. The program will consist of invited lectures as well as contributed talks selected by the Program Committee. VIRTUAL EDITION: The LCC workshop is co-allocated with LICS/ICALP and as such will take place as a virtual event, due to the Covid-19 pandemic. The workshop has been moved to July 6 for this reason. Further details will be posted on the webpage as soon as the handling of the virtual LICS/ICALP conferences become clear. IMPORTANT DATES: All dates are AoE, extended because of COVID-19. * submission May 6, 2020 * notification May 27, 2020 * workshop July 6, 2020 SUBMISSION: Submissions must be in English and in the form of an abstract of about 3-4 pages. All submissions should be submitted through Easychair at: https://easychair.org/conferences/?conf=lcc20 We also welcome submissions of abstracts based on work submitted or published elsewhere, provided that all pertinent information is disclosed at submission time. There will be no formal reviewing as is usually understood in peer-reviewed conferences with published proceedings. The program committee checks relevance and may provide additional feedback. PROGRAM COMMITTEE: Martin Avanzini (INRIA Sophia Antipolis Méditerranée, France, co-chair) Diego Figueira (CNRS Bordeaux, France) Joanna Ochremiak (CNRS Bordeaux, France) Magdalena Ortiz (TU Wien, Austria) Thomas Seiller (CNRS Paris, France) Jakob Grue Simonsen (University of Copenhagen, Denmark) Thomas Zeume (Ruhr-Universität Bochum, Germany, co-chair) CONTACT: To contact the workshop organizers, please send an e-mail to lcc20(a)easychair.org

1 0

Workshop on Logics of Dependence and Independence (LoDE 2020V)
by Grädel, Erich 17 Apr '20

17 Apr '20

————————— NEW CALL FOR PAPERS Workshop on Logics of Dependence and Independence (LoDE 2020V) http://www.math.helsinki.fi/logic/LoDE2020/ Online (virtual), August 10-12, 2020 ===================================== COVID-19 UPDATE: This workshop was organized originally as part of ESSLLI 2020, which has now been postponed to 2021 due to the coronavirus outbreak. The organizing committee has decided to move the LoDE workshop online. ===================================== ===================================== *** SUBMISSION DEADLINE: May 8, 2020 *** ===================================== WORKSHOP DESCRIPTION ======================= Logics of dependence and independence are novel non-classical logics aiming at characterizing dependence and independence notions in sciences. This field of research has grown rapidly in recent years. The framework of the logics has found applications also in fields like database theory, linguistics, social choice, quantum physics and so on. This workshop will bring together researchers from all these relevant areas and provide a snapshot of the state of the art of logics of dependence and independence. SUBMISSION DETAILS =================== We invite submissions of 5-page extended abstracts of contributed talks. The submission deadline is **May 8, 2020**. Abstracts must be submitted electronically through EasyChair: https://easychair.org/conferences/?conf=lode2020. Selected papers of the workshop proceedings will be published (after a new round of reviewing) as a special issue of a scientific journal (to be confirmed). IMPORTANT DATES (NEW) ====================== + May 8, 2020: Deadline for paper submission + June 8, 2020: Notification of acceptance + June 22, 2020: Camera ready versions due + August 10-12, 2020: Workshop dates INVITED SPEAKERS ================= Alexandru Baltag (Amsterdam) Ivano Ciardelli (Munich) Pietro Galliani (Bolzano) WORKSHOP ORGANIZERS ====================== Jouko Väänänen (Helsinki) Fan Yang (Helsinki) PROGRAM COMMITTEE ==================== Valentin Goranko (Stockholm) Erich Grädel (Aachen) Miika Hannula (Helsinki) Lauri Hella (Tampere) Åsa Hirvonen (Helsinki) Antti Kuusisto (Helsinki) Eric Pacuit (Maryland) Jouko Väänänen (Helsinki) Jonni Virtema (Hokkaido) Heribert Vollmer (Hannover) Fan Yang (Helsinki) CONTACT

1 0

Certified Programs and Proofs (CPP) 2021: First Call for Papers
by Andrei Popescu 16 Apr '20

16 Apr '20

Certified Programs and Proofs (CPP) is an international conference on practical and theoretical topics in all areas that consider formal verification and certification as an essential paradigm for their work. CPP spans areas of computer science, mathematics, logic, and education. CPP 2021 (https://popl21.sigplan.org/home/CPP-2021) will be held on 18-19 January 2021 and will be co-located with POPL 2021. CPP 2021 is sponsored by ACM SIGPLAN, in cooperation with ACM SIGLOG. NEWS * Due to the COVID-19 situation, it is currently uncertain whether CPP 2021 will be a physical conference in Copenhagen, Denmark or a virtual one. * The submission deadline is one month earlier than usual. IMPORTANT DATES * Abstract Deadline: 16 September 2020 at 23:59 AoE (UTC-12h) * Paper Submission Deadline: 22 September 2020 at 23:59 AoE (UTC-12h) * Notification (tentative): 19 November 2020 * Camera Ready Deadline (tentative): 10 December 2020 * Conference: 18-19 January 2021 Deadlines expire at the end of the day, anywhere on earth. Abstract and submission deadlines are strict and there will be no extensions. TOPICS OF INTEREST We welcome submissions in research areas related to formal certification of programs and proofs. The following is a non-exhaustive list of topics of interest to CPP: * certified or certifying programming, compilation, linking, OS kernels, runtime systems, security monitors, and hardware; * certified mathematical libraries and mathematical theorems; * proof assistants (e.g, ACL2, Agda, Coq, Dafny, F*, HOL4, HOL Light, Idris, Isabelle, Lean, Mizar, Nuprl, PVS, etc); * new languages and tools for certified programming; * program analysis, program verification, and program synthesis; * program logics, type systems, and semantics for certified code; * logics for certifying concurrent and distributed systems; * mechanized metatheory, formalized programming language semantics, and logical frameworks; * higher-order logics, dependent type theory, proof theory, logical systems, separation logics, and logics for security; * verification of correctness and security properties; * formally verified blockchains and smart contracts; * certificates for decision procedures, including linear algebra, polynomial systems, SAT, SMT, and unification in algebras of interest; * certificates for semi-decision procedures, including equality, first-order logic, and higher-order unification; * certificates for program termination; * formal models of computation; * mechanized (un)decidability and computational complexity proofs; * formally certified methods for induction and coinduction; * integration of interactive and automated provers; * logical foundations of proof assistants; * applications of AI and machine learning to formal certification; * user interfaces for proof assistants and theorem provers; * teaching mathematics and computer science with proof assistants. SUBMISSION GUIDELINES Prior to the paper submission deadline, the authors should upload their anonymized paper in PDF format through the HotCRP system at https://cpp2021.hotcrp.com The submissions must be written in English and provide sufficient detail to allow the program committee to assess the merits of the contribution. They must be formatted following the ACM SIGPLAN Proceedings format using the acmart style with the sigplan option, which provides a two-column style, using 10 point font for the main text, and a header for double blind review submission, i.e., \documentclass[sigplan,10pt,anonymous,review]{acmart}\settopmatter{printfolios=true,printccs=false,printacmref=false} The submitted papers should not exceed 12 pages, including tables and figures, but excluding bibliography and clearly marked appendices. The papers should be self-contained without the appendices. Shorter papers are welcome and will be given equal consideration. Submissions not conforming to the requirements concerning format and maximum length may be rejected without further consideration. CPP 2021 will employ a lightweight double-blind reviewing process. To facilitate this, the submissions must adhere to two rules: (1) author names and institutions must be omitted, and (2) references to authors’ own related work should be in the third person (e.g., not "We build on our previous work ..." but rather "We build on the work of ..."). The purpose of this process is to help the PC and external reviewers come to an initial judgment about the paper without bias, not to make it impossible for them to discover the authors if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing it more difficult. In particular, important background references should not be omitted or anonymized. In addition, authors are free to disseminate their ideas or draft versions of their papers as usual. For example, authors may post drafts of their papers on the web or give talks on their research ideas. POPL has answers to frequently asked questions addressing many common concerns: https://popl20.sigplan.org/track/POPL-2020-Research-Papers#Submission-and-R… We encourage the authors to provide any supplementary material that is required to support the claims made in the paper, such as proof scripts or experimental data. This material must be uploaded at submission time, as an archive, not via a URL. Two forms of supplementary material may be submitted: (1) Anonymous supplementary material is made available to the reviewers before they submit their first-draft reviews. (2) Non-anonymous supplementary material is made available to the reviewers after they have submitted their first-draft reviews and have learned the identity of the authors. Please use anonymous supplementary material whenever possible, so that it can be taken into account from the beginning of the reviewing process. The submitted papers must adhere to the SIGPLAN Republication Policy (https://www.sigplan.org/Resources/Policies/Republication/) and the ACM Policy on Plagiarism (https://www.acm.org/publications/policies/plagiarism). Concurrent submissions to other conferences, journals, workshops with proceedings, or similar forums of publication are not allowed. The PC chairs should be informed of closely related work submitted to a conference or journal in advance of submission. One author of each accepted paper is expected to present it at the (possibly virtual) conference. PUBLICATION, COPYRIGHT AND OPEN ACCESS The CPP 2021 proceedings will be published by the ACM, and authors of accepted papers will be required to choose one of the following publication options: (1) Author retains copyright of the work and grants ACM a non-exclusive permission-to-publish license and, optionally, licenses the work under a Creative Commons license. (2) Author retains copyright of the work and grants ACM an exclusive permission-to-publish license. (3) Author transfers copyright of the work to ACM. For authors who can afford it, we recommend option (1), which will make the paper Gold Open Access, and also encourage such authors to license their work under the CC-BY license. ACM will charge you an article processing fee for this option (currently, US$700), which you have to pay directly with the ACM. For everyone else, we recommend option (2), which is free and allows you to achieve Green Open Access, by uploading a preprint of your paper to a repository that guarantees permanent archival such as arXiv or HAL. This is anyway a good idea for timely dissemination even if you chose option 1. Ensuring timely dissemination is particularly important for this edition, since, because of the very tight schedule, the official proceedings might not be available in time for CPP. The official CPP 2021 proceedings will also be available via SIGPLAN OpenTOC (http://www.sigplan.org/OpenTOC/#cpp). For ACM’s take on this, see their Copyright Policy (http://www.acm.org/publications/policies/copyright-policy) and Author Rights (http://authors.acm.org/main.html). PROGRAM COMMITTEE Cătălin Hriţcu, Inria Paris, France (co-chair) Andrei Popescu, Middlesex University London, UK (co-chair) Reynald Affeldt, National Institute of Advanced Industrial Science and Technology (AIST), Japan June Andronick, CSIRO's Data61 and UNSW, Australia Arthur Azevedo de Amorim, Carnegie Mellon University, USA Joachim Breitner, DFINITY Foundation, Germany Jesper Cockx, TU Delft, Netherlands Cyril Cohen, Université Côte d’Azur, Inria, France Nils Anders Danielsson, University of Gothenburg / Chalmers University of Technology, Sweden Brijesh Dongol, University of Surrey, UK Floris van Doorn, University of Pittsburgh, USA Yannick Forster, Saarland University, Germany Shilpi Goel, Centaur Technology, Inc., USA Chung-Kil Hur, Seoul National University, South Korea Moa Johansson, Chalmers University of Technology, Sweden Ekaterina Komendantskaya, Heriot-Watt University, UK Angeliki Koutsoukou-Argyraki, University of Cambridge, UK Robert Y. Lewis, Vrije Universiteit Amsterdam, Netherlands Hongjin Liang, Nanjing University, China Andreas Lochbihler, Digital Asset GmbH, Switzerland Petar Maksimović, Imperial College London, UK William Mansky, University of Illinois at Chicago, USA Anders Mörtberg, Stockholm University, Sweden Sam Owre, SRI International, USA Karl Palmskog, KTH Royal Institute of Technology, Sweden Johannes Åman Pohjola, CSIRO's Data61 / University of New South Wales, Australia Damien Pous, CNRS, ENS Lyon, France Tahina Ramananandro, Microsoft Research, USA Ilya Sergey, Yale-NUS College and National University of Singapore, Singapore Natarajan Shankar, SRI International, USA Kathrin Stark, Princeton University, USA René Thiemann, University of Innsbruck, Austria Amin Timany, Aarhus University, Denmark Josef Urban, Czech Technical University in Prague, Czech Republic Christoph Weidenbach, MPI-INF, Germany Freek Wiedijk, Radboud University Nijmegen, Netherlands Yannick Zakowski, University of Pennsylvania, USA CONTACT For any questions please contact the two PC chairs: Cătălin Hriţcu <catalin.hritcu(a)gmail.com>, Andrei Popescu <andrei.h.popescu(a)gmail.com>

1 0

UNILOG'2021: 7th World Congress and School on Universal Logic
by JY B 07 Apr '20

07 Apr '20

UNILOG 2021 - The 7th World Congress and School on Universal Logic - will take place at the Orthodox Academy of Crete March 28 - April 7, 2021 UNILOG is a series of events (combining a congress and a school) promoting - logic in all its aspects: mathematical, philosophical, computational, semiological, historical - the relation between logic and other fields: physics, biology, economics, law, politics, religion, music, literature, pedagogy, color theory, medicine, psychology, psychoanalysis, cognitive science, architecture, artificial intelligence, sociology, linguistics, anthropology. 7th UNIVERSAL LOGIC SCHOOL The school will have a duration of 5 days: from March 28 to April 1st 2021 with: - an opening round table on the topic "Why study logic?" - 30 tutorials - A poster session. 7th UNIVERSAL LOGIC CONGRESS The congress will have a duration of 6 days: from April 2 to April 7 2021 with - invited speakers - contributing speakers - workshops - a secret speaker (as in previous editions), i.e. a speaker whose identity is revealed only at the time of his/her/its talk or after - a contest 2nd WORLD LOGIC PRIZES CONTEST The 1st World Logic Prizes Contest took place in Vichy, France, during the 6th UNILOG in 2018. This contest is a competition between winners of logic prizes of different countries. To the winner is awarded the Universal Logic Prize. UNILOG 2021 is organized under the Aegis of the Government of Crete. Crete is an island with a history of about 5.000 years, cradle of Western civilization, including the Labyrinth, Plato's cave and much more. Everybody is welcome to join and enjoy this wonderful place. UNILOG 2021 - The 7th World Congress and School on Universal Logic https://www.uni-log.org/

1 0

[CfP] ICLP2020 -The 36th International Conference on Logic Programming
by Laura Pandolfo 06 Apr '20

06 Apr '20

[Apologies for cross-posting] *IMPORTANT NOTE: We are continuously monitoring the COVID-19 situation from local authorities and the World Health Organization. ICLP 2020 is half a year away, and we are confident that COVID-19 emergency will pass over and the conference will be held in September, as planned. And, if necessary, alternative solutions, such as postponement, remote presentations, etc will be looked into and identified.* *** Call for Papers *** ICLP 2020 The 36th International Conference on Logic Programming September 18 - September 24, 2020 University of Calabria, Rende, Italy https://iclp2020.unical.it The 36th International Conference on Logic Programming (ICLP 2020) will take place from the 18th to the 24nd of September 2020 in Rende (CS), Italy, with the main program starting immediately after the sister conference KR 2020. Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming. Scope ===== Contributions are solicited in all areas of logic programming and related areas, including but not restricted to: • Foundations: Semantics, Formalisms, Answer-Set Programming, Non-monotonic Reasoning, Knowledge Representation. • Declarative Programming: Inference engines, Analysis, Type and mode inference, Partial evaluation, Abstract interpretation, Transformation, Validation, Verification, Debugging, Profiling, Testing, Logic-based domain-specific languages, constraint handling rules. • Related Paradigms and Synergies: Inductive and Co-inductive Logic Programming, Constraint Logic Programming, Interaction with SAT, SMT and CSP solvers, Logic programming techniques for type inference and theorem proving, Argumentation, Probabilistic Logic Programming, Relations to object-oriented and Functional programming, Description logics, Neural-Symbolic Machine Learning, Hybrid Deep Learning and Symbolic Reasoning. • Implementation: Concurrency and distribution, Objects, Coordination, Mobility, Virtual machines, Compilation, Higher Order, Type systems, Modules, Constraint handling rules, Meta-programming, Foreign interfaces, User interfaces. • Applications: Databases, Big Data, Data Integration and Federation, Software Engineering, Natural Language Processing, Web and Semantic Web, Agents, Artificial Intelligence, Bioinformatics, Education, Computational life sciences, Education, Cybersecurity, and Robotics. Tracks and Special Sessions =========================== Besides the main track, ICLP 2020 will host additional tracks and special sessions: • Applications Track: This track invites submissions of papers on emerging and deployed applications of LP, describing all aspects of the development, deployment, and evaluation of logic programming systems to solve real-world problems, including interesting case studies and benchmarks, and discussing lessons learned. • Sister Conferences and Journal Presentation Track: This track provides a forum to discuss important results related to logic programming that appeared recently (from January 2017 onwards) in selective journals and conferences but have not been previously presented at ICLP. • Special Session: Women in Logic Programming: This special session will include invited talks and presentations by women in logic programming. • Research Challenges in Logic Programming Track: This track invites submissions of papers describing research challenges that an individual researcher or a research group is currently attacking. The goal of the track is to promote discussions, exchange of ideas, and possibly stimulate new collaborations. Papers submitted to this track do not go through the usual review and will not be published in the proceedings – they will be distributed at the conference as a technical report. Every of the above four tracks will have its own dedicated chairs, PC, evaluation criteria, and CFP with related submission details (see the specific call for papers). In addition to the presentations of accepted papers, the technical program will include invited talks, advanced tutorials, the doctoral consortium, and several workshops. Submission Details ================== All submissions must be made via the EasyChair conference system: https://easychair.org/conferences/?conf=iclp20200. Regular papers must be in the condensed TPLP format (template here) and not exceed 14 pages including bibliography. Regular papers may be supplemented with appendices for proofs and details of datasets which do not count towards the page limit and which will not be made available as appendices to the published paper. Three kinds of regular papers will be accepted: • Technical papers for technically sound, innovative ideas that can advance the state of logic programming; • Application papers that impact interesting application domains; • System and tool papers which emphasize novelty, practicality, usability, and availability of the systems and tools described. Application, system, and tool papers need to be clearly marked in their title. All submissions must be written in English and describe original, previously unpublished research, and must not simultaneously be submitted for publication elsewhere. These restrictions do not apply to previously accepted workshop papers with a limited audience and/or without archival proceedings. Papers of the highest quality will be selected to be published in the journal of Theory and Practice of Logic Programming (TPLP), Cambridge University Press (CUP). In order to ensure the quality of the final version, papers may be subject to more than one round of refereeing (within the decision period). The program committee may recommend some regular papers to be published as Technical communications in EPTCS format (http://info.eptcs.org). Technical communications must not exceed 14 pages, including the bibliography. The authors of the technical communications can also elect to convert their submissions into extended abstracts, of 2 or 3 pages, for inclusion in the EPTCS proceedings. This should allow authors to submit a long version elsewhere. All regular papers and technical communications will be presented during the conference. So, at least one author per accepted paper is expected to register and attend the conference. Authors of accepted papers will, by default, be automatically included in the list of ALP members, who will receive quarterly updates from the Logic Programming Newsletter at no cost. Important Dates =============== Abstract registration (regular papers): May 8, 2020 Paper submission (regular paper): May 15, 2020 Notification to authors (regular paper): June 19, 2020 Paper Submission (short papers): June 30, 2020 Revision submission (TPLP papers): July 6, 2020 Final notifications (TPLP papers): July 17, 2020 Camera-ready copy due: July 27, 2020 Main Conference starts: September 19, 2020 Autumn School on Logic Programming ================================== A school on logic programming will be held before the conference. More up to date information is available at the school web page. Doctoral Consortium =================== The 16th Doctoral Consortium (DC) on Logic Programming provides students with the opportunity to present and discuss their research directions, and to obtain feedback from both peers and experts in the field. Accepted participants will receive partial financial support to attend the event and the main conference. The best paper from the DC will be given the opportunity to make a presentation in a session of the main ICLP conference. The DC will have its own CFP, including the submission details. For information, please visit the DC Web Page. Workshops ========= The ICLP 2020 program will include several workshops. They are perhaps the best places for the presentation of preliminary work, underdeveloped novel ideas, and new open problems to an interested audience with opportunities for intensive discussions and project collaborations. Tutorials ========= The ICLP 2020 program will include several tutorials. They offer the participants, reviews of specific subfields as well as hands-on sessions by leading experts. Conference Organization ======================= General Chairs: • Sergio Greco, University of Calabria, Italy • Nicola Leone, University of Calabria, Italy Program Chairs: • Francesco Ricca, University of Calabria, Italy • Alessandra Russo, Imperial College London Organizing Chairs: • Marco Calautti, University of Calabria, Italy • Carmine Dodaro, University of Calabria, Italy Publicity Chair: • Laura Pandolfo, University of Sassari, Italy -- -- *Dona il 5x1000* all'Università degli Studi di Sassaricodice fiscale: 00196350904

1 0

QBF 2020 - Call for papers
by HUBERT MING CHEN 05 Apr '20

05 Apr '20

CALL FOR PAPERS QBF 2020 -------- International Workshop on Quantified Boolean Formulas and Beyond Alghero, Italy, July 5, 2020 https://www.ac.tuwien.ac.at/qbf2020 Affiliated to and co-located with: Int. Conf. on Theory and Applications of Satisfiability Testing (SAT 2020) July 5-9, 2020, Alghero, Italy ** The workshop/conference organization is monitoring the COVID-19 situation, and we hope to do our best to support the form of dialogue that this workshop aims to promote. For now, we would encourage those interested in submitting to the workshop to proceed in doing so; given the situation, we plan to give authors of accepted works a chance to confirm their willingness to participate prior to finalizing this. ------------------------------------------------------------- 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 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. =============== IMPORTANT DATES =============== April 24: Submission May 12: Notification of acceptance May 28: Final versions of accepted papers due July 5: Workshop Please see the workshop webpage for any updates: https://www.ac.tuwien.ac.at/qbf2020 ====================== 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=qbf2020 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 ======= qbf2020(a)easychair.org ================= PROGRAM COMMITTEE ================= Hubie Chen, Birbeck, University of London (co-chair) Friedrich Slivovsky, Vienna University of Technology (co-chair) Joshua Blinkhorn, Friedrich-Schiller-Universität Jena Mikolas Janota, INESC-ID/IST, University of Lisbon Paqui Lucio, University of the Basque Country Stefan Mengel, CNRS, CRIL Tomáš Peitl, Friedrich-Schiller-Universität Jena Ralf Wimmer, Concept Engineering GmbH & Albert-Ludwigs-Universität Freiburg

1 0