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

LearnAut 2024 First Call for Participation (In-Person ICALP/LiCS/FSCD workshop) – Early registration deadline May 17
by Sammartino, Matteo 15 May '24

15 May '24

*Apologies for eventual multiple receptions* The 5th workshop on Learning & Automata - satellite of ICALP/LiCS/FSCD 2024 https://learnaut24.github.io/ July 7th 2024, Tallinn Location: Astra building on the campus of Tallinn University, Tallinn,Estonia . This event will be conducted in person in Tallinn. Registration is mandatory (please find the corresponding links here: https://compose.ioc.ee/icalp2024/#registration). Please note that early-bird registration closes on May 17. It is our pleasure to inform you about LearnAut 2024, the fifth edition of the workshop, co-located with ICALP, LiCS and FSCD. Learning models defining recursive computations, like automata and formal grammars, are the core of the field called Grammatical Inference (GI). The expressive power of these models and the complexity of the associated computational problems are major research topics within mathematical logic and computer science. Historically, there has been little interaction between the GI and ICALP communities, though recently some important results started to bridge the gap between both worlds, including applications of learning to formal verification and model checking, and (co-)algebraic formulations of automata and grammar learning algorithms. The goal of this workshop is to bring together experts on logic who could benefit from grammatical inference tools, and researchers in grammatical inference who could find in logic and verification new fruitful applications for their methods. The LearnAut workshop will consist of 3 invited talks and 9 contributed talks from researchers whose submitted works were selected after peer reviewing. An important amount of time will be kept for interactions between participants. ** Invited Speakers ** * Bernhard Aichernig, TU Graz, Austria * Martin Berger, University of Sussex, UK * Ryan Cotterell, ETH Zürich, Switzerland ** Selected papers ** * Learning EFSM Models with Registers in Guards, by German Vega, Michael Foster, Roland Groz, Neil Walkinshaw, Catherine Oriat, and Adenilso Simao * Small Test Suites for Active Automata Learning, by Loes Kruger, Sebastian Junges, and Jurriaan Rot * Learning Closed Signal Flow Graphs, by Ekaterina Piotrovskaya, Leo Lobski, and Fabio Zanasi * PDFA Distillation via String Probability Queries, by Robert Baumgartner and Sicco Verwer * Database-assisted automata learning, by Hielke Walinga, Robert Baumgartner, and Sicco Verwer * Output-decomposed Learning of Mealy Machines, by Rick Koenders and Joshua Moerman * Analyzing constrained LLM through PDFA-learning, by Matías Carrasco, Franz Mayr, Sergio Yovine, Johny Kidd, Martín Iturbide, Juan da Silva, and Alejo Garat * A Theoretical Analysis of the Incremental Counting Ability of LSTM in Finite Precision, by Volodimir Mitarchuk and Rémi Eyraud * DFAMiner: Mining minimal separating DFAs from labelled samples, by Daniele Dell'Erba, Yong Li, and Sven Schewe ** Organizers ** Sophie Fortz (King's College London, UK) Franz Mayr (Universidad ORT Uruguay, UY) Joshua Moerman (Open Universiteit, Heerlen, NL) Matteo Sammartino (Royal Holloway, University of London, UK) This email, its contents and any attachments are intended solely for the addressee and may contain confidential information. In certain circumstances, it may also be subject to legal privilege. Any unauthorised use, disclosure, or copying is not permitted. If you have received this email in error, please notify us and immediately and permanently delete it. Any views or opinions expressed in personal emails are solely those of the author and do not necessarily represent those of Royal Holloway, University of London. It is your responsibility to ensure that this email and any attachments are virus free.

1 0

