670 citations
- J. Cuevas2 profiles31 · h 118
- L. Lyons7 profiles31 · h 118
- M. Feindt3 profiles31 · h 111
- M. Houlden5 profiles31 · h 50
- N. Van Remortel6 profiles31 · h 52
- P. Renton7 profiles31 · h 60
- R. Orava4 profiles31 · h 78
- A. Savoy-Navarro6 profiles30 · h 111
- F. Šforza28
- G. Gomez Ceballos26
- K. Österberg26
- C. P. Marino5 profiles24
- Istituto Nazionale di Fisica Nucleare, Sezione di BolognaIT114 papers
- Osservatorio astronomico di BolognaIT66 papers
- Joint Institute for Nuclear ResearchRU40 papers
- Centre National de la Recherche ScientifiqueFR39 papers
- University of OxfordGB37 papers
- University of PaduaIT37 papers
- University of LiverpoolGB34 papers
- Karlsruhe Institute of TechnologyDE33 papers
- National Institute for AstrophysicsIT31 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR30 papers
- National and Kapodistrian University of AthensGR30 papers
- University of HelsinkiFI30 papers
6 papers · 1 filter
Confluence Results for a Quantum Lambda Calculus with Measurements
Ugo Dal Lago, Andrea Masini, Margherita Zorzi
A strong confluence result for Q*, a quantum lambda-calculus with measurements, is proved. More precisely, confluence is shown to hold both for finite and infinite computations. Th…
Taming Modal Impredicativity: Superlazy Reduction
Ugo Dal Lago, Luca Roversi, Luca Vercelli
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is considered as computation. We introduce modal impredicativity as a new form of impredicativi…
Light Logics and Optimal Reduction: Completeness and Complexity
Patrick Baillot, Paolo Coppola, Ugo Dal Lago
Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (E…
Mapping Fusion and Synchronized Hyperedge Replacement into Logic Programming
Ivan Lanese, Ugo Montanari
In this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems. In particular we analyze the relationship…
A CHR-based Implementation of Known Arc-Consistency
Marco Alberti, Marco Gavanelli, Evelina Lamma +2
In classical CLP(FD) systems, domains of variables are completely known at the beginning of the constraint propagation process. However, in systems interacting with an external env…
On Decidability of Expressive Description Logics with Composition of Roles in Number Restrictions
Fabio Grandi
Description Logics are knowledge representation formalisms which have been used in a wide range of application domains. Owing to their appealing expressiveness, we consider in this…