Advanced Reasoning in Arithmetic Theories

Informazioni relative al progetto

ARiAT

ID dell’accordo di sovvenzione: 852769

DOI

10.3030/852769

Progetto chiuso

Data della firma CE 8 Ottobre 2019

Data di avvio 1 Gennaio 2020

Data di completamento 31 Agosto 2025

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 1 481 864,00

Contributo UE

€ 1 481 864,00

Coordinato da

THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD
United Kingdom

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Risultati finali

Open Research Data Pilot (1)

Data Management Plan

see guidance

Pubblicazioni

Conference proceedings (30)

On the Expressivity of Recurrent Neural Cascades with Identity

Autori: Nadezda Alexandrovna Knorozova, Alessandro Ronca
Pubblicato in: Proceedings of the TwentyFirst International Conference on Principles of Knowledge Representation and Reasoning, 2024, Pagina/e 878-887
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/kr.2024/82

On The Expressivity of Recurrent Neural Cascades (Extended Abstract)

Autori: Nadezda A. Knorozova; Alessandro Ronca
Pubblicato in: First International Workshop on Logical Foundations of Neuro-Symbolic AI (LNSAI 2024), 2024
Editore: CEUR-WS

Computing All Facts Entailed By An LTL Specification

Autori: Przemyslaw Andrzej Walega, Michal Zawidzki, Christoph Haase
Pubblicato in: Proceedings KR 2023, 2023
Editore: IJCAI Organization
DOI: 10.24963/kr.2023/66

Higher-Order Quantified Boolean Satisfiability

Autori: Chistikov, Dmitry ; Haase, Christoph ; Hadizadeh, Zahra ; Mansutti, Alessio
Pubblicato in: Proceedings MFCS 2022, Numero 241, 2022, Pagina/e 33:1--33:15
Editore: Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik
DOI: 10.4230/lipics.mfcs.2022.33

Boundedness of Cost Register Automata over the Integer Min-Plus Semiring

Autori: Draghici, Andrei; Piórkowski, Radosław; Ryzhikov, Andrew
Pubblicato in: Proceedings CSL 2025, Numero 1, 2025
Editore: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.csl.2025.20

On the Power of Ordering in Linear Arithmetic Theories

Autori: Christoph Haase, Dmitry Chistikov
Pubblicato in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Numero 168, 2020, Pagina/e 119:1--119:15
Editore: Schloss Dagstuhl--Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2020.119

On the Expressivity of Recurrent Neural Cascades

Autori: Nadezda Alexandrovna Knorozova, Alessandro Ronca
Pubblicato in: Proceedings of the AAAI Conference on Artificial Intelligence, Numero 38, 2024, Pagina/e 10589-10596, ISSN 2374-3468
Editore: Association for the Advancement of Artificial Intelligence (AAAI)
DOI: 10.1609/aaai.v38i9.28929

Modal Logics and Local Quantifiers: A Zoo in the Elementary Hierarchy

Autori: Raul Fervari, Alessio Mansutti
Pubblicato in: Proceedings FOSSACS 2022, Numero 13242, 2022, Pagina/e 305–324
Editore: Springer
DOI: 10.1007/978-3-030-99253-8_16

On the Expressiveness of Büchi Arithmetic

Autori: Christoph Haase, Jakub Rozycki
Pubblicato in: Foundations of Software Science and Computation Structures. FOSSACS 2021, Numero 12650, 2021, Pagina/e 310-323
Editore: Springer
DOI: 10.1007/978-3-030-71995-1_16

On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices

Autori: Klara Nosan; Amaury Pouly; Sylvain Schmitz; Mahsa Shirmohammadi; James Worrell
Pubblicato in: Proceedings of ISSAC 2022, Numero 1, 2022, Pagina/e 129–-138
Editore: ACM
DOI: 10.48550/arxiv.2106.01853

The Membership Problem for Hypergeometric Sequences with Rational Parameters

