Marco B. Caminati

Marco B. Caminati
University of St Andrews · School of Computer Science

http://caminati.co.nr/

About

35
Publications
1,041
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
156
Citations
Additional affiliations
January 2007 - December 2011
Sapienza University of Rome
Position
  • Metodi Matematici e Informatici per la Biologia
Description
  • Teaching assistant
Education
January 2007 - December 2011
Sapienza University of Rome
Field of study
  • Mathematics

Publications

Publications (35)
Chapter
We take inspiration from a problem from the healthcare domain, where patients with several chronic conditions follow different guidelines designed for the individual conditions, and where the aim is to find the best treatment plan for a patient that avoids adverse drug reactions, respects patient’s preferences and prioritises drug efficacy. Each ch...
Article
Scenarios of execution are commonly used to specify partial behaviour and interactions between different objects and components in a system. To avoid overall inconsistency in specifications, various automated methods have emerged in the literature to compose scenario-based models. In recent work, we have shown how the theorem prover Isabelle/HOL ca...
Article
Full-text available
Common chronic conditions are routinely treated following standardised procedures known as clinical guidelines. For patients suffering from two or more chronic conditions, known as multimorbidity, several guidelines have to be applied simultaneously, which may lead to severe adverse effects when the combined recommendations and prescribed medicatio...
Chapter
Clinical guidelines are evidence-based care plans which detail the essential steps to be followed when caring for patients with a specific clinical problem, usually a chronic disease (e.g. diabetes, cardiovascular disease, chronic kidney disease, cancer, chronic obstructive pulmonary disease, and so on). Recommendations for chronic diseases include...
Conference Paper
Complex systems are usually modelled through a combination of structural and behavioural models, where separate behavioural models make it easier to design and understand partial behaviour. When partial models are combined, we need to guarantee that they are consistent, and several automated techniques have been developed to check this. We argue th...
Conference Paper
Scenarios of execution are commonly used to specify partial behaviour and interactions between different objects and components in a system. To avoid overall inconsistency in specifications, various automated methods have emerged in the literature to compose (behavioural) models. In recent work, we have shown how the theorem prover Isabelle can be...
Article
Full-text available
Scenarios of execution are commonly used to specify partial behaviour and interactions between different objects and components in a system. To avoid overall inconsistency in specifications, various automated methods have emerged in the literature to compose (behavioural) models. In recent work, we have shown how the theorem prover Isabelle can be...
Article
Full-text available
Complex systems are usually modelled through a combination of structural and behavioural models, where separate behavioural models make it easier to design and understand partial behaviour. When partial models are combined, we need to guarantee that they are consistent, and several automated techniques have been developed to check this. We argue th...
Conference Paper
An event structure is a mathematical abstraction modeling concepts as causality, conflict and concurrency between events. While many other mathematical structures, including groups, topological spaces, rings, abound with algorithms and formulas to generate, enumerate and count particular sets of their members, no algorithm or formulas are known to...
Article
Full-text available
An event structure is a mathematical abstraction modeling concepts as causality, conflict and concurrency between events. While many other mathematical structures, including groups, topological spaces, rings, abound with algorithms and formulas to generate, enumerate and count particular sets of their members, no algorithm or formulas are known to...
Conference Paper
Full-text available
We introduce `formal methods' of mechanized reasoning from computer science to address two problems in auction design and practice: is a given auction design soundly specified, possessing its intended properties; and, is the design faithfully implemented when actually run? Failure on either front can be hugely costly in large auctions. In the famil...
Article
Full-text available
An original result about Hilbert Positive Propositional Calculus introduced in [11] is proven. That is, it is shown that the pseudo-canonical formulae of that calculus (and hence also the canonical ones, see [17]) are a subset of the classical tautologies.
Article
We present an original theorem in auction theory: it specifies general conditions under which the sum of the payments of all bidders is necessarily not identically zero, and more generally not constant. Moreover, it explicitly supplies a construction for a finite minimal set of possible bids on which such a sum is not constant. In particular, this...
Article
Full-text available
When faced with the question of how to represent properties in a formal proof system any user has to make design decisions. We have proved three of the theorems from Maskin's 2004 survey article on Auction Theory using the Isabelle/HOL system, and we have produced verified code for combinatorial Vickrey auctions. A fundamental question in this was...
Article
Full-text available
Using mechanised reasoning we prove that combinatorial Vickrey auctions are soundly specified in that they associate a unique outcome (allocation and transfers) to any valid input (bids). Having done so, we auto-generate verified executable code from the formally defined auction. This removes a source of error in implementing the auction design. We...
Conference Paper
Full-text available
Novel auction schemes are constantly being designed. Their design has significant consequences for the allocation of goods and the revenues generated. But how to tell whether a new design has the desired properties, such as efficiency, i.e. allocating goods to those bidders who value them most? We say: by formal, machine-checked proofs. We investig...
Article
Full-text available
A strictly formal, set-theoretical treatment of classical first-order logic is given. Since this is done with the goal of a concrete Mizar formalization of basic results (Lindenbaum lemma; Henkin, satisfiability, completeness and Lowenheim-Skolem theorems) in mind, it turns into a systematic pursue of simplification: we give up the notions of free...
Article
The central aim of the Mizar project is to produce strictly formalized mathematical statements with mechanically certified proofs. When writing a Mizar formalization, a significant amount of the user’s time typically goes into browsing the Mizar Mathematical Library (MML) for the already-proved results he needs. Here a few techniques to reduce this...
Article
First of a series of articles laying down the bases for classical first-order model theory. These articles introduce a framework for treating arbitrary languages with equality. This framework is kept as generic and modular as possible: both the language and the derivation rule are introduced as a type, rather than a fixed functor; definitions and r...
Article
Second of a series of articles laying down the bases for classical first-order model theory. A language is defined basically as a tuple made of an integer-valued function (adicity), a symbol of equality and a symbol for the NOR logical connective. The only requests for this tuple to be a language is that the value of the adicity in = is -2 and that...
Article
Fourth of a series of articles laying down the bases for classical first-order model theory. This paper supplies a toolkit of constructions to work with languages and interpretations, and results relating them. The free interpretation of a language, having as a universe the set of terms of the language itself, is defined. The quotient of an interpr...
Article
Fifth of a series of articles laying down the bases for classical first-order model theory. This paper presents multiple themes: first it introduces sequents, rules and sets of rules for a first-order language 4L as L-dependent types. Then defines derivability and provability according to a set of rules, and gives several technical lemmas binding a...
Article
First Order Languages: Further Syntax and Semantics Third of a series of articles laying down the bases for classical first order model theory. Interpretation of a language in a universe set. Evaluation of a term in a universe. Truth evaluation of an atomic formula. Reassigning the value of a symbol in a given interpretation. Syntax and semantics o...
Article
Full-text available
The author has submitted to Mizar Mathematical Library a series of five articles introducing a framework for the formalization of classical first-order model theory.In them, Goedel's completeness and Lowenheim-Skolem theorems have also been formalized for the countable case, to offer a first application of it and to showcase its utility.This i...
Article
Full-text available
A Henkin-style proof of completeness of first-order classical logic is given with respect to a very small set (notably missing cut rule) of Genzten deduction rules for intuitionistic sequents. Insisting on sparing on derivation rules, satisfiability theorem is seen to need weaker assumptions than completeness theorem, the missing request being exac...
Article
Full-text available
A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case. As a supplement, the same conjecture is shown, through computing a counterexample, to be false when unimodular...
Article
Full-text available
We investigate the multiparticle quantum superposition and the persistence of multipartite entanglement of the quantum superposition generated by the quantum injected high-gain optical parametric amplification of a single photon. The physical configuration based on the optimal universal quantum cloning has been adopted to investigate how the entang...
Conference Paper
We investigate multiphoton states generated by high‐gain optical parametric amplification of a single injected photon, polarization encoded as a “qubit”. Two different experimental configurations were adopted in order to investigate two different quantum processes: the optimal universal quantum cloning and the optimal phase‐covariant cloning. The...
Article
We investigate multiphoton states generated by high-gain optical parametric amplification of a single injected photon—polarization encoded as a qubit. The experimental configuration exploits the optimal phase-covariant cloning. The output state of the apparatus is found to exhibit the quantum superposition property of mesoscopic multiphoton assembl...
Article
Full-text available
The multiphoton states generated by high-gain spontaneous parametric down-conversion (SPDC) in presence of large losses are investigated theoretically and experimentally. The explicit form for the two-photon output state has been found to exhibit a Werner structure very resilient to losses for any value of the gain parameter, g. The theoretical res...
Article
Full-text available
The multiphoton states generated by high-gain spontaneous parametric down-conversion (SPDC) in presence of large losses are investigated theoretically and experimentally. The explicit form for the two-photon output state has been found to exhibit a Werner structure very resilient to losses for any value of the gain parameter, g. The theoretical res...

Network

Cited By

Projects

Project (1)