Search Results - acm: f.: theory of computation/f.4: (mathematik OR mathematical) logic AND formal languages~

Petri-Netze: Theorie und Implementierung ; Petri nets: Theory and implementation ; Réseaux de Petri : Théorie et mise en oeuvre

Authors: Delfieu, David Roux, Olivier Henri Valette, Robert et al.

Contributors: Delfieu, David Roux, Olivier Henri Valette, Robert et al.

Source: Techniques de l'ingénieur Automatique et ingénierie système ; https://hal.science/hal-05069404 ; Techniques de l'ingénieur Automatique et ingénierie système, 2025, Automatique séquentielle, Automatique Séquentielle (S7254), ⟨10.51257/a-v2-s7254⟩ ; https://www.techniques-ingenieur.fr/

Subject Terms: Concurrent Systems, Modeling tools Conclusion, Real time systems, Petri nets, Réseaux de Petri, Systèmes temps réel, Systèmes concurrent, Outils de modélisation Petri net, ACM CCS, ACM: D.: Software/D.2: SOFTWARE ENGINEERING/D.2.2: Design Tools and Techniques/D.2.2.6: Petri nets, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Availability: https://hal.science/hal-05069404
https://hal.science/hal-05069404v1/document
https://hal.science/hal-05069404v1/file/main_ti.pdf
https://doi.org/10.51257/a-v2-s7254

SPINDLE: Spinning Raw Text into Lambda Terms with Graph Attention

Authors: Kogkalidis, Konstantinos Moortgat, Michael Moot, Richard et al.

Contributors: Kogkalidis, Konstantinos Moortgat, Michael Moot, Richard et al.

Source: Proceedings of the 17th Conference of the European Chapter of the Association for Computational Linguistics - System Demos ; EACL 2023 - 17th Conference of the European Chapter of the Association for Computational Linguistics ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-04290161 ; EACL 2023 - 17th Conference of the European Chapter of the Association for Computational Linguistics, Association for Computational Linguistics, May 2023, Dubrovnic, Croatia. pp.128-135, ⟨10.48550/arXiv.2302.12050⟩ ; https://2023.eacl.org/

Subject Terms: Computation and Language, Artificial Intelligence, Machine Learning, Logic in Computer Science, FOS: Computer and information sciences, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.3: Deduction and Theorem Proving, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]

Subject Geographic: Dubrovnic, Croatia

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2302.12050; ARXIV: 2302.12050

Availability: https://hal-lirmm.ccsd.cnrs.fr/lirmm-04290161
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04290161v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04290161v1/file/eacl2023.pdf
https://doi.org/10.48550/arXiv.2302.12050

Characterizing right inverses for spatial constraint systems with applications to modal logic

Authors: Guzmán, Michell Perchy, Salim Rueda, Camilo et al.

Contributors: Guzmán, Michell Perchy, Salim Rueda, Camilo et al.

Source: Theoretical Computer Science. 744:56-77

Subject Terms: ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, inverse operators, [INFO.INFO-DC]Computer Science [cs]/Distributed, constraint systems, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-GT]Computer Science [cs]/Computer Science and Game Theory [cs.GT], concurrent constraint programming, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 02 engineering and technology, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, 16. Peace & justice, ACM: F.: Theory of Computation, Parallel, concurrency theory, 01 natural sciences, and Cluster Computing [cs.DC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], Modal algebra, [INFO.INFO-GT] Computer Science [cs]/Computer Science and Game Theory [cs.GT], [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], 0202 electrical engineering, electronic engineering, information engineering, modal logic, [INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

File Description: application/pdf

Access URL: https://hal.inria.fr/hal-01675010/file/final-tcs.pdf
https://inria.hal.science/hal-01675010v2
https://hal.inria.fr/hal-01675010
https://hal.inria.fr/hal-01675010/document
https://dblp.uni-trier.de/db/journals/tcs/tcs744.html#GuzmanPRV18
https://www.sciencedirect.com/science/article/pii/S0304397518303426
https://hal.archives-ouvertes.fr/hal-01675010v1

Towards a formal account for software transactional memory

Authors: Medić, Doriana Antares Mezzina, Claudio Phillips, Iain et al.

Contributors: Medić, Doriana Antares Mezzina, Claudio Phillips, Iain et al.

Source: RC 2020 - 12th International Conference on Reversible Computation ; https://hal.inria.fr/hal-03005449 ; RC 2020 - 12th International Conference on Reversible Computation, Jul 2020, Oslo, Norway

Subject Terms: ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, [INFO]Computer Science [cs], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Subject Geographic: Oslo, Norway

Relation: hal-03005449; https://hal.inria.fr/hal-03005449; https://hal.inria.fr/hal-03005449/document; https://hal.inria.fr/hal-03005449/file/STM%20model.pdf

Availability: https://hal.inria.fr/hal-03005449
https://hal.inria.fr/hal-03005449/document
https://hal.inria.fr/hal-03005449/file/STM%20model.pdf

Modelling a faillibilistic and perspectivistic reasoning

Authors: Kohler, Arnaud Aix Marseille Université (AMU)

Contributors: Kohler, Arnaud Aix Marseille Université (AMU)

Source: PFIA JIAF 2022 ; https://hal.science/hal-02120285 ; PFIA JIAF 2022, Jun 2022, Saint-Etienne, France

Subject Terms: ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO], [SCCO.COMP]Cognitive science/Computer science

