Elena Bellodi Università di Ferrara 26 Marzo 2013 Abstract This thesis deals with Statistical Relational Learning (SRL), a research area combining principles and ideas from three important subfields of Artificial Intelligence: machine learning, knowledge representation and reasoning on uncertainty. Machine…
PhD Theses
Constraints meet concurrency
By Jacopo Mauro Università di Bologna 10 Maggio 2012 Abstract e investigate the benefits that emerge when the fields of constraint programming and concurrency meet. On one hand, constraints can be use in concurrency theory to increase the conciseness and…
Expressiveness, decidability, and undecidability of Interval Temporal Logic
Dario Della Monica Università di Udine 1 Aprile 2011 ABSTRACT Interval Temporal Logics are formalisms particularly suitable to express temporal properties. Unlike standard temporal logics, they use intervals, instead of points, as primitive ontological entities. The most studied propositional interval…
On the hybridization of constraint programming and local search techniques. Models and software tools
By Raffaele Cipriano Università di Udine 1 Aprile 2011 ABSTRACT This thesis aims to study the integration of the Constraint Programming and Local Search paradigms with three main goals in mind. First we want to combine together two free state-…
Kripke semantics and tableau procedures for constructive description logics
By Loris Bozzato Università degli Studi dell’Insubria (Varese) 12 gennaio 2011 Abstract In this work we present the decidable constructive description logic KALC: the logic is based on a Kripke-style semantics for the language of the description logic ALC and…
Dynamic Magic Sets
By Mario Alviano Unical Dicembre 2010 Abstract Disjunctive Datalog with stable model semantics is a rule–based language for knowledge representation and common sense reasoning that also allows to use queries for checking the presence of specific atoms in stable models.…
Decidability of Interval Temporal Logics
Pietro Sala Università di Udine 15 Marzo 2010 FULL PDF
Normal Form Nested Programs
By Annamaria Bria Unical February 2010 ABSTRACT In Disjunctive Logic Programming (DLP) the heads (resp. the bodies) of rules are disjunctions (resp. conjunctions) of simple constructs, viz. atoms and literals. DLP, under the answer set semantics, is established as an…
Conditional and Preferential Logics: Proof Methods and Theorem Proving
By Gianluca Pozzato Università di Torino Novembre 2009 Abstract This volume is focused on proof methods and theorem proving for Conditional and Preferential logics. Conditional logics are extensions of classical logic by means of a conditional operator, usually denoted as…
Specification and Verification of Declarative Open Interaction Models – A Logic-based framework
By Marco Montali Università di Bologna 8 Aprile 2009 Abstract The advent of distributed and heterogeneous systems has laid the foundation for the birth of new architectural paradigms, in which many separated and autonomous entities collaborate and interact to the…