Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 22 for “"Settore MAT/01 - Logica Matematica"”.
-
HOMOTOPY SETOIDS AND GENERALIZED QUOTIENT COMPLETION
In this thesis, we deal with some categorical structures arising from the Martin-Löf Intuitionistic Type Theory. In the first part, we introduce the homotopy setoids, considering ideas from the homotopy type theory, and we study their categorical properties. In order to do that, we use the …
-
Exploiting SAT and SMT Techniques for Automated Reasoning and Ontology Manipulation in Description Logics
… however, the interest in the problem of automated reasoning in Description Logics has seen a tremendous growth because of the explosion of new notable applications in the domains of Semantic Web and of bio-medical ontologies. The more real-world problems are represented through DL-based …
-
Dealing with Semantic Heterogeneity in Classifications
… solutions range from fully manual to fully automatic approaches. Manual approaches are very precise, but automation becomes unavoidable when classifications contain thousands of nodes with millions of candidate correspondences. As fun-damental preliminary step towards automation, S-Match …
-
Query Answering over Contextualized RDF/OWL Knowledge with Expressive Bridge Rules: Decidable classes
… over contextualized knowledge in quad format augmented with expressive forall-existential bridge rules. Such bridge rules contain conjunctions, existentially quantified variables in the head, and are strictly more expressive than the bridge rules considered so far in similar setting. A set …
-
Nonstandard Models in Measure Theory and in functional Analysis
This thesis is concerned with the study of nonstandard models in measure theory and in functional analysis. In measure theory, we define elementary numerosities, that are additive measures that take on values in a non-archimedean field and for which the measure of every singleton is 1. We have …
-
A DOCTRINAL VIEW OF LOGIC
… the analysis of both syntax and semantics of logical theories — in particular first-order theories — using the same mathematical structure. The thesis begins with a thorough analysis of Henkin’s Theorem for first-order logic (“every consistent theory has a model”), with the aim of interpreting …
-
A CATEGORICAL-ALGEBRAIC EXPLORATION OF MODELS FOR MANY-VALUED LOGIC
In this thesis, we study from a categorical-algebraic point of view the structures of lattice-ordered groups and MV-algebras, which are used in modeling logic with many truth values. In the first part, we show that the semi-abelian category of lattice-ordered groups satisfies several important …
-
Proof-Theoretical Aspects of Well Quasi-Orders and Phase Transitions in Arithmetical Provability
… of proof theory - more precisely, in reverse mathematics and constructive mathematics. Reversed mathematics, proposed by Harvey Friedman, aims to classify the strength of mathematical theorems by identifying the required axioms. In this framework, we focus on two classical results relative to …
-
An Effective SMT Engine for Formal Verification
… (SMT) solvers. In this thesis, we present MathSAT, a modern, efficient SMT solver that provides several important functionalities, and can be used as a workhorse engine in formal verification. We develop novel algorithms for two functionalities which are very important in verification -- …
-
Verification of Hybrid Systems using Satisfiability Modulo Theories
… the system,there is an increasing need of automatic techniques to support the design phase, ensuring that a system behaves as expected in all the possible operating conditions.In this thesis, we propose novel techniques for the verification and the validation of hybrid systems using …
-
Planning and Scheduling in Temporally Uncertain Domains
Any form of model-based reasoning is limited by the adherence of the model to the actual reality. Scheduling is the problem of finding a suitable timing to execute a given set of activities accommodating complex temporal constraints. Planning is the problem of finding a strategy for an agent to …
-
A Formal Foundation of FDI Design via Temporal Epistemic Logic
… about partially observable systems. Automated reasoning techniques can then be applied to perform validation, verification, and synthesis of the FDI. This formal process guarantees that the generated FDI satisfies the designer expectations. The problems deriving from this process were out …
-
Substructurality and residuation in logic and algebra
… was invented by G. Gentzen in order to give axiomatizations for Classical and Intuitionistic Propositional Logics. And the rules he gave in both cases can be grouped in different categories: because of its character, the Cut rule deserves a special category for itself; then we have the rules of …
-
Walking around quasi-orders on graphs, spaces, and their subsets
L'abstract è presente nell'allegato / the abstract is in the attachment
Page 1 of 2