| 1 |
Meta-Analysis of the Functional Neuroimaging Literature with Probabilistic Logic Programming
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-03590714 ; 2022 (2022)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
The contextual logic
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-03195162 ; 2022 (2022)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2022 (2022)
|
|
BASE
|
|
Show details
|
|
|
| 4 |
Game of Grounds
|
|
|
|
In: Objects, Structures, and Logics ; https://hal.archives-ouvertes.fr/hal-03602786 ; Objects, Structures, and Logics, 339, Springer International Publishing, pp.259-286, 2022, Boston Studies in the Philosophy and History of Science, ⟨10.1007/978-3-030-84706-7_10⟩ (2022)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
Calculi of Epistemic Grounding Based on Prawitz’s Theory of Grounds
|
|
|
|
In: ISSN: 0039-3215 ; EISSN: 1572-8730 ; Studia Logica ; https://hal.archives-ouvertes.fr/hal-03581352 ; Studia Logica, Springer Verlag (Germany), 2022, ⟨10.1007/s11225-021-09979-6⟩ (2022)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
Representation of Explanations of Possibilistic Inference Decisions
|
|
|
|
In: Symbolic and Quantitative Approaches to Reasoning with Uncertainty ; ECSQARU 2021: European Conference on Symbolic and Quantitative Approaches with Uncertainty ; https://hal-cea.archives-ouvertes.fr/cea-03406884 ; ECSQARU 2021: European Conference on Symbolic and Quantitative Approaches with Uncertainty, Sep 2021, Prague, Czech Republic. pp.513-527, ⟨10.1007/978-3-030-86772-0_37⟩ (2021)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
Demo Paper: Coqlex, an approach to generate verified lexers
|
|
|
|
In: ML 2021-ACM SIGPLAN Workshop on ML ; https://hal.inria.fr/hal-03470713 ; ML 2021-ACM SIGPLAN Workshop on ML, Aug 2021, Online event, United States ; https://icfp21.sigplan.org/home/mlfamilyworkshop-2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Superposition for Lambda-Free Higher-Order Logic
|
|
|
|
In: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.inria.fr/hal-03485227 ; Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2021, 17 (2), ⟨10.23638/LMCS-17(2:1)2021⟩ (2021)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
Multiplicative Linear Logic from Logic Programs and Tilings
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02895111 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 10 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 11 |
Verification of Program Transformations with Inductive Refinement Types
|
|
|
|
In: ISSN: 1049-331X ; ACM Transactions on Software Engineering and Methodology ; https://hal.inria.fr/hal-03518825 ; ACM Transactions on Software Engineering and Methodology, Association for Computing Machinery, 2021, 30 (1), pp.1-33. ⟨10.1145/3409805⟩ (2021)
|
|
BASE
|
|
Show details
|
|
|
| 12 |
Stellar Resolution: Multiplicatives - for the linear logician, through examples
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 13 |
A gentle introduction to Girard's Transcendental Syntax for the linear logician
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 14 |
Stellar Resolution: Multiplicatives - for the linear logician, through examples
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 15 |
Parametric updates in parametric timed automata
|
|
|
|
In: EISSN: 1860-5974 ; Logical Methods in Computer Science ; https://hal.archives-ouvertes.fr/hal-03340905 ; Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2021, 17 (2), pp.13:1-13:67. ⟨10.23638/LMCS-17(2:13)2021⟩ ; https://lmcs.episciences.org/7470 (2021)
|
|
Abstract:
International audience ; We introduce a new class of Parametric Timed Automata (PTAs) where we allow clocks to be compared to parameters in guards, as in classic PTAs, but also to be updated to parameters. We focus here on the EF-emptiness problem: "is the set of parameter valuations for which some given location is reachable in the instantiated timed automaton empty?". This problem is well-known to be undecidable for PTAs, and so it is for our extension. Nonetheless, if we update all clocks each time we compare a clock with a parameter and each time we update a clock to a parameter, we obtain a syntactic subclass for which we can decide the EF-emptiness problem and even perform the exact synthesis of the set of rational valuations such that a given location is reachable. To the best of our knowledge, this is the first non-trivial subclass of PTAs, actually even extended with parametric updates, for which this is possible.
|
|
Keyword:
[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal Languages/F.4.3.3: Decision problems; clock regions; decidability; parametric difference bound matrix; parametric timed automata; parametric updates; timed automata
|
|
URL: https://doi.org/10.23638/LMCS-17(2:13)2021
https://hal.archives-ouvertes.fr/hal-03340905
|
|
BASE
|
|
Hide details
|
|
|
| 16 |
Modelling predicates in propositional syntax ; Modélisation de prédicats dans la syntaxe propositionnelle
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-03195162 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 17 |
On the Dual Interpretation of Nouns as Types and Predicates in Semantic Type Theories
|
|
|
|
In: 2nd Workshop on Computing Semantics with Types, Frames and Related Structures, ESSLLI 2021 ; https://hal.archives-ouvertes.fr/hal-03468606 ; 2nd Workshop on Computing Semantics with Types, Frames and Related Structures, ESSLLI 2021, Jul 2021, Virtual, Netherlands (2021)
|
|
BASE
|
|
Show details
|
|
|
| 18 |
WDProp: Web Application to Analyse Multilingual Aspects of Wikidata Properties
|
|
|
|
In: OpenSym 2021: 17th International Symposium on Open Collaboration ; https://hal.archives-ouvertes.fr/hal-03621622 ; OpenSym 2021: 17th International Symposium on Open Collaboration, Sep 2021, Online, Spain. pp.1-12, ⟨10.1145/3479986.3479996⟩ (2021)
|
|
BASE
|
|
Show details
|
|
|
| 19 |
Improving Automation for Higher-Order Proof Steps
|
|
|
|
In: Lecture Notes ; FroCos 2021 - 13th International Symposium on Frontiers of Combining Systems ; https://hal.archives-ouvertes.fr/hal-03528009 ; FroCos 2021 - 13th International Symposium on Frontiers of Combining Systems, Sep 2021, Birmingham, United Kingdom. pp.139-153, ⟨10.1007/978-3-030-86205-3_8⟩ (2021)
|
|
BASE
|
|
Show details
|
|
|
| 20 |
Proofs, Grounds and Empty Functions: Epistemic Compulsion in Prawitz’s Semantics
|
|
|
|
In: ISSN: 0022-3611 ; EISSN: 1573-0433 ; Journal of Philosophical Logic ; https://hal.archives-ouvertes.fr/hal-03319247 ; Journal of Philosophical Logic, Springer Verlag, 2021, ⟨10.1007/s10992-021-09621-9⟩ (2021)
|
|
BASE
|
|
Show details
|
|
|
|
|