FSCD 2024: Call for Participation (early registration deadline: *May
by Carsten Fuhs 14 May '24

14 May '24

============================================================================== CALL FOR PARTICIPATION Ninth International Conference on Formal Structures for Computation and Deduction (FSCD 2024) July 10-13, 2024, Tallinn, Estonia https://fscd-conference.org/2024 FSCD 2024 will be co-located with ICALP 2024 and LICS 2024. https://compose.ioc.ee/icalp2024/ https://lics.siglog.org/lics24/ OVERVIEW -------- FSCD (https://fscd-conference.org/) 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 logic, models of computation, semantics and verification in new challenging areas. REGISTRATION ------------ The registration page for the conferences is already open and linked from: https://compose.ioc.ee/icalp2024/#registration This link should be used also to register for affiliated workshops. The early registration deadline is *** May 17, 2024 ***. FSCD 2024 is co-located with ICALP 2024 (July 8-12, 2024) and LICS 2024 (July 8-11, 2024), and special rates are available for joint registration to the conferences. INVITED SPEAKERS ---------------- Information about the invited speakers is here: https://compose.ioc.ee/icalp2024/#invited - Delia Kesner, Université Paris Cité - Bettina Könighofer, TU Graz - Sebastian Ullrich, Lean FRO - Stephanie Weirich, University of Pennsylvania (joint ICALP/LICS/FSCD speaker) ACCEPTED PAPERS --------------- The list of accepted papers is here: https://cs.ioc.ee/fscd24/accepted.html AFFILIATED WORKSHOPS -------------------- The following workshops are affiliated with FSCD, ICALP, and LICS in 2024: https://compose.ioc.ee/icalp2024/#workshops - Parameterized Approximation Algorithms Workshop (PAAW 2024) - July 6, 2024 - Trends in Arithmetic Theories (TAT 2024) - July 6, 2024 - Geometric and Topological Methods in Computer Science (GETCO 2024) - July 6-7, 2024 - Algorithmic Aspects of Temporal Graphs VII (AATG 2024) - July 7, 2024 - Learning and Automata (LearnAut 2024) - July 7, 2024 - Logic Mentoring Workshop (LMW 2024) - July 7, 2024 - Parameterized Algorithms and Constraint Satisfaction (PACS 2024) - July 7, 2024 - Structure meets Power (SmP 2024) - July 7, 2024 - Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2024) - July 8, 2024 - Mathematically Structured Functional Programming (MSFP 2024) - July 8, 2024 - Eighth International Workshop on Trends in Linear Logic and Applications (TLLA 2024) - July 8-9, 2024 - Intersection Types and Related Systems (ITRS 2024) - July 9, 2024 - International Workshop on Confluence (IWC 2024) - July 9, 2024 - Women in Logic 2024 - July 9, 2024 PROGRAM COMMITTEE CHAIR ----------------------- Jakob Rehof, TU Dortmund University PROGRAM COMMITTEE ----------------- Thorsten Altenkirch, University of Nottingham Sandra Alves, University of Porto Takahito Aoto, Niigata University Mauricio Ayala-Rincón, Brasilia University Stephanie Balzer, CMU Thierry Coquand, University of Gothenburg Alejandro Díaz-Caro, Quilmes National University & CONICET-Buenos Aires University Claudia Faggian, CNRS, Université de Paris Silvia Ghilezan, University of Novi Sad Simon Gay, University of Glasgow Cezary Kaliszyk, University of Innsbruck Ambrus Kaposi, Eötvös Loránd University, Budapest Dexter Kozen, Cornell University Dominique Larchey-Wendling, CNRS, Loria Marina Lenisa, University of Udine Sonia Marin, University of Birmingham Naoki Nishida, Nagoya University Christine Paulin-Mohring, Paris-Saclay University Pierre-Marie Pédrot, Inria Rennes-Bretagne-Atlantique Elaine Pimentel, University College London Jakob Rehof (Chair), TU Dortmund University Simona Ronchi della Rocca, University of Torino Sylvain Schmitz, Université Paris Cité Aleksy Schubert, University of Warsaw Jakob Grue Simonsen, University of Copenhagen Kathrin Stark, Heriot-Watt University, Edinburgh Lutz Straßburger, Inria Saclay Tachio Terauchi, Waseda University Sarah Winkler, Free University of Bolzano CONFERENCE CHAIR ---------------- Niccolò Veltri, Tallinn University of Technology WORKSHOP CHAIR -------------- Luigi Liquori, Inria STEERING COMMITTEE WORKSHOP CHAIR --------------------------------- Cynthia Kop, Radboud University Nijmegen PUBLICITY CHAIR --------------- Carsten Fuhs, Birkbeck, University of London FSCD STEERING COMMITTEE ----------------------- Herman Geuvers (Chair), Radboud University Nijmegen Patrick Baillot, CNRS, Université de Lille Alejandro Díaz-Caro, Quilmes National University & CONICET-Buenos Aires University Amy Felty, University of Ottawa Carsten Fuhs, Birkbeck, University of London Marco Gaboardi, Boston University Jürgen Giesl, RWTH Aachen University Delia Kesner, Université Paris Cité Naoki Kobayashi, University of Tokyo Cynthia Kop, Radboud University Nijmegen Luigi Liquori, Inria Giulio Manzonetto, Université Paris-Nord Daniele Nantes, Imperial College London / University of Brasilia Femke van Raamsdonk, Vrije Universiteit Amsterdam We are looking forward to seeing you in Tallinn! ==============================================================================

1 0

ICALP 2024 - Call for Participation
by Pawel Maria Sobocinski 12 May '24

12 May '24

======================================================== ICALP 2024 - Call for Participation ======================================================== **** early registration ends May 17 2024! **** The 51st EATCS International Colloquium on Automata, Languages, and Programming (ICALP) will take place in: Tallinn, Estonia, on 8-12 July 2024. ICALP is the main conference and annual meeting of the European Association for Theoretical Computer Science (EATCS). The 2024 edition of ICALP is colocated with LiCS (8-11 July, https://lics.siglog.org/lics24/) and FSCD (10-13 July, https://cs.ioc.ee/fscd24/) Conference website: https://compose.ioc.ee/icalp2024/ Local organisation enquiries: icalp_lics_fscd2024(a)taltech.ee ======================================================== Registration ======================================================== Early registration: *** May 17, 2024 by 23:59 EET *** Register here: https://compose.ioc.ee/icalp2024/#registration ======================================================== Invited Speakers ======================================================== Edith Elkind, University of Oxford Stephanie Weirich, University of Pennsylvania Anuj Dawar, University of Cambridge Danupon Nanongkai, MPI Saarbrücken Merav Parter, Weizmann Institute === LiCS invited speakers === Martin Escardó, University of Birmingham Alexandra Silva, Cornell University === LiCS invited tutorial speakers === Sam Buss, UCSD Alex Simpson, University of Ljubljana === FSCD invited speakers 2 Delia Kesner, Université Paris Cité Bettina Könighofer, TU Graz Sebastian Ullrich, LEAN-FRO ======================================================== Awards ======================================================== During the conference, the following awards will be given: – the Gödel prize (https://eatcs.org/index.php/goedel-prize), – the EATCS award (https://eatcs.org/index.php/eatcs-award), – the Presburger award (https://eatcs.org/index.php/presburger), – the EATCS distinguished dissertation award (https://eatcs.org/index.php/dissertation-award), – the best papers for Track A and Track B, – the best student papers for Track A and Track B (see submission guidelines). ========================================================= ICALP/LiCS/FSCD Workshops ========================================================= - Algorithmic Aspects of Temporal Graphs VII (AATG 2024), 7 July 2024, https://mertzios.net/Workshops/ICALP-24-Satellite/Temporal-Graphs-ICALP-202… - Geometric and Topological Methods in Computer Science (GETCO 2024), 6-7 July 2024, https://getco-conf.github.io/2024/ - Intersection Types and Related Systems (ITRS 2024), 9 July 2024, https://itrs.di.unito.it/index.html - International Workshop on Confluence (IWC 2024), 9 July 2024, https://www.trs.css.i.nagoya-u.ac.jp/event/iwc2024/ - Learning and Automata (LearnAut 2024), 7 July 2024, https://learnaut2024.github.io/ - Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2024), 8 July 2024, https://lfmtp.github.io/lfmtp-page/ - Logic Mentoring Workshop (LMW 2024), 7 July 2024, https://logic-mentoring-workshop.github.io/lics24/ - Mathematically Structured Functional Programming (MSFP 2024), 8 July 2024, https://msfp-workshop.github.io/ - Parameterized Approximation Algorithms Workshop (PAAW 2024), 6 July 2024, https://sites.google.com/site/aefeldmann/workshop/2024 - Parameterized Algorithms and Constraint Satisfaction (PACS 2024), 7 July 2024, https://pacs2024.github.io/ - Structure meets Power (SmP 2024), 7 July 2024, https://www.cst.cam.ac.uk/conference/structure-meets-power-2024 - Trends in Arithmetic Theories (TAT 2024), 6 July 2024, https://www.cs.ox.ac.uk/people/christoph.haase/home/trends-24/ - Eighth International Workshop on Trends in Linear Logic and Applications (TLLA 2024), 8-9 July 2024, https://lipn.univ-paris13.fr/TLLA/2024/ - Women in Logic 2024, 9 July 2024, https://womeninlogic.org/ ============= Accepted papers ============= === TRACK A === Marin Bougeret, Bart M. P. Jansen and Ignasi Sau. Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations Ce Jin and Hongxun Wu. A Faster Algorithm for Pigeonhole Equal Sums Hamed Hatami, Kaave Hosseini, Shachar Lovett and Anthony Ostuni. Refuting approaches to the log-rank conjecture for XOR functions Yiannis Giannakopoulos, Alexander Grosz and Themistoklis Melissourgos. On the Smoothed Complexity of Combinatorial Local Search Yu Chen and Zihan Tan. Lower Bounds on 0-Extension with Steiner Nodes Carla Groenland, Isja Mannens, Jesper Nederlof, Marta Piecyk and Paweł Rzążewski. Towards Tight Bounds for the Graph Homomorphism Problem Parameterized by Cutwidth via Asymptotic Matrix Parameters Matthias Bentert, Pål Grønås Drange, Fedor V. Fomin, Petr A. Golovach and Tuukka Korhonen. Two-sets cut-uncut on planar graphs Shiri Chechik, Doron Mukhtar and Tianyi Zhang. Streaming Edge Coloring with Subquadratic Palette Size Shiri Chechik and Tianyi Zhang. Path-Reporting Distance Oracles with Logarithmic Stretch and Linear Size Guy Goldberg. Linear Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided Error Soh Kumabe and Yuichi Yoshida. Lipschitz Continuous Allocations for Optimization Games Junjie Chen, Minming Li, Haifeng Xu and Song Zuo. Bayesian Calibrated Click-Through Auctions Esther Galby, Sándor Kisfaludi-Bak, Dániel Marx and Roohani Sharma. Subexponential Parameterized Directed Steiner Network Problems on Planar Graphs: a Complete Classification Yusuke Kobayashi and Tatsuya Terao. Subquadratic Submodular Maximization with a General Matroid Constraint Jonas Kamminga and Sevag Gharibian. BQP, meet NP: Search-to-decision reductions and approximate counting William Kuszmaul and Zoe Xi. Towards an Analysis of Quadratic Probing Naoto Ohsaka. Alphabet Reduction for Reconfiguration Problems Michaela Borzechowski, John Fearnley, Spencer Gordon, Rahul Savani, Patrick Schnider and Simon Weber. Two Choices are Enough for P-LCPs, USOs, and Colorful Tangents Andreas Emil Feldmann and Michael Lampis. Parameterized Algorithms for Steiner Forest in Bounded Width Graphs Sophia Heimann, Hung P. Hoang and Stefan Hougardy. The k-Opt algorithm for the Traveling Salesman Problem has exponential running time for k > 5 Surender Baswana and Koustav Bhanja. Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, & Optimal Sensitivity Oracles Mario Grobler, Stephanie Maaz, Nicole Megow, Amer Mouawad, Vijayaragunathan Ramamoorthi, Daniel Schmand and Sebastian Siebertz. Solution discovery via reconfiguration for problems in P Sanjeev Khanna, Aaron Putterman and Madhu Sudan. Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs Yaniv Sadeh and Haim Kaplan. Caching Connections in Matchings Édouard Bonnet, Jędrzej Hodor, Tuukka Korhonen and Tomáš Masařík. Treewidth is Polynomial in Maximum Degree on Graphs Excluding a Planar Induced Minor Ce Jin, Michael Kapralov, Sepideh Mahabadi and Ali Vakilian. Streaming Algorithms for Connectivity Augmentation Orestis Plevrakis, Seyoon Ragavan and S. Matthew Weinberg. On the cut-query complexity of approximating max-cut Klaus Heeger, Danny Hermelin, Matthias Mnich and Dvir Shabtay. No Polynomial Kernels for Knapsack Itai Boneh, Shay Golan, Shay Mozes and Oren Weimann. Õptimal Dynamic Time Warping on Run-Length Encoded Strings Shuichi Hirahara and Naoto Ohsaka. Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration Shiri Chechik and Tianyi Zhang. Faster Algorithms for Dual-Failure Replacement Paths Shaofeng H.-C. Jiang, Wenqian Wang, Yubo Zhang and Yuhao Zhang. Algorithms for the Generalized Poset Sorting Problem Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek and Sorrachai Yingchareonthawornchai. The Group Access Bounds for Binary Search Trees Chung Shue Chen, Peter Keevash, Sean Kennedy, Élie de Panafieu and Adrian Vetta. Robot positioning using torus packing for multisets Christophe Paul, Evangelos Protopapas, Dimitrios Thilikos and Sebastian Wiederrecht. Delineating Half-Integrality of the Erdős-Pósa Property for Minors: the Case of Surfaces Agastya Vibhuti Jha and Akash Kumar. A Sublinear Time Tester for Max-Cut on Clusterable Graphs Yotam Kenneth and Robert Krauthgamer. Cut Sparsification and Succinct Representation of Submodular Hypergraphs Andrei Constantinescu, Pascal Lenzner, Rebecca Reiffenhäuser, Daniel Schmand and Giovanna Varricchio. Solving Woeginger’s Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin and Stéphan Thomassé. Vertex-minor universal graphs for generating entangled quantum subsystems Augusto Modanese and Yuichi Yoshida. Testing Spreading Behavior in Networks with Arbitrary Topologies Matan Gilboa. A Characterization of Complexity in Public Goods Games Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király and Shubhang Kulkarni. Splitting-off in Hypergraphs Sariel Har-Peled, Elfarouk Harb and Vasilis Livanos. Oracle-Augmented Prophet Inequalities Rajesh Jayaram, Jakub Łącki, Slobodan Mitrović, Krzysztof Onak and Piotr Sankowski. Dynamic PageRank: Algorithms and Lower Bounds Emile Anand, Jan van den Brand, Mehrdad Ghadiri and Daniel J Zhang. The Bit Complexity of Dynamic Algebraic Formulas and their Determinants Yury Makarychev, Max Ovsiankin and Erasmo Tani. Approximation Algorithms for lp-Shortest Path and lp-Group Steiner Tree Adam Karczmarz and Marcin Smulewicz. Fully Dynamic Strongly Connected Components in Planar Digraphs Shyan Akmal, Virginia Vassilevska Williams and Nicole Wein. Detecting Disjoint Shortest Paths in Linear Time and More Kingsley Yung. Limits of Sequential Local Algorithms on the Random k-XORSAT Problem Konrad Anand, Weiming Feng, Graham Freifeld, Heng Guo and Jiaheng Wang. Approximate counting for spin systems in sub-quadratic time Chiranjib Bhattacharyya, Ravindran Kannan and Amit Kumar. Random Separating Hyperplane Theorem and Learning Polytopes Michal Dory, Sebastian Forster, Yasamin Nazari and Tijn de Vos. New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths Vikraman Arvind and Pushkar Joglekar. A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results Shuangle Li, Bingkai Lin and Yuwei Liu. Improved Lower Bounds for Approximating Parameterized Nearest Codeword and Related Problems under ETH Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer and Pavel Veselý. Fully-Scalable MPC Algorithms for Clustering in High Dimension Clément Dallard, Fedor Fomin, Petr Golovach, Tuukka Korhonen and Martin Milanič. Computing Tree Decompositions with Small Independence Number Andreas Björklund, Petteri Kaski and Jesper Nederlof. Another Hamiltonian cycle in bipartite Pfaffian graphs Johannes Meintrup, Frank Kammer, Konstantinos Dogeas, Thomas Erlebach and William K. Moses Jr.. Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous Yossi Azar, Shahar Lewkowicz and Danny Vainstein. List Update with Delays or Time Windows Boris Klemz and Marie Diana Sieper. Constrained Level Planarity is FPT with Respect to the Vertex Cover Number Weiming Feng and Heng Guo. An FPRAS for two terminal reliability in directed acyclic graphs Martin Grohe and Daniel Neuen. Isomorphism for Tournaments of Small Twin Width Kasper Green Larsen, Rasmus Pagh, Giuseppe Persiano, Toniann Pitassi, Kevin Yeo and Or Zamir. Optimal Non-Adaptive Cell Probe Dictionaries and Hashing Robert Ganian, Haiko Müller, Sebastian Ordyniak, Giacomo Paesani and Mateusz Rychlicki. A Tight Subexponential Algorithm for Two-Page Book Embedding Baris Can Esmer, Jacob Focke, Dániel Marx and Paweł Rzążewski. Fundamental Problems on Bounded-Treewidth Graphs: The Real Source of Hardness Keren Censor-Hillel, Tomer Even and Virginia Vassilevska Williams. Fast Approximate Counting of Cycles Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka and Ayumi Shinohara. Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching Cella Florescu, Rasmus Kyng, Maximilian Probst Gutenberg and Sushant Sachdeva. Optimal Electrical Oblivious Routing on Expanders Shi Li, Chenyang Xu and Ruilong Zhang. Polylogarithmic Approximations for Robust s-t Path Kent Quanrud. Adaptive sparsification for matroid intersection Sushant Sachdeva, Anvith Thudi and Yibin Zhao. Better Sparsifiers for Directed Eulerian Graphs Yuda Feng and Shi Li. A Note on Approximating Weighted Nash Social Welfare with Additive Valuations Niklas Schlomberg. An improved integrality gap for disjoint cycles in planar graphs Reut Levi, Talya Eden and Dana Ron. Testing Ck-freeness in bounded-arboricity graphs Somnath Bhattacharjee, Markus Bläser, Pranjal Dutta and Saswata Mukherjee. Exponential lower bounds via exponential sums Ariel Korin, Tsvi Kopelowitz and Liam Roditty. On the Space Usage of Approximate Distance Oracles with Sub-2 Stretch Noga Ron-Zewi and Elie Abboud. Finer-grained Reductions in Fine-grained Hardness of Approximation Ilan Doron-Arad, Ariel Kulik and Hadas Shachnai. Lower Bounds for Matroid Optimization Problems with a Linear Constraint Vladimir Podolskii and Dmitrii Sluch. One-Way Communication Complexity of Partial XOR Functions Fateme Abbasi, Marek Adamczyk, Miguel Bosch Calvo, Jarosław Byrka, Fabrizio Grandoni, Krzysztof Sornat and Antoine Tinguely. An O(loglog n)-Approximation for Submodular Facility Location Lucas Gretta and Eric Price. Sharp Noisy Binary Search with Monotonic Probabilities Aditi Dudeja. Decremental Matching in General Weighted Graphs Djamal Belazzougui, Gregory Kucherov and Stefan Walzer. Better space-time-robustness trade-offs for set reconciliation Sami Davies, Benjamin Moseley and Heather Newman. Simultaneously Approximating All lp-norms in Correlation Clustering Soheil Behnezhad, Mohammad Roghani, Aviad Rubinstein and Amin Saberi. Sublinear Algorithms for TSP via Path Covers Holger Dell, John Lapinskas and Kitty Meeks. Nearly optimal independence oracle algorithms for edge estimation in hypergraphs Leonid Gurvits, Nathan Klein and Jonathan Leake. From Trees to Polynomials and Back Again: New Capacity Bounds with Applications to TSP Shalev Ben-David and Srijita Kundu. Oracle separation of QMA and QCMA with bounded adaptivity Prantar Ghosh and Manuel Stoeckl. Low-Memory Algorithms for Online Edge Coloring Argyrios Deligkas, Eduard Eiben, Robert Ganian, Iyad Kanj and Ramanujan M. Sridharan. Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy Mónika Csikós and Nabil Mustafa. An Optimal Sparsification Lemma for Low-Crossing Matchings and its Applications Édouard Bonnet, Julien Duron, John Sylvester, Viktor Zamaraev and Maksim Zhukovskii. Tight Bounds on Adjacency Labels for Monotone Graph Classes Mohammad Hossein Bateni, Laxman Dhulipala, Kishen Gowda, D Ellis Hershkowitz, Rajesh Jarayam and Jakub Lacki. Parallel and Sequential Hardness of Hierarchical Graph Clustering Eunou Lee and Ojas Parekh. An improved Quantum Max Cut approximation via Maximum Matching Florent Foucaud, Esther Galby, Liana Khazaliya, Shaohua Li, Fionn Mc Inerney, Roohani Sharma and Prafullkumar Tale. Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth and Vertex Cover Soheil Behnezhad and Mohammad Saneian. Streaming Edge Coloring with Asymptotically Optimal Colors Jan Olkowski, Dariusz Kowalski and Mohammad Hajiaghayi. Distributed fast crash-tolerant consensus with nearly-linear quantum communication Greg Bodwin, Chengyuan Deng, Jie Gao, Gary Hoppenworth, Jalaj Upadhyay and Chen Wang. The Discrepancy of Shortest Paths Charlie Carlson, Ewan Davies, Alexandra Kolla and Aditya Potukuchi. A spectral approach to approximately counting independent sets in dense bipartite graphs Xin Li and Yan Zhong. Two-Source and Affine Non-Malleable Extractors for Small Entropy Omkar Baraskar, Agrim Dewan, Chandan Saha and Pulkit Sinha. NP-hardness of testing equivalence to sparse polynomials and constant support polynomials Yaowei Long and Yunfan Wang. Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity Noel Arteche, Erfan Khaniki, Ján Pich and Rahul Santhanam. From Proof Complexity to Circuit Complexity via Interactive Protocols Kevin Hua, Daniel Li, Jaewoo Park and Thatchaphol Saranurak. Finding Most Shattering Minimum Vertex Cuts of Polylogarithmic Size in Near-Linear Time Li Chen and Mingquan Ye. High-Accuracy Multicommodity Flows via Iterative Refinement Greg Bodwin, Gary Hoppenworth, Virginia Vassilevska Williams, Nicole Wein and Zixuan Xu. Additive Spanner Lower Bounds with Optimal Inner Graph Structure Zhenjian Lu and Rahul Santhanam. Impagliazzo's Worlds Through the Lens of Conditional Kolmogorov Complexity Panagiotis Charalampopoulos, Pawel Gawrychowski and Samah Ghazawi. Optimal Bounds for Distinct Quartics Ilan Doron and Seffi Naor. Non-Linear Paging Narek Bojikian and Stefan Kratsch. A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width Yasushi Kawase, Koichi Nishimura and Hanna Sumita. Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets Pritam Acharya, Sujoy Bhore, Aaryan Gupta, Arindam Khan, Bratin Mondal and Andreas Wiese. Approximation Schemes for Geometric Knapsack for Packing Spheres and Fat Objects Srnivasan Arunachalam, Arkopal Dutt, Francisco Escudero Gutiérrez and Carlos Palazuelos. Learning low-degree quantum objects Nick Fischer and Leo Wennmann. Minimizing Tardy Processing Time on a Single Machine in Near-Linear Time Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki and Tamás Schwarcz. Problems on Group-labeled Matroid Bases Fateme Abbasi, Sandip Banerjee, Joachim Spoerhase, Ameet Gadekar, Roohani Sharma, Jaroslaw Byrka, Kamyar Khodamoradi, Parinya Chalermsook and Dániel Marx. Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces Serge Gaspers and Jerry Zirui Li. Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems Yu Chen, Michael Kapralov, Mikhail Makarov and Davide Mazzali. On the Streaming Complexity of Expander Decomposition Tanmay Inamdar, Pallavi Jain, Daniel Lokshtanov, Abhishek Sahu, Saket Saurabh and Anannya Upasana. Satisfiability to Coverage in Presence of Fairness, Matroid, and Global Constraints Aaron Potechin and Aaron Zhang. Bounds on the Total Coefficient Size of Nullstellensatz Proofs of the Pigeonhole Principle === TRACK B === Sylvain Schmitz and Lia Schütze. On the Length of Strongly Monotone Descending Chains over ℕᵈ Alberto Larrauri and Stanislav Živný. Solving promise equations over monoids and groups Massimo Benerecetti, Laura Bozzelli, Fabio Mogavero and Adriano Peron. Automata-Theoretic Characterisations of Branching-Time Temporal Logics George Kenison. The Threshold Problem for Hypergeometric Sequences with Quadratic Parameters Mohan Sai Teja Dantam and Richard Mayr. Finite-memory Strategies for Almost-sure Energy-MeanPayoff Objectives in MDPs Guillaume Theyssier. FO logic on cellular automata orbits equals MSO logic Yuxi Fu, Qizhe Yang and Yangluo Zheng. Improved Algorithm for Reachability in d-VASS Julian Dörfler and Christian Ikenmeyer. Functional Closure Properties of Finite N-weighted Automata Cheng Zhang, Arthur Azevedo de Amorim and Marco Gaboardi. Domain Reasoning In TopKAT Roland Guttenberg. Flattability of Priority Vector Addition Systems Jakub Rydval, Žaneta Semanišinová and Michał Wrona. Identifying Tractable Quantified Temporal Constraints within Ord-Horn Dmitry Chistikov, Alessio Mansutti and Mikhail Starchak. Integer Linear-Exponential Programming in NP by Quantifier Elimination Antoine Mottet, Tomáš Nagy and Michael Pinsker. An order out of nowhere: a new algorithm for infinite-domain CSPs Benjamin Scheidt. On Homomorphism Indistinguishability and Hypertree Depth Manon Blanc and Olivier Bournez. The complexity of computing in continuous time: space complexity is precision Bruno Loff and Mateusz Skomra. Smoothed analysis of deterministic discounted and mean-payoff games Wojciech Różowski. A Complete Quantitative Axiomatisation of Behavioural Distance of Regular Expressions Michael Benedikt, Chia-Hsuan Lu, Boris Motik and Tony Tan. Decidability of Graph Neural Networks via Logical Characterizations Arnaud Carayol and Lucien Charamond. The structure of trees in the pushdown hierarchy Rohan Acharya, Marcin Jurdziński and Aditya Prakash. Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata Pavol Kebis, Florian Luca, Joel Ouaknine, Andrew Scoones and James Worrell. On Transcendence of Numbers Related to Sturmian and Arnoux-Rauzy Words Jakub Rydval. Homogeneity and Homogenizability: Hard Problems for the Logic SNP Amina Doumane, Samuel Humeau and Damien Pous. A finite presentation of treewidth at most 3 graphs Go Hashimoto, Daniel Gaina and Ionuț Țuțu. Forcing, Transition Algebras, and Calculi Jakub Gajarský and Rose McCarty. On classes of bounded tree rank, their interpretations, and efficient sparsification Yuya Uezato. Regular Expressions with Backreferences and Lookaheads Capture NLOG Paul Gallot, Sebastian Maneth, Keisuke Nakano and Charles Peyrat. Deciding Linear Height and Linear Size-to-Height Increase of Macro Tree Transducers C. Aiswarya, Amaldev Manuel and Saina Sunny. Edit Distance of Finite State Transducers Christoph Haase, Shankara Naryananan Krishna, Khushraj Madnani, Om Swostik Mishra and Georg Zetzsche. An efficient quantifier elimination procedure for Presburger arithmetic Raphael Douglas Giles, Vincent Jackson and Christine Rizkallah. T-Rex: Termination of Recursive Functions using Lexicographic Linear Combinations Steffen van Bergerem, Roland Guttenberg, Sandra Kiefer, Corto Mascle, Nicolas Waldburger and Chana Weil-Kennedy. Verification of Population Protocols with Unordered Data Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine and James Worell. The 2-Dimensional Constraint Loop Problem is Decidable Pascal Baumann, Eren Keskin, Roland Meyer and Georg Zetzsche. Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities Mikołaj Bojańczyk, Lê Thành Dũng Nguyên and Rafał Stefański. Function spaces for orbit-finite sets

1 0

2nd cfp sefm'24
by Alexandre Madeira 11 May '24

11 May '24

========= SECOND CALL FOR PAPERS ============ 22nd International Conference on Software Engineering and Formal Methods 4-8 November 2024 University of Aveiro, Portugal https://sefm-conference.github.io/2024/ ============================================ The 21st edition of the International Conference on Software Engineering and Formal Methods will be held between 6 and 8 November 2024, with workshops taking place on 4 and 5 November 2024. *Important dates* Abstract submission: 7 June 2024 (AoE) Paper submission: 14 June 2024 (AoE) Author notification: 15 August 2024 Workshops: 4-5 November 2024 Conference: 6-8 November 2024 *Overview and Scope* The conference aims to bring together researchers and practitioners from academia, industry and government, to advance the state of the art in formal methods, to facilitate their uptake in the software industry, and to encourage their integration within practical software engineering methods and tools. The topics of interest include, but are not limited to, the following aspects of software engineering and formal methods. -Software Development Methods .Formal modelling, specification, and design .Software evolution, maintenance, re-engineering, and reuse .Design Principles -Programming languages .Domain-specific languages .Type theory .Abstraction and refinement -Software Testing, Validation, and Verification .Model checking, theorem proving, and decision procedures .Testing and runtime verification .Statistical and probabilistic analysis .Synthesis .Performance estimation and analysis of other non-functional properties .Other light-weight and scalable formal methods .Security and Safety -Security, privacy, and trust .Safety-critical, fault-tolerant, and secure systems .Software certification .Applications and Technology Transfer -Service-oriented and cloud computing systems, Internet of Things .Component, object, multi-agent and self-adaptive systems .Real-time, hybrid, and cyber-physical systems .Intelligent systems and machine learning .Quantum systems .HCI, interactive systems, and human error analysis .Education -Case studies, best practices, and experience reports *Invited Speakers* Luís S. Barbosa, University of Minho, PT Paula Herber, Universitat Munster, DE Aleks Kissinger, University of Oxford, UK *Paper submission* We solicit two categories of papers: .Regular papers - describing original research results, case studies, or surveys, should not exceed 16 pages (excluding bibliography of at most two pages). .Tool papers - that describe an operational tool and its contributions should not exceed 8 pages. Papers must be formatted according to the guidelines for Springer LNCS papers. All submissions must be original, unpublished, and not submitted concurrently for publication elsewhere. Papers can be submitted through Easychair: https://easychair.org/conferences/?conf=sefm2024. *Artifact Evaluation* This edition of SEFM introduces an artifact evaluation (AE). An artifact contains any necessary material to support the claims made in the paper and ideally makes the results fully reproducible. Submission of an artifact is optional for regular papers and mandatory for tool papers. The artifacts will be judged by the Artifact Evaluation Committee (AEC). More details will be available soon. *Publication* All accepted papers will appear in the proceedings of the conference that will be published as a volume in Springer’s LNCS series. The authors of a selected subset of accepted papers will be invited to submit extended versions of their papers to a special issue of the journal Software and Systems Modeling (SoSyM). ------------------------------------------------------- Alexandre Madeira http://sweet.ua.pt/madeira/

1 0

FACS 2024 - Third Call for Papers
by Marmsoler, Diego 07 May '24

07 May '24

[ Please distribute, apologies for multiple postings. ] ========================================================================= 20th International Conference on Formal Aspects of Component Software (FACS) - Third Call https://facs-conference.github.io/2024/ September 09-10, 2024, Milan, Italy Co-located with the 26th international symposium on formal methods (FM 2024) https://www.fm24.polimi.it/ -------------------------------------------------------------------------- -------------------------------------------------------------------------- OVERVIEW -------------------------------------------------------------------------- FACS 2024 is concerned with how formal methods can be applied to component- based software and system development. Formal methods have provided foundations for component-based software through research on mathematical models for components, composition and adaptation, and rigorous approaches to verification, deployment, testing, and certification. -------------------------------------------------------------------------- -------------------------------------------------------------------------- TOPICS -------------------------------------------------------------------------- The conference seeks to address the applications of formal methods in all aspects of software components and services. FACS aims at developing a community-based understanding of relevant and emerging research problems through formal paper presentations and lively discussions. FACS 2024 welcomes contributions including but not limited to: - Formal methods, models, and languages for software-intensive systems, components and services, including verification techniques (e.g., model checking, theorem proving, testing, constraint solving, runtime analysis), probabilistic techniques, (co-)simulation techniques, composition and deployment, component interaction, software variability, QoS and other nonfunctional properties (e.g., trust, compliance, security, privacy); - Formal aspects of concrete software-intensive systems, including service- oriented architectures, business processes, cloud or edge computing, real- time/safety-critical systems, hybrid and cyber physical systems, quantum systems, components that use artificial intelligence; - Tools supporting formal methods for components and services; - Case studies and experience reports over the above topics; - **Special track: Formal Methods of Component Software in the context of emerging computational paradigms** (e.g. cyber physical human systems, quantum computations, AI systems, blockchain systems, etc) . -------------------------------------------------------------------------- -------------------------------------------------------------------------- SUBMISSION AND PUBLICATION -------------------------------------------------------------------------- We solicit high-quality submissions reporting on: A - full papers: original research, applications and experiences, or surveys (16 pages); B - short papers: tools and demonstrations (6 pages); C - Special track papers (16 pages); The page limit excludes references and appendices. Papers should be prepared in LaTeX, adhering to the Springer LNCS format and Guidelines. Papers should be submitted through the easychair link: https://easychair.org/conferences/?conf=facs2024 All submitted papers should be in LNCS format and unpublished and not submitted for publication elsewhere. All accepted papers will have to be presented at the conference by one of their authors. Accepted papers in all categories will be published in the FACS proceedings and published as a volume in Springer LNCS series. -------------------------------------------------------------------------- -------------------------------------------------------------------------- SPECIAL ISSUE -------------------------------------------------------------------------- The authors of a selected subset of accepted papers will be invited to submit an extended version of their papers to a special issue of the Science of Computer Programming journal. -------------------------------------------------------------------------- -------------------------------------------------------------------------- BEST PAPER AWARD -------------------------------------------------------------------------- FACS 2024 will recognize the most outstanding submissions with a best paper award. -------------------------------------------------------------------------- -------------------------------------------------------------------------- IMPORTANT DATES -------------------------------------------------------------------------- - Abstract submission (extended): 23 May, 2024 - Full paper submission (extended): 30 May, 2024 - Notification: 03 July, 2024 - Final version due: 17 July, 2024 - Conference: 9-10 September, 2024 -------------------------------- -------------------------------- INVITED SPEAKERS -------------------------------- - Ana Cavalcanti (University of York, UK) - David Parker (University of Oxford, UK) - Geguang Pu (ECNU, China) -------------------------------- -------------------------------- PROGRAM CO-CHAIRS -------------------------------- - Diego Marmsoler (University of Exeter, United Kingdom) - Meng Sun (Peking University, China) -------------------------------- -------------------------------- PROGRAM COMMITTEE -------------------------------- - Achim Brucker (University of Exeter, United Kingdom) - Antónia Lopes (Universidade de Lisboa, Portugal) - Anton Wijs (Eindhoven University of Technology, Netherlands) - Arpit Sharma (IISERB, India) - Brijesh Dongol (University of Surrey, United Kingdom) - Camilo Rocha (Pontificia Universidad Javeriana Cali, Colombia) - Clemens Dubslaff (Eindhoven University of Technology, Netherlands) - Fatemeh Ghassemi (University of Tehran, Iran) - Giorgio Audrito (University of Turin, Italy) - Gwen Salaün (University of Grenoble Alpes, France) - Ivan Lanese (University of Bologna/INRIA, Italy) - Jacopo Mauro (University of Southern Denmark, Denmark) - José Proença (University of Porto, Portugal) - Keigo Imai (DeNA Co., Japan) - Kenneth Johnson (Auckland University of Technology, New Zealand) - Kyungmin Bae (POSTECH, South Korea) - Luís Soares Barbosa (University of Minho, Portugal) - Marie Farrell (The University of Manchester, United Kingdom) - Mario Gleirscher (Universität Bremen, Germany) - Mieke Massink (CNR-ISTI, Italy) - Olga Kouchnarenko (University of Franche-Comté, France) - Peter Ölveczky (University of Oslo, Norway) - Samir Genaim (Universidad Complutense de Madrid, Spain) - Shoji Yuen (Nagoya University, Japan) - Simon Bliudze (INRIA Lille, France) - Simon Foster (University of York, United Kingdom) - Violet Ka I Pun (Western Norway University of Applied Sciences, Norway) - Xiyue Zhang (Oxford University, United Kingdom) - Zhenbang Chen (NUDT, China) Diego Marmsoler Lecturer (Education and Research), Computer Science University of Exeter, Innovation 1, Room 10 www: marmsoler.com<http://www.marmsoler.com> Twitter: @DiegoMarmsoler<https://twitter.com/DiegoMarmsoler>

1 0

NFM 2024 — Call for Participation
by Gopinath, Divya (ARC-TI)[KBR Wyle Services, LLC] 06 May '24

06 May '24

NFM 2024 — Call for Participation 16th NASA Formal Methods Symposium (NFM) June 4–6, 2024 NASA Ames Research Center, Moffett Field, California, United States https://conf.researchr.org/home/nfm-2024 ---------------------------------------------------------------------------- * There is no registration fee! * The NASA Formal Methods (NFM) Symposium is an annual forum to foster collaboration between theoreticians and practitioners from NASA, other government agencies, academia, and industry, with the goal of identifying challenges and providing solutions towards achieving assurance for safety critical systems. NFM 2024 will be held June 4—6, 2024 at the NASA Ames Research Center in Moffett Field, California, USA. The symposium features presentation sessions on Advances in Solver technology, Formal Methods for Program Analysis and Verification, SMT-based Assurance of Behavioral Specifications, Formal Methods for Learning-enabled Systems, Formal Methods for Automotive Systems, Formal Methods for Robotics, and Formal Methods for Software Engineering. There will also be a tool demonstration session and panel discussion on trusted autonomy. Keynote Speakers "Autonomy Challenges for Future NASA Science and Exploration Missions." Dr. Butler Hine, Project Manager for the HelioSwarm mission, NASA "Formal Verification and Run-time Monitoring for Learning-Enabled Autonomous Systems." Dr. Corina Pasareanu, ACM Distinguished Scientist, NASA Ames and CMU "Safety under uncertainty: Automotive standards for AI safety and research perspectives." Dr. Simon Burton, Chair of Systems Safety at University of York Panel Session The topic of the discussion will be Trusted Autonomy, chaired by Dr. Guillaume Brat, NASA Ames Research Center. Panelists: Dr. Huafeng Yu (Senior Scientist from US Department of Transport) Dr. Jean-Guillaume Durand (Applied Scientist from Xwing) Dr. Marco Pavone (Director of Autonomous Vehicle Research at NVIDIA) Dr. Darren Cofer (Principal Fellow at Collins Aerospace) For more information about the program, please see https://conf.researchr.org/home/nfm-2024#program. Registration There is no registration fee charged to participants. All interested individuals are welcome to attend. However, all attendees must register here: https://conf.researchr.org/info/nfm-2024/registration ---------------------------------------------------------------------------- Conference Chairs: Nathan Benz, Divya Gopinath, Nija Shi Contact: nfm24-chairs(a)lists.nasa.gov

1 0

Lecturer or Senior Lecturer in Algorithms at the University of
by Jonni T Virtema 03 May '24

03 May '24

This is an exciting opportunity for a Lecturer or Senior Lecturer in Algorithms at the University of Sheffield. Working in the Department of Computer Science, you will join our Foundations of Computation (FOX) Group. Its research topics range from the theoretical mathematical foundations that underpin computer science to their applications in real world contexts. Website: https://www.jobs.ac.uk/job/DHG612/lecturer-senior-lecturer-in-algorithms

1 0

Postdoc position @ King's College London
by Hubie Chen 24 Apr '24

24 Apr '24

## Postdoc position in Theoretical CS @ King's College London A postdoctoral research position in theoretical computer science is available at King's College London. The successful candidate will be hosted by Hubie Chen and will be expected to work on topics related to the themes of complexity, database theory, structural decomposition methods, and logic. Research interest and experience in the following areas will be valued: logic in computer science, database theory, finite model theory, structural decomposition methods, term rewriting, and parameterized complexity theory. Key dates: the application deadline is June 6, 2024; it is hoped that the successful applicant will start in or around October 2024, but there is some flexibility concerning the start date. If the position is started in October 2024, it can be held for 1.5+ years. The exact starting date and duration can be set in a way that takes into account the successful candidate's needs and schedule. Informal enquiries and discussion are strongly encouraged prior to application (e-mail contact: hubie.chen(a)kcl.ac.uk). To apply, please see: https://www.kcl.ac.uk/jobs/088046-post-doctoral-research-associate

1 0

Second round of abstract submissions - WADT 2024
by WADT 2024 23 Apr '24

23 Apr '24

[Apologies for cross-posting] ====================================================================== WADT 2024 - Second round of abstract submissions 27th International Workshop on Algebraic Development Techniques https://conf.researchr.org/home/wadt-2024 Part of the STAF 2024 multi-conference taking place Mon 8 – Fri 12 July 2024 in Enschede, the Netherlands ====================================================================== AIMS AND SCOPE The algebraic approach to system specification encompasses many aspects of the formal design of software systems. Originally born as a formal method for reasoning about abstract data types, it now covers new specification frameworks and programming paradigms (such as object-oriented, aspect-oriented, agent-oriented, logic and higher-order functional programming) as well as a wide range of application areas (including information systems, concurrent, distributed and mobile systems). The workshop will provide an opportunity to present recent and ongoing work, to meet colleagues, and to discuss new ideas and future trends. TOPICS OF INTEREST Typical, but not exclusive topics of interest are: – Foundations of algebraic specification – Other approaches to formal specification, including process calculi and models of concurrent, distributed, and cyber-physical systems – Specification languages, methods, and environments – Semantics of conceptual modelling methods and techniques – Model-driven development – Graph transformations, term rewriting, and proof systems – Integration of formal specification techniques – Theorem-proving technologies and integration with specification languages – Formal testing and quality assurance, validation, and verification – Algebraic approaches to knowledge representation and cognitive sciences WORKSHOP FORMAT AND LOCATION The workshop will be part of the STAF 2024 multi-conference at Twente, the Netherlands. Presentations will be selected on the basis of submitted abstracts. INVITED SPEAKERS Jan Bergstra (UvA, Netherlands) Bernhard Möller (Uni Augsburg, Germany) IMPORTANT DATES Abstract submission (round 2): 10 May 2024 Abstract notification (round 2): 17 May 2024 Full-paper submission: 16 Sep 2024 Full-paper notification: 25 Nov 2024 SUBMISSIONS The scientific programme of the workshop will include presentations of recent results or ongoing research as well as invited talks. The presentations will be selected by the Programme Committee on the basis of submitted abstracts according to originality, significance and general interest. Abstracts must not exceed two pages, including references, in LNCS format. If a longer version of the contribution is available, it can be made accessible on the web and referenced in the abstract. The abstracts will have to be submitted electronically via EasyChair at https://easychair.org/conferences/?conf=staf2024. POST-PROCEEDINGS After the workshop, authors will be invited to submit full papers for the refereed proceedings. All submissions will be reviewed by the Programme Committee. The selection of papers will be based on originality, soundness, and significance of the presented ideas and results. The post-proceedings will then be published by Springer as a volume of Lecture Notes in Computer Science. SPONSORSHIP The workshop takes place under the auspices of IFIP WG 1.3. STEERING COMMITTEE Andrea Corradini (Italy) José Fiadeiro (UK) Rolf Hennicker (Germany) Alexander Knapp (Germany) Hans-Jörg Kreowski (Germany) Till Mossakowski (Germany) Fernando Orejas (Spain) Leila Ribeiro (Brazil) Markus Roggenbach (UK) Grigore Roșu (USA) PROGRAMME COMMITTEE Mihai Codescu (Romania) Andrea Corradini (Italy) Tom van Dijk (Netherlands) Fabio Gadducci (Italy) Rolf Hennicker (Germany) Alex Kavvos (UK) Alexander Knapp (Germany) Leen Lambers (Germany) Alexandre Madeira (Portugal) Manuel A. Martins (Portugal) Narciso Martí-Oliet (Spain) Dominique Mery (France) Till Mossakowski (Germany) Renato Neves (Portugal) Peter Ölveczky (Norway) Fernando Orejas (Spain) Florian Rabe (Germany) Adrián Riesco (Spain) Markus Roggenbach (UK) Pierre Yves Schobbens (Belgium) Ionuț Țuțu (Romania) [chair] Uwe Wolter (Norway) CONTACT INFORMATION Email: wadt2024(a)outlook.com Homepage: https://conf.researchr.org/home/wadt-2024

1 0

Why the hexagon of opposition is really a triangle: logical
by jean-yves beziau 23 Apr '24

23 Apr '24

Logica Universalis Webinar April 24, 2024 at 4pm CET Speaker: Ori Milstein https://philpeople.org/profiles/ori-milstein Title: "Why the hexagon of opposition is really a triangle: logical structures as geometric shapes" Abstract: "This paper suggests a new approach (with old roots) to the study of the connection between logic and geometry. Traditionally, most logic diagrams associate only vertices of shapes with propositions. The new approach, which can be dubbed ’full logical geometry’, aims to associate every element of a shape (edges, faces, etc.) with a proposition. The roots of this approach can be found in the works of Carroll, Jacoby, and more recently, Dubois and Prade. However, its potential has not been duly appreciated, probably because of the complexity of the diagrams in these works. The following study demonstrates how the Hexagon of Opposition can be represented as a triangle and Classical Logic as a tetrahedron (rather than a rhombic dodecahedron). It then applies the approach to modal logic, extending the tetrahedron for the logic KT into a dipyramid and a cube for KD, and finally an octahedron for K. Some possible directions for further research are also indicated.." https://link.springer.com/journal/11787 Associate event World Congress on the Square of Opposition SQUARE 8 - Costa Rica Sept 6-13, 2024 https://sites.google.com/view/square8-2024 Presented by Pablo Villalobos Morera and Lorenzo Boccafogli Chair : Arnon Avron https://www.cs.tau.ac.il/~aa/ Editorial Board LU Everybody is welcome to join, register here: https://cassyni.com/events/VF7GYYaHGPGZiFeSZDibRX Jean-Yves Beziau Editor of Logica Universalis and Organizer of LUW https://philpeople.org/profiles/jean-yves-beziau

1 0