| 1 |
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
|
|
|
| 2 |
Multiplicative Linear Logic from Logic Programs and Tilings
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02895111 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
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
|
|
|
| 4 |
Stellar Resolution: Multiplicatives - for the linear logician, through examples
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
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
|
|
|
| 6 |
Stellar Resolution: Multiplicatives - for the linear logician, through examples
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
Concurrent Game Semantics: Easy as Pi
|
|
|
|
In: https://hal.inria.fr/hal-03128187 ; [Research Report] Inria. 2020 (2020)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
The Logic of Language: from the Distributional to the Structuralist Hypothesis through Types and Interaction
|
|
|
|
In: https://hal.archives-ouvertes.fr/hal-03064480 ; 2020 (2020)
|
|
BASE
|
|
Show details
|
|
|
| 10 |
An Introduction to Complex Systems: Making Sense of a Changing World
|
|
|
|
In: Faculty Books (2019)
|
|
BASE
|
|
Show details
|
|
|
| 11 |
Decidable fragments of first-order logic and of first-order linear arithmetic with uninterpreted predicates
|
|
Voigt, Marco. - : Saarländische Universitäts- und Landesbibliothek, 2019
|
|
BASE
|
|
Show details
|
|
|
| 12 |
English Coordination in Linear Categorial Grammar
|
|
|
|
In: http://rave.ohiolink.edu/etdc/view?acc_num=osu1451933040 (2016)
|
|
BASE
|
|
Show details
|
|
|
| 13 |
Lexical Semantics with Linear Types
|
|
|
|
In: EasyChair Proceedings in ComputingNLCS'15. Third Workshop on Natural Language and Computer Science ; NLCS'15. Third Workshop on Natural Language and Computer Science ; https://hal.inria.fr/hal-01214442 ; NLCS'15. Third Workshop on Natural Language and Computer Science, Makoto Kanazawa, Jul 2015, Kyoto, Japan. pp.72 ; http://www.easychair.org/publications/volume/NLCS-15 (2015)
|
|
BASE
|
|
Show details
|
|
|
| 14 |
Non-linear Second order Abstract Categorial Grammars and deletion
|
|
|
|
In: NLCS 2015: Natural Language and Computer Science ; https://hal.archives-ouvertes.fr/hal-01251127 ; NLCS 2015: Natural Language and Computer Science, Makoto Kanazawa, 2015, Kyoto, Japan (2015)
|
|
BASE
|
|
Show details
|
|
|
| 15 |
Comparing and evaluating extended Lambek calculi
|
|
|
|
In: Empirical advances in categorial grammars ; https://hal.archives-ouvertes.fr/hal-01164670 ; Empirical advances in categorial grammars, Yusuke Kubota and Robert Levine, Aug 2015, Barcelona, Spain (2015)
|
|
BASE
|
|
Show details
|
|
|
| 16 |
Propositional glue and the projection architecture of LFG
|
|
|
|
In: Linguistics and Philosophy: a journal of natural language syntax, semantics, logic, pragmatics, and processing (2015)
|
|
BASE
|
|
Show details
|
|
|
| 18 |
A first-order policy language for history-based transaction monitoring
|
|
|
|
In: Proceedings of The 6th International Colloquium on Theoretical Aspects of Computing (ICTAC 2009) ; http://www.springerlink.com/content/978-3-642-03465-7 (2015)
|
|
Abstract:
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting, the decision to trust a user may sensibly be based on that user's past behaviour. We introduce a specification language based on linear temporal logic for expressing a policy for categorising the behaviour patterns of a user depending on its transaction history. We also present an algorithm for checking whether the transaction history obeys the stated policy. To be useful in a real setting, such a language should allow one to express realistic policies which may involve parameter quantification and quantitative or statistical patterns. We introduce several extensions of linear temporal logic to cater for such needs: a restricted form of universal and existential quantification; arbitrary computable functions and relations in the term language; and a "counting" quantifier for counting how many times a formula holds in the past. We then show that model checking a transaction history against a policy, which we call the history-based transaction monitoring problem, is PSPACE-complete in the size of the policy formula and the length of the history, assuming that the underlying interpreted functions and relations are polynomially computable. The problem becomes decidable in polynomial time when the policies are fixed. We also consider the problem of transaction monitoring in the case where not all the parameters of actions are observable. We formulate two such "partial observability" monitoring problems, and show their decidability under certain restrictions.
|
|
Keyword:
Computability and decidability; Computer science; First-order; Keywords: Computable functions; Linear temporal logic; Linguistics; Model checking; Observab; Online trading; Partial observability; Policy language; Polynomial-time; Statistical pattern; Term languages
|
|
URL: http://hdl.handle.net/1885/57602
https://doi.org/10.1007/978-3-642-03466-4_6
|
|
BASE
|
|
Hide details
|
|
|
| 19 |
Interacting Hopf Algebras- the Theory of Linear Systems ; Interacting Hopf Algebras - la théorie des systèmes linéaires
|
|
|
|
In: https://tel.archives-ouvertes.fr/tel-01218015 ; Formal Languages and Automata Theory [cs.FL]. Ecole normale supérieure de lyon - ENS LYON, 2015. English. ⟨NNT : 2015ENSL1020⟩ (2015)
|
|
BASE
|
|
Show details
|
|
|
| 20 |
Investigating the expressivity of linear logic subsystems characterizing polynomial time ; Exploration de l’expressivité des sous-systèmes de la logique linéaire caractérisant le temps polynomial
|
|
|
|
In: https://tel.archives-ouvertes.fr/tel-01204992 ; Other [cs.OH]. Ecole normale supérieure de lyon - ENS LYON, 2015. English. ⟨NNT : 2015ENSL1001⟩ (2015)
|
|
BASE
|
|
Show details
|
|
|
|
|
