NTNicolas Troquard

Nicolas Troquard

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Nicolas Troquard has a total of 57 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Ontological Modelling Principles for Computational Complexity

    by Anton Gnatenko, Oliver Kutz, Nicolas Troquard

    The field of computational complexity theory is a core theoretical subject in computer science with significant impact also for real-world applications. Although a plethora of individual results are known, a systematic conceptual organisation of this knowledge is still lacking. We propose a modelling approach for creating an ontologically well-founded knowledge base for the theory of computational complexity that will enable storing, querying and reasoning over the vast knowledge of algorithmic problems, complexity classes and their relationships. We determine the core concepts and relations of complexity theory and model them on two levels of approximation: a lightweight version based on the decidable description logic S R O I Q (the underlying formalism of the ontology language OWL 2 DL) and a further extended version based on first-order logic.

  • Extending FRET with SLEEC Rules: Formalization, Obligation Inference, and Monitoring

    by Mahrokh Mirani, Paola Inverardi, Patrizio Pelliccione, Franco Raimondi, Nicolas Troquard


  • Open Access

    Individual ethics and dispositions in the digital world

    by Donatella Donati, Simone Gozzano, Paola Inverardi, Nicolas Troquard

    Personal ethical preferences are key enablers for the design of autonomous systems that respect humans’ moral rights and values. This goes beyond embedding ethical and legal principles in the design of the system once and for all. It requires the ability to elicit personal soft ethical preferences, represent them in a digitally useable format, and link them to the individual for use when interacting with digital systems. The aim of this paper is to represent soft ethical preferences through dispositions. Dispositions are properties that are instantiated by any kind of entity and that may manifest if properly triggered; we will focus on moral dispositions of individuals. The dispositional properties in which we are interested are ethical and behavioural ones. We propose a general and formal model to elicit and handle individual moral preferences. The model allows for the examination of real-life situations involving moral dilemmas. Users engage with these scenarios, respond based on how they would act, and provide justifications for their choices. Their responses are then analysed to identify tendencies toward certain actions, which are represented as dispositions. These dispositions can subsequently serve as the foundation for disposition manifestation mechanisms.


  • Open Access

    Verifying Quantized Graph Neural Networks is PSPACE-complete

    by Marco Sälzer, Francois Schwarzentruber, Nicolas Troquard

    In this paper, we investigate verification of quantized Graph Neural Networks (GNNs), where some fixed-width arithmetic is used to represent numbers. We introduce the linear-constrained validity (LVP) problem for verifying GNNs properties, and provide an efficient translation from LVP instances into a logical language. We show that LVP is in PSPACE, for any reasonable activation functions. We provide a proof system. We also prove PSPACE-hardness, indicating that while reasoning about quantized GNNs is feasible, it remains generally computationally challenging.

  • Open Access

    A Logic for Reasoning about Aggregate-Combine Graph Neural Networks

    by Pierre Nunn, Marco Sälzer, François Schwarzentruber, Nicolas Troquard

    We propose a modal logic in which counting modalities appear in linear inequalities. We show that each formula can be transformed into an equivalent graph neural network (GNN). We also show that a broad class of GNNs can be transformed efficiently into a formula, thus significantly improving upon the literature about the logical expressiveness of GNNs. We also show that the satisfiability problem is PSPACE-complete. These results bring together the promise of using standard logical methods for reasoning about GNNs and their properties, particularly in applications such as GNN querying, equivalence checking, etc. We prove that such natural problems can be solved in polynomial space.


  • Open Access

    Existence and Verification of Nash Equilibria in Non-Cooperative Contribution Games with Resource Contention

    by Nicolas Troquard

    In resource contribution games, a class of non-cooperative games, the players want to obtain a bundle of resources and are endowed with bags of bundles of resources that they can make available into a common for all to enjoy. Available resources can then be used towards their private goals. A player is potentially satisfied with a profile of contributed resources when his bundle could be extracted from the contributed resources. Resource contention occurs when the players who are potentially satisfied, cannot actually all obtain their bundle. The player's preferences are always single-minded (they consider a profile good or they do not) and parsimonious (between two profiles that are equally good, they prefer the profile where they contribute less). What makes a profile of contributed resources good for a player depends on their attitude towards resource contention. We study the problem of deciding whether an outcome is a pure Nash equilibrium for three kinds of players' attitudes towards resource contention: public contention-aversity, private contention-aversity, and contention-tolerance. In particular, we demonstrate that in the general case when the players are contention-averse, then the problem is harder than when they are contention-tolerant. We then identify a natural class of games where, in presence of contention-averse preferences, it becomes tractable, and where there is always a Nash equilibrium.

  • Open Access

    Existence and verification of Nash equilibria in non-cooperative contribution games with resource contention

    by Nicolas Troquard

    In resource contribution games, a class of non-cooperative games, the players want to obtain a bundle of resources and are endowed with bags of bundles of resources that they can make available into a common for all to enjoy. Available resources can then be used towards their private goals. A player is potentially satisfied with a profile of contributed resources when his bundle could be extracted from the contributed resources. Resource contention occurs when the players who are potentially satisfied, cannot actually all obtain their bundle. The player’s preferences are always single-minded (they consider a profile good or they do not) and parsimonious (between two profiles that are equally good, they prefer the profile where they contribute less). What makes a profile of contributed resources good for a player depends on their attitude towards resource contention. We study the problem of deciding whether an outcome is a pure Nash equilibrium for three kinds of players’ attitudes towards resource contention: public contention-aversity, private contention-aversity, and contention-tolerance. In particular, we demonstrate that in the general case when the players are contention-averse, then the problem is harder than when they are contention-tolerant. We then identify a natural class of games where, in presence of contention-averse preferences, it becomes tractable, and where there is always a Nash equilibrium.

  • Non-Normal Modal Description Logics

    by Tiziano Dalmonte, Andrea Mazzullo, Ana Ozaki, Nicolas Troquard