Autori: Nosan, Klara; Pouly, Amaury; Shirmohammadi, Mahsa; Worrell, James
Pubblicato in: Proceedings of ISAAC 2022, Numero 1, 2022, Pagina/e 381--389
Editore: ACM
DOI: 10.48550/arxiv.2202.07416

On Polynomial-Time Decidability of k-Negations Fragments of FO Theories (Extended Abstract)

Autori: Christoph Haase, Alessio Mansutti, Amaury Pouly
Pubblicato in: Proceedings MFCS 2023, 2023
Editore: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.mfcs.2023.52

Provably Efficient Offline Reinforcement Learning in Regular Decision Processes

Autori: Roberto Cipollone; Anders Jonsson; Alessandro Ronca; Mohammad Sadegh Talebi
Pubblicato in: Advances in Neural Information Processing Systems 36 (NeurIPS 2023), 2023
Editore: Neural Information Processing Systems Foundation, Inc.

The Complexity of Presburger Arithmetic with Power or Powers

Autori: Michael Benedikt, Dmitry Chistikov, Alessio Mansutti
Pubblicato in: Proceedings ICALP 2023, 2023
Editore: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.icalp.2023.112

Universality and Forall-Exactness of Cost Register Automata with Few Registers

Autori: Daviaud, Laure; Ryzhikov, Andrew
Pubblicato in: 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), 2023
Editore: "Schloss Dagstuhl -- Leibniz-Zentrum f{\""u}r Informatik"
DOI: 10.4230/lipics.mfcs.2023.40

Quantifier elimination for counting extensions of Presburger arithmetic

Autori: Dmitry Chistikov, Christoph Haase, Alessio Mansutti
Pubblicato in: Proceedings of FOSSACS 2022, Numero 13242, 2022, Pagina/e 225–243
Editore: Springer
DOI: 10.1007/978-3-030-99253-8_12

The Transformation Logics

Autori: Alessandro Ronca
Pubblicato in: International Joint Conference on Artificial Intelligence 2024, 2024
Editore: ijcai.org

Directed Reachability for Infinite−State Systems

Autori: Michael Blondin; Christoph Haase; Philip Offtermatt
Pubblicato in: Tools and Algorithms for the Construction and Analysis of Systems, Numero 12652, 2021, Pagina/e 3-23
Editore: Springer
DOI: 10.26226/morressier.604907f41a80aac83ca25ccf

Semënov Arithmetic, Affine VASS, and String Constraints

Autori: Draghici, Andrei; Haase, Christoph; Manea, Florin
Pubblicato in: Proceedings STACS 2024, Numero 1, 2024
Editore: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2024.29

On the Size of Finite Rational Matrix Semigroups

Autori: Georgina Bumpus, Christoph Haase, Stefan Kiefer, Paul-Ioan Stoienescu, Jonathan Tanner
Pubblicato in: 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), Numero 168, 2020, Pagina/e 115:1--115:13, ISBN 978-3-95977-138-2
Editore: Schloss Dagstuhl--Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2020.115

On the Complexity of Inductively Learning Guarded Clauses

Autori: Andrei Draghici, Georg Gottlob, Matthias Lanzinger
Pubblicato in: Proceedings of AAAI 2022, Numero 36(5), 2022, Pagina/e 5600-5607
Editore: AAAI Press
DOI: 10.1609/aaai.v36i5.20500

Approaching Arithmetic Theories with Finite-State Automata

Autori: Christoph Haase
Pubblicato in: Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Milan, Italy, March 4–6, 2020, Proceedings, Numero 12038, 2020, Pagina/e 33-43, ISBN 978-3-030-40607-3
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-40608-0_3

Monoids of Upper Triangular Matrices over the Boolean Semiring

Autori: Ryzhikov, Andrew; Wolf, Petra
Pubblicato in: Proceedings MFCS 2024, Numero 1, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.mfcs.2024.81

On Deciding Linear Arithmetic Constraints Over p-adic Integers for All Primes

Autori: Christoph Haase, Alessio Mansutti
Pubblicato in: 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Numero 202, 2021, Pagina/e 55:1--55:20
Editore: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.mfcs.2021.55

Offline RL in Regular Decision Processes: Sample Efficiency via Language Metrics

Autori: Deb, Ahana; Cipollone, Roberto; Jonsson, Anders; Ronca, Alessandro; Talebi, Mohammad Sadegh
Pubblicato in: Proceedings ICLR 2025, Numero 1, 2025
Editore: OpenReview.net

Geometric Decision Procedures and the VC Dimension of Linear Arithmetic Theories

Autori: Dmitry Chistikov, Christoph Haase, Alessio Mansutti
Pubblicato in: Proceedings of LICS 2022, 2022, Pagina/e 59:1--59:13, ISBN 9781450393515
Editore: ACM
DOI: 10.1145/3531130.3533372

An efficient quantifier elimination procedure for Presburger arithmetic

Autori: Haase, Christoph; Krishna, Shankara Narayanan; Madnani, Khushraj; Mishra, Om Swostik; Zetzsche, Georg
Pubblicato in: Leibniz International Proceedings in Informatics, Numero 3, 2024
Editore: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.icalp.2024.142

Universal Quantification Makes Automatic Structures Hard to Decide

Autori: Haase, Christoph, Piórkowski, Radosław
Pubblicato in: Proceedings CONCUR 2023, 2023
Editore: Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.concur.2023.13

Efficiently Computing the Minimum Rank of a Matrix in a Monoid of Zero-One Matrices

Autori: Kiefer, Stefan; Ryzhikov, Andrew
Pubblicato in: Proceedings of STACS 2025, Numero 1, 2025
Editore: Schloss Dagstuhl -- Leibniz-Zentrum für Informatik
DOI: 10.4230/lipics.stacs.2025.61

Formal and Empirical Studies of Counting Behaviour in ReLU RNNs

Autori: Nadine El-Naggar; Andrew Ryzhikov; Laure Daviaud; Pranava Madhyastha; Tillman Weyde
Pubblicato in: Proceedings of 16th edition of the International Conference on Grammatical Inference, Numero 217, 2023, Pagina/e 199--222
Editore: PMLR

Peer reviewed articles (2)

On Composing Finite Forests with Modal Logics

Autori: Bartosz Bednarczyk, Stéphane Demri, Raul Fervari, Alessio Mansutti
Pubblicato in: ACM Transactions on Computational Logic, 2023, ISSN 1529-3785
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3569954

The complexity of computing the period and the exponent of a digraph

Autori: Stefan Kiefer, Andrew Ryzhikov
Pubblicato in: Information Processing Letters, Numero 191, 2025, Pagina/e 106590, ISSN 0020-0190
Editore: Elsevier BV
DOI: 10.1016/j.ipl.2025.106590

Book chapters (4)

Reachability in Fixed VASS: Expressiveness and Lower Bounds

Autori: Andrei Draghici, Christoph Haase, Andrew Ryzhikov
Pubblicato in: Lecture Notes in Computer Science, Foundations of Software Science and Computation Structures, 2024, Pagina/e 185-205
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-57231-9_9

Integer Programming with GCD Constraints

Autori: Rémy Défossez, Christoph Haase, Alessio Mansutti, Guillermo A. Pérez
Pubblicato in: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2024, Pagina/e 3605-3658
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611977912.128

Formal Languages and Arithmetic Theories: Recent Results and Open Problems

Autori: Christoph Haase, Mikhail Starchak
Pubblicato in: Lecture Notes in Computer Science, Developments in Language Theory, 2025, Pagina/e 1-14
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-032-01475-7_1

On Shortest Products for Nonnegative Matrix Mortality

Autori: Andrew Ryzhikov
Pubblicato in: Lecture Notes in Computer Science, Reachability Problems, 2024, Pagina/e 104-119
Editore: Springer Nature Switzerland
DOI: 10.1007/978-3-031-72621-7_8