Subject Geographic: Saint-Etienne, France

Availability: https://hal.science/hal-02120285
https://hal.science/hal-02120285v6/document
https://hal.science/hal-02120285v6/file/Modelling%20a%20faillibilistic%20and%20perspectivistic%20reasoning.pdf

Tameness and the power of programs over monoids in DA

Authors: Grosshans, Nathan Mckenzie, Pierre Segoufin, Luc et al.

Contributors: Grosshans, Nathan Mckenzie, Pierre Segoufin, Luc et al.

Source: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.science/hal-03114304 ; Logical Methods in Computer Science, 2022, 18 (3), pp.14:1-14:34. ⟨10.46298/lmcs-18(3:14)2022⟩ ; https://lmcs.episciences.org/9882

Subject Terms: Programs over monoids, Tameness, DA, Lower bounds, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.0: Algebraic language theory, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.3: Complexity Measures and Classes, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2101.07495; hal-03114304; https://hal.science/hal-03114304; https://hal.science/hal-03114304v3/document; https://hal.science/hal-03114304v3/file/Tameness_and_power_programs_over_DA-Published_version.pdf; ARXIV: 2101.07495

Availability: https://hal.science/hal-03114304
https://hal.science/hal-03114304v3/document
https://hal.science/hal-03114304v3/file/Tameness_and_power_programs_over_DA-Published_version.pdf
https://doi.org/10.46298/lmcs-18(3:14)2022

Pattern eliminating transformations

Authors: Cirstea, Horatiu Lermusiaux, Pierre Moreau, Pierre-Etienne et al.

Contributors: Cirstea, Horatiu Lermusiaux, Pierre Moreau, Pierre-Etienne et al.

Source: LOPSTR 2020 - 30th International Symposium on Logic-Based Program Synthesis and Transformation ; https://inria.hal.science/hal-02476012 ; LOPSTR 2020 - 30th International Symposium on Logic-Based Program Synthesis and Transformation, Sep 2020, Bologna, Italy

Subject Terms: Pattern semantics, Pattern-matching, Rewriting, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, [INFO.INFO-PL]Computer Science [cs]/Programming Languages [cs.PL]

Subject Geographic: Bologna, Italy

Availability: https://inria.hal.science/hal-02476012
https://inria.hal.science/hal-02476012v3/document
https://inria.hal.science/hal-02476012v3/file/main.pdf

Linear high-order deterministic tree transducers with regular look-ahead

Authors: Gallot, Paul, D Lemay, Aurélien Salvati, Sylvain et al.

Contributors: Gallot, Paul, D Lemay, Aurélien Salvati, Sylvain et al.

Source: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)
MFCS 2020 : The 45th International Symposium on Mathematical Foundations of Computer Science
https://hal.science/hal-02902853
MFCS 2020 : The 45th International Symposium on Mathematical Foundations of Computer Science, Andreas Feldmann
Michal Koucky
Anna Kotesovcova, Aug 2020, Prague, Czech Republic. ⟨10.4230/LIPIcs.MFCS.2020.34⟩

