International Conference on Database Theory (ICDT) 2022 will take place from 29th March to 1st April, 2022 in virtual Edinburgh, UK. It will feature an excellent scientific programme, including keynotes and invited talks jointly with EDBT 2022, and research papers.

Invited talks:

Marcelo Arenas: Counting the Solutions to a Query (joint EDBT/ICDT Keynote)

Hung Ngo: On an Information Theoretic Approach to Cardinality Estimation (joint EDBT/ICDT Keynote)

Seung-won Hwang: Interactive Learning for Language-- Data Intelligence to the Rescue (joint EDBT/ICDT Keynote)

Peter Boncz: The (sorry) State of Graph Database Systems (joint EDBT/ICDT Keynote)

Moshe Y. Vardi: Logical Algorithmics (EDBT Invited Talk)

Nofar Carmeli: Answering Unions of Conjunctive Queries with Ideal Time (ICDT Invited Tutorial)

Accepted papers (from both submission cycles, in no particular order):

Brecht Vandevoort, Bas Ketsman, Christoph Koch and Frank Neven: Robustness against Read Committed for Transaction Templates with Functional Constraints

Martin Raszyk, David Basin, Srdjan Krstic and Dmitriy Traytel: Practical Relational Calculus Query Evaluation

Gaetano Geck, Jens Keppeler, Thomas Schwentick and Christopher Spinrath: Rewriting with Acyclic Queries: Mind your Head

Sam M. Thompson and Dominik D. Freydenberger: Splitting Spanner Atoms: A Tool for Acyclic Core Spanners

Yufei Tao: Parallel Acyclic Joins with Canonical Edge Covers

Martín Muñoz and Cristian Riveros: Streaming Enumeration on Nested Documents

Sarah Kleest-Meißner, Rebecca Sattler, Markus L. Schmid, Nicole Schweikardt and Matthias Weidlich: Discovering Event Queries from Traces: Laying Foundations for Subsequence-Queries with Wildcards and Gap-Size Constraints

Jingfan Meng, Huayi Wang, Jun Xu and Mitsunori Ogihara: A Dyadic Simulation Approach to Efficient Range-Summability

Shay Gershtein, Uri Avron, Ido Guy, Tova Milo and Slava Novgorodov: On the Hardness of Category Tree Construction

Austen Z. Fan and Paraschos Koutris: Certifiable Robustness for Nearest Neighbor Classifiers

Florent Capelli, Nicolas Crosetti, Joachim Niehren and Jan Ramon: Linear Programs with Conjunctive Queries

Raghavendra Addanki, Andrew McGregor, Alexandra Meliou and Zafeiria Moumoulidou: Improved Approximation and Scalability for Fair Max-Min Diversification

Cristina Feier: Characterising Fixed Parameter Tractability for Query Evaluation Over Guarded TGDs

Maximilian Marx and Markus Krötzsch: Tuple-Generating Dependencies Capture Complex Values

Sławek Staworko, Benoit Groz, Aurélien Lemay and Piotr Wieczorek: Inference of Shape Graphs for Graph Databases

Bart Bogaerts, Maxime Jakubowski and Jan Van den Bussche: Expressiveness of SHACL features

*******************************************************
* PostDoc position in Computer Science Logic
* University of Sheffield, UK
* Salary: £32,344 to £40,927 per annum (Grade 7)
* Deadline: 3rd January 2022
* Starting date: ASAP / negotiable
* Duration: Until 31.10.2023 (very likely extension to a total of 26 months)
* Details: https://www.jobs.ac.uk/job/CLB973/research-associate-in-computer-science-logic
*******************************************************

I am looking for a PostDoc to join the Verification group (https://www.sheffield.ac.uk/dcs/research/groups/verification) of The University of Sheffield (https://www.sheffield.ac.uk/dcs ) to work with me in my DFG funded project "Logical approach to quantum mechanics and contextuality" (http://www.virtema.fi/dfg).

The project relates to logical foundations of probabilistic data, complexity theory utilising real numbers, and logical approach to quantum information theory utilising the newly discovered connections to probabilistic team semantics. Candidates with expertise in finite model theory, logic in computer science, or foundations of quantum information theory are in particular encouraged to apply.

Interested candidates are encouraged to contact me directly by email for further details (j.t.virtema@sheffield.ac.uk). For more details on the topic, the candidate may refer to the subsection “Probabilistic Logics and Metafinite Model Theory” at http://www.virtema.fi/.

Full advert in https://www.jobs.ac.uk/job/CLB973/research-associate-in-computer-science-logic.
 

*******************************************************
* PhD position in Logical Approach to Verification of Hyperproperties
* University of Sheffield, UK
* Fully funded for 3.5 years for students applicable for UK Home rates
* Possible times to start: ASAP/Spring 2022/Autumn 2022
*******************************************************

I am looking for a motivated PhD student to join the Verification group (https://www.sheffield.ac.uk/dcs/research/groups/verification) of The University of Sheffield (https://www.sheffield.ac.uk/dcs). The topic of the PhD project is quite flexible, but should relate to logical theory of verification (for more details: https://www.jobs.ac.uk/job/CLH126/phd-studentship-logical-approach-to-verification-of-hyperproperties).

The Studentship will cover tuition fees at the UK rate and provide a tax-free stipend at the standard UKRC rate (currently £15,609 for 2021/22) for three and a half years. International students are eligible to apply, however will have to pay the difference between the UK and Overseas tuition fees.

Interested candidates are encouraged to contact me directly by email for further details (j.t.virtema@sheffield.ac.uk). For more details on the topic, the candidate may refer to the subsection "Logics for Verification" at http://www.virtema.fi/

CALL FOR PAPERS
26th International Conference on Database Theory (ICDT 2023)

ICDT is an international conference series on the principles and theory of data management. Since 2009, it is annually and jointly held with EDBT, the International Conference on Extending Database Technology. See also https://databasetheory.org/icdt-pages. 

The 26th edition of ICDT takes place in Ioannina, Greece, from  28–31 March 2023 (http://edbticdt2023.cs.uoi.gr/)

Topics of Interest

We welcome research papers on *every* topic related to the principles and theory of data management, provided that there is a clear connection to foundational aspects. This includes, for example, articles on "classical" data management topics such as:

-  The design and study of data models and query languages;
-  The development and analysis of algorithms for data management;
-  The theoretical investigation of various aspects underlying data management systems (indexes, concurrency, distributed computation, privacy and security, ...),

but also includes papers exploring existing or identifying new connections between data management and other areas, such as the areas of:

-  knowledge representation, semantic web;
-  information retrieval and data mining;
-  machine learning;
-  distributed computing;
-  theoretical computer science.

In all of the above, a clear emphasis on foundational aspects is expected. You may want to check https://dblp.org/db/conf/icdt/index.html to get an overview of previous editions of ICDT. The Program Committee reserves the right to desk reject a submission when it is regarded to be out of scope.

Submission Cycles and Dates

ICDT has two submission cycles, the first providing the possibility of a revision.

FIRST SUBMISSION CYCLE:

March 14, 2022 (AoE): Abstract submission deadline
March 21, 2022 (AoE): Paper submission deadline
May 20, 2022: Notification

SECOND SUBMISSION CYCLE:

September 14, 2022 (AoE): Abstract submission deadline
September 21, 2022 (AoE): Paper submission deadline
November 20, 2022: Notification

Submission Instructions

All submissions will be electronic via Easychair at
https://easychair.org/my/conference?conf=icdt2023.

Papers must be written in English and provide sufficient detail to allow the program committee to assess their merits. The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia, workshops, and journals.

Papers must be submitted as PDF documents, using the LIPIcs style (http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors). Paper length is limited to 15 pages excluding references. Additional details may be included in a clearly marked appendix which will be read at the discretion of the program committee. Online appendices are not allowed. Papers that do not conform to these requirements may be rejected without further consideration.

The proceedings will appear under an open access license in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. More specifically, all articles in LIPIcs are published under a Creative Commons Attribution (CC-BY) license. Thereby, the authors retain their copyrights and readers can re-use the published work in the most meaningful manner. The proceedings will also appear in Scopus.

At least one author of each accepted paper is expected to register at the conference and present the paper.

Program Committee

Program Committee Chair:

• Floris Geerts (University of Antwerp)

Program Committee Members:

• Sepehr Assadi (Rutgers University)

• Vaishak Belle (The University of Edinburgh)

• Leopoldo Bertossi (Universidad Adolfo Ibanez)

• Graham Cormode (The University of Warwick)

• Ahmet Kara (University of Zurich)

• Batya Kenig (Technion, Israel Institute of Technology)

• Bas Ketsman (Vrije Universiteit Brussel)

• Ester Livshits (The University of Edinburgh)

• Wim Martens (University of Bayreuth)

• Liat Peterfreund (CNRS, Université Gustave Eiffel)

• Reinhard Pichler (Vienna University of Technology)

• Andreas Pieris (University of Cyprus, The University of Edinburgh)

• Marcin Przybyłko (University of Leipzig)

• Juan L. Reutter (Pontificia Universidad Católica)

• Sudeepa Roy (Duke University)

• Jef Wijsen (University of Mons)

• Ke Yi (Hong Kong University of Science and Technology)

• Thomas Zeume (Ruhr-Universität Bochum)

Proceedings Chair:

• Brecht Vandevoort (Hasselt University)

Awards

An award will be given to the Best Paper and to the Best Newcomer Paper where `newcomer' refers to the field of database theory. The latter award will preferentially be given to a paper authored only by students and in that case be called Best Student-Paper Award. The program committee reserves the right to not give any award and to split an award among several papers. Papers co-authored by program committee members are not eligible for an award.

A more traditional list of topics (not exclusive): ICDT welcomes papers on any topic related to principles of data management such as, for example, data mining, information extraction, information retrieval, database aspects of machine learning, distributed and parallel databases, cloud computing, graph databases, (semantic) Web data, web services, data streams, sketching, data-centric (business) process management and workflows, data and knowledge integration and exchange, data provenance, views, data warehouses, domain-specific databases (multimedia, scientific, spatial, temporal, text), data privacy and security, concurrency, and recovery.

As of December 1st, the new journal TheoretiCS is now open for submissions! The goal of TheoretiCS is to be a venue for the highest-quality papers in all areas of theoretical computer science, including database theory.

The journal is open-access: the articles are hosted on arXiv and are free to read, the reviewing process is hosted on the Episciences platform, publication is also free for authors, and the journal title belongs to a non-profit created for the occasion. In addition to this, the journal will also ensure a quick turnaround time of less than three months for a first opinion on submitted papers.

The journal has an impressive editorial board, featuring in particular Georg Gottlob and Mihalis Yannakakis as editors in databases. The journal also has an advisory board formed of representatives of the major TCS conferences, featuring Wim Martens to represent ICDT. The initiative is also endorsed by Noga Alon, Shafi Goldwasser, Donald E. Knuth, Robert E. Tarjan, Leslie Valiant, Moshe Y. Vardi, and Andrew C.-C. Yao.

I encourage you to support the initiative by submitting your best work in our new journal!