Subject Terms: Transducers, λ-calculus, Tree lanuages, and phrases Transducers, Trees 31, ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.2: Graph Theory/G.2.2.5: Trees, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.0: Automata (e.g., finite, push-down, resource-bounded), [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Subject Geographic: Prague, Czech Republic

Availability: https://hal.science/hal-02902853
https://hal.science/hal-02902853v2/document
https://hal.science/hal-02902853v2/file/MFCS%202020.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2020.34

Do model-theoretic grammars have fundamental advantages over proof-theoretic grammars?

Authors: Moot, Richard Exploration et exploitation de données textuelles (LIRMM Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) et al.

Contributors: Moot, Richard Exploration et exploitation de données textuelles (LIRMM Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) et al.

Source: https://hal-lirmm.ccsd.cnrs.fr/lirmm-04285668 ; 2023.

Subject Terms: Model theoretic syntax, Lambek calculus, Proof theory, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.7: Natural Language Processing, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]

Availability: https://hal-lirmm.ccsd.cnrs.fr/lirmm-04285668
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04285668v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-04285668v1/file/MTS.pdf

Verifying Unboundedness via Amalgamation

Authors: Anand, Ashwani Schmitz, Sylvain Schütze, Lia et al.

Contributors: Anand, Ashwani Schmitz, Sylvain Schütze, Lia et al.

Source: LICS 2024, 39th Annual ACM/IEEE Symposium on Logic in Computer Science ; https://hal.science/hal-04698657 ; LICS 2024, 39th Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2024, Tallinn, Estonia. pp.1-15, ⟨10.1145/3661814.3662133⟩

Subject Terms: ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Subject Geographic: Tallinn, Estonia

Time: Tallinn, Estonia

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2405.10296; ARXIV: 2405.10296

Availability: https://hal.science/hal-04698657
https://doi.org/10.1145/3661814.3662133

Fragments of First-Order Logic over Infinite Words (Extended Abstract)

Authors: Diekert, Volker Kufleitner, Manfred Faculty of Informatics and Mathematics (FMI) et al.

Contributors: Diekert, Volker Kufleitner, Manfred Faculty of Informatics and Mathematics (FMI) et al.

Source: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009
https://hal.inria.fr/inria-00359319
26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.325-336

Subject Terms: infinite words, regular languages, first-order logic, automata theory, semigroups, topology, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Subject Geographic: Freiburg, Germany

Relation: inria-00359319; https://hal.inria.fr/inria-00359319; https://hal.inria.fr/inria-00359319/document; https://hal.inria.fr/inria-00359319/file/27-diekert.pdf

Availability: https://hal.inria.fr/inria-00359319
https://hal.inria.fr/inria-00359319/document
https://hal.inria.fr/inria-00359319/file/27-diekert.pdf

What Does This Notation Mean Anyway? ; What Does This Notation Mean Anyway?: MBNF-Style Notation as it is Actually Used

Authors: Feller, David Wells, Joe B. Kamareddine, Fairouz et al.

Contributors: Feller, David Wells, Joe B. Kamareddine, Fairouz et al.

Source: 13th international Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
https://hal.inria.fr/hal-01812800
13th international Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, Jul 2018, Oxford, United Kingdom

Subject Terms: Abstract syntax, Notation, Formal definition, Set theory, ACM: F.: Theory of Computation, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.2: Grammars and Other Rewriting Systems, [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Subject Geographic: Oxford, United Kingdom

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1806.08771; hal-01812800; https://hal.inria.fr/hal-01812800; https://hal.inria.fr/hal-01812800/document; https://hal.inria.fr/hal-01812800/file/driver.pdf; ARXIV: 1806.08771

Availability: https://hal.inria.fr/hal-01812800
https://hal.inria.fr/hal-01812800/document
https://hal.inria.fr/hal-01812800/file/driver.pdf

An aperiodic set of 11 Wang tiles

Authors: Jeandel, Emmanuel Rao, Michael Designing the Future of Computational Models (MOCQUA) et al.

Contributors: Jeandel, Emmanuel Rao, Michael Designing the Future of Computational Models (MOCQUA) et al.

Source: ISSN: 2517-5599.

Subject Terms: ACM: G.: Mathematics of Computing/G.2: DISCRETE MATHEMATICS/G.2.1: Combinatorics, ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation/F.1.1.5: Unbounded-action devices (e.g., cellular automata, circuits, networks of machines), ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]

Relation: info:eu-repo/semantics/altIdentifier/arxiv/1506.06492; ARXIV: 1506.06492

Availability: https://inria.hal.science/hal-01166053
https://inria.hal.science/hal-01166053v4/document
https://inria.hal.science/hal-01166053v4/file/1506.06492.pdf
https://doi.org/10.19086/aic.18614

Open problems about regular languages, 35 years later

Authors: Pin, Jean-Eric Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)) Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS) et al.

Contributors: Pin, Jean-Eric Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)) Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS) et al.

Source: The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski ; https://hal.science/hal-01614375 ; Stavros Konstantinidis; Nelma Moreira; Rogério Reis; Jeffrey Shallit. The Role of Theory in Computer Science - Essays Dedicated to Janusz Brzozowski, World Scientific, 2017, 9789813148208. ⟨10.1142/9789813148208_0007⟩

Subject Terms: Regular languages, Open problems, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.0: Algebraic language theory, [INFO]Computer Science [cs], [MATH]Mathematics [math]

Availability: https://hal.science/hal-01614375
https://hal.science/hal-01614375v2/document
https://hal.science/hal-01614375v2/file/Brzozowski.pdf
https://doi.org/10.1142/9789813148208_0007

An Analytic Calculus for the Intuitionistic Logic of Proofs

Authors: Hill, Brian Poggiolesi, Francesca Groupement de Recherche et d'Etudes en Gestion à HEC (GREGH) et al.

Contributors: Hill, Brian Poggiolesi, Francesca Groupement de Recherche et d'Etudes en Gestion à HEC (GREGH) et al.

Source: Notre Dame J. Formal Logic 60, no. 3 (2019), 353-393

Subject Terms: ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, [SHS.PHIL]Humanities and Social Sciences/Philosophy, proof sequents, cut-elimination, 06 humanities and the arts, [INFO] Computer Science [cs], 16. Peace & justice, 0603 philosophy, ethics and religion, 01 natural sciences, logic of proofs, normalisation, [SHS.PHIL] Humanities and Social Sciences/Philosophy, normalization, 2010 MSC: 03F05 ,03B60, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.4: Knowledge Representation Formalisms and Methods/I.2.4.1: Modal logic, 03F05, [INFO]Computer Science [cs], 0101 mathematics, 03B42

File Description: application/pdf

Access URL: https://hal.archives-ouvertes.fr/hal-01621420/file/alp7%20%281%29.pdf
https://dblp.uni-trier.de/db/journals/ndjfl/ndjfl60.html#HillP19
https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-60/issue-3/An-Analytic-Calculus-for-the-Intuitionistic-Logic-of-Proofs/10.1215/00294527-2019-0008.full
https://hal.science/hal-01621420v1
https://projecteuclid.org/euclid.ndjfl/1562810593

Observational and behavioural equivalences for soft concurrent constraint programming

Authors: Fabio Gadducci Luis Fernando Pino Francesco Santini et al.

Contributors: Fabio Gadducci Luis Fernando Pino Francesco Santini et al.

Source: Journal of Logical and Algebraic Methods in Programming. 92:45-63

Subject Terms: ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, [INFO.INFO-DC]Computer Science [cs]/Distributed, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], Semantics of Programming Langages, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], 0102 computer and information sciences, 16. Peace & justice, ACM: F.: Theory of Computation, Parallel, 01 natural sciences, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, Soft Constraints, and Cluster Computing [cs.DC], Soft Concurrent Constraint Programming, Bisimulation, 13. Climate action, [INFO.INFO-DC] Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Concurrent Constraint Programming, 0101 mathematics

Access URL: https://inria.hal.science/hal-01675060v1
https://doi.org/10.1016/j.jlamp.2017.06.001
https://www.sciencedirect.com/science/article/pii/S2352220817301165
https://core.ac.uk/display/87081999
https://hal.inria.fr/hal-01675060
https://research.unipg.it/handle/11391/1417231
https://dblp.uni-trier.de/db/journals/jlp/jlp92.html#GadducciSPV17
https://hdl.handle.net/11568/872080
https://doi.org/10.1016/j.jlamp.2017.06.001
http://www.sciencedirect.com/science/journal/23522208
https://doi.org/10.1016/j.jlamp.2017.06.001
https://hdl.handle.net/11391/1417231

Proceedings Tenth International Workshop on Logical Frameworks and Meta Languages: Theory and Practice

Authors: Cervesato, Iliano Chaudhuri, Kaustuv Iliano Cervesato et al.

Contributors: Cervesato, Iliano Chaudhuri, Kaustuv Iliano Cervesato et al.

Subject Terms: ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

An Analytic Calculus for the Intuitionistic Logic of Proofs

Authors: Hill , Brian Poggiolesi, Francesca Groupement de Recherche et d'Etudes en Gestion à HEC (GREGH) et al.

Contributors: Hill , Brian Poggiolesi, Francesca Groupement de Recherche et d'Etudes en Gestion à HEC (GREGH) et al.

Source: ISSN: 0029-4527 ; Notre Dame Journal of Formal Logic ; https://hal.archives-ouvertes.fr/hal-01621420 ; Notre Dame Journal of Formal Logic, University of Notre Dame, 2019, 60, pp.353-393.

Subject Terms: normalisation, logic of proofs, cut-elimination, proof sequents, 2010 MSC: 03F05 ,03B60, ACM: I.: Computing Methodologies/I.2: ARTIFICIAL INTELLIGENCE/I.2.4: Knowledge Representation Formalisms and Methods/I.2.4.1: Modal logic, ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, [SHS.PHIL]Humanities and Social Sciences/Philosophy, [INFO]Computer Science [cs]

Relation: hal-01621420; https://hal.archives-ouvertes.fr/hal-01621420; https://hal.archives-ouvertes.fr/hal-01621420/document; https://hal.archives-ouvertes.fr/hal-01621420/file/alp7%20%281%29.pdf

Availability: https://hal.archives-ouvertes.fr/hal-01621420
https://hal.archives-ouvertes.fr/hal-01621420/document
https://hal.archives-ouvertes.fr/hal-01621420/file/alp7%20%281%29.pdf

A functional (Monadic) second-order theory of infinite trees

Authors: Das, Anupam Riba, Colin University of Birmingham Birmingham et al.

Contributors: Das, Anupam Riba, Colin University of Birmingham Birmingham et al.

Source: https://hal.science/hal-02067267 ; 2020.

Subject Terms: ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]

Availability: https://hal.science/hal-02067267
https://hal.science/hal-02067267v2/document
https://hal.science/hal-02067267v2/file/fsomso.pdf

Parametric updates in parametric timed automata

Authors: André, Étienne Lime, Didier Ramparison, Mathias et al.

Contributors: André, Étienne Lime, Didier Ramparison, Mathias et al.

Source: Lecture Notes in Computer Science ISBN: 9783030217587
Logical Methods in Computer Science, Vol Volume 17, Issue 2 (2021)

Subject Terms: FOS: Computer and information sciences, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO], BC1-199, Logic, Formal Languages and Automata Theory (cs.FL), ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.3: Decision problems, decidability, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], parametric difference bound matrix, parametric timed automata, Computer Science - Formal Languages and Automata Theory, QA75.5-76.95, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], clock regions, 01 natural sciences, [INFO.INFO-ES] Computer Science [cs]/Embedded Systems, computer science - formal languages and automata theory, timed automata, Electronic computers. Computer science, 0202 electrical engineering, electronic engineering, information engineering, parametric updates

File Description: application/pdf

Access URL: https://hal.archives-ouvertes.fr/hal-02153238/file/478668_1_En_3_Chapter.pdf
http://arxiv.org/abs/1904.08824
https://lmcs.episciences.org/5799
https://doi.org/10.23638/lmcs-17(2:13)2021
https://doaj.org/article/205d01d37ae54ff6bacf5d3e97a6a1e2
https://hal.science/hal-03340905v1/document
https://hal.science/hal-03340905v1
https://doi.org/10.23638/lmcs-17(2:13)2021
https://hal.archives-ouvertes.fr/hal-02153238
https://rd.springer.com/chapter/10.1007/978-3-030-21759-4_3
https://dblp.uni-trier.de/db/journals/corr/corr1904.html#abs-1904-08824
https://link.springer.com/chapter/10.1007/978-3-030-21759-4_3
https://doi.org/10.1007/978-3-030-21759-4_3
https://hal.archives-ouvertes.fr/hal-02153238/document
https://arxiv.org/abs/1904.08824
https://arxiv.org/pdf/1904.08824.pdf
https://ui.adsabs.harvard.edu/abs/2019arXiv190408824A/abstract
https://hal.science/hal-02153238v1
https://doi.org/10.1007/978-3-030-21759-4_3
https://hal.science/hal-02153238v1/document