Search Results

Documents authored by Gavanelli, Marco


Document
The Horn Fragment of Branching Algebra

Authors: Alessandro Bertagnon, Marco Gavanelli, Alessandro Passantino, Guido Sciavicco, and Stefano Trevisani

Published in: LIPIcs, Volume 178, 27th International Symposium on Temporal Representation and Reasoning (TIME 2020)


Abstract
Branching Algebra is the natural branching-time generalization of Allen’s Interval Algebra. As in the linear case, the consistency problem for Branching Algebra is NP-hard. Being relatively new, however, not much is known about the computational behaviour of the consistency problem of its sub-algebras, except in the case of the recently found subset of convex branching relations, for which the consistency of a network can be tested via path consistency and it is therefore deterministic polynomial. In this paper, following Nebel and Bürckert, we define the Horn fragment of Branching Algebra, and prove that it is a sub-algebra of the latter, being closed under inverse, intersection, and composition, that it strictly contains both the convex fragment of Branching Algebra and the Horn fragment of Interval Algebra, and that its consistency problem can be decided via path consistency. Finally, we experimentally prove that the Horn fragment of Branching Algebra can be used as an heuristic for checking the consistency of a generic network with a considerable improvement over the convex subset.

Cite as

Alessandro Bertagnon, Marco Gavanelli, Alessandro Passantino, Guido Sciavicco, and Stefano Trevisani. The Horn Fragment of Branching Algebra. In 27th International Symposium on Temporal Representation and Reasoning (TIME 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 178, pp. 5:1-5:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)


Copy BibTex To Clipboard

@InProceedings{bertagnon_et_al:LIPIcs.TIME.2020.5,
  author =	{Bertagnon, Alessandro and Gavanelli, Marco and Passantino, Alessandro and Sciavicco, Guido and Trevisani, Stefano},
  title =	{{The Horn Fragment of Branching Algebra}},
  booktitle =	{27th International Symposium on Temporal Representation and Reasoning (TIME 2020)},
  pages =	{5:1--5:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-167-2},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{178},
  editor =	{Mu\~{n}oz-Velasco, Emilio and Ozaki, Ana and Theobald, Martin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2020.5},
  URN =		{urn:nbn:de:0030-drops-129736},
  doi =		{10.4230/LIPIcs.TIME.2020.5},
  annote =	{Keywords: Constraint programming, Consistency, Branching time, Horn Fragment}
}
Document
Deciding the Consistency of Branching Time Interval Networks

Authors: Marco Gavanelli, Alessandro Passantino, and Guido Sciavicco

Published in: LIPIcs, Volume 120, 25th International Symposium on Temporal Representation and Reasoning (TIME 2018)


Abstract
Allen's Interval Algebra (IA) is one of the most prominent formalisms in the area of qualitative temporal reasoning; however, its applications are naturally restricted to linear flows of time. When dealing with nonlinear time, Allen's algebra can be extended in several ways, and, as suggested by Ragni and Wölfl [M. Ragni and S. Wölfl, 2004], a possible solution consists in defining the Branching Algebra (BA) as a set of 19 basic relations (13 basic linear relations plus 6 new basic nonlinear ones) in such a way that each basic relation between two intervals is completely defined by the relative position of the endpoints on a tree-like partial order. While the problem of deciding the consistency of a network of IA-constraints is well-studied, and every subset of the IA has been classified with respect to the tractability of its consistency problem, the fragments of the BA have received less attention. In this paper, we first define the notion of convex BA-relation, and, then, we prove that the consistency of a network of convex BA-relations can be decided via path consistency, and is therefore a polynomial problem. This is the first non-trivial tractable fragment of the BA; given the clear parallel with the linear case, our contribution poses the bases for a deeper study of fragments of BA towards their complete classification.

Cite as

Marco Gavanelli, Alessandro Passantino, and Guido Sciavicco. Deciding the Consistency of Branching Time Interval Networks. In 25th International Symposium on Temporal Representation and Reasoning (TIME 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 120, pp. 12:1-12:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@InProceedings{gavanelli_et_al:LIPIcs.TIME.2018.12,
  author =	{Gavanelli, Marco and Passantino, Alessandro and Sciavicco, Guido},
  title =	{{Deciding the Consistency of Branching Time Interval Networks}},
  booktitle =	{25th International Symposium on Temporal Representation and Reasoning (TIME 2018)},
  pages =	{12:1--12:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-089-7},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{120},
  editor =	{Alechina, Natasha and N{\o}rv\r{a}g, Kjetil and Penczek, Wojciech},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2018.12},
  URN =		{urn:nbn:de:0030-drops-97779},
  doi =		{10.4230/LIPIcs.TIME.2018.12},
  annote =	{Keywords: Constraint programming, Consistency, Branching time}
}
Document
Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unit

Authors: Massimiliano Cattafi, Rosa Herrero, Marco Gavanelli, Maddalena Nonato, and Federico Malucelli

Published in: LIPIcs, Volume 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (2012)


Abstract
Although sometimes it is necessary, no one likes to stay in a hospital, and patients who need to stay in bed but do not require constant medical surveillance prefer their own bed at home. At the same time, a patient in a hospital has a high cost for the community, that is not acceptable if the patient needs service only a few minutes a day. For these reasons, the current trend in Europe and North-America is to send nurses to visit patients in their home: this choice reduces costs for the community and gives better quality of life to patients. On the other hand, it introduces the combinatorial problem of assigning patients to the available nurses in order to maximize the quality of service, without having nurses travel for overly long distances. In this paper, we describe the problem as a practical application of Constraint Logic Programming. We first introduce the problem, as it is currently addressed by the nurses in the National Health Service (NHS) in Ferrara, a mid-sized city in the North of Italy. Currently, the nurses solve the problem by hand, and this introduces several inefficiencies in the schedules. We formalize the problem, obtained by interacting with the nurses in the NHS, into a Constraint Logic Programming model. In order to solve the problem efficiently, we implemented a new constraint that tackles with the routing part of the problem. We propose a declarative semantics for the new constraint, and an implementation based on an external solver.

Cite as

Massimiliano Cattafi, Rosa Herrero, Marco Gavanelli, Maddalena Nonato, and Federico Malucelli. Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unit. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 415-424, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)


Copy BibTex To Clipboard

@InProceedings{cattafi_et_al:LIPIcs.ICLP.2012.415,
  author =	{Cattafi, Massimiliano and Herrero, Rosa and Gavanelli, Marco and Nonato, Maddalena and Malucelli, Federico},
  title =	{{Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unit}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{415--424},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-43-9},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{17},
  editor =	{Dovier, Agostino and Santos Costa, V{\'\i}tor},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2012.415},
  URN =		{urn:nbn:de:0030-drops-36419},
  doi =		{10.4230/LIPIcs.ICLP.2012.415},
  annote =	{Keywords: CLP(FD), Nurse Scheduling Applications, Home Health Care}
}
Document
A Bilevel Mixed Integer Linear Programming Model for Valves Location in Water Distribution Systems

Authors: Andrea Peano, Maddalena Nonato, Marco Gavanelli, Stefano Alvisi, and Marco Franchini

Published in: OASIcs, Volume 22, 3rd Student Conference on Operational Research (2012)


Abstract
The positioning of valves on the pipes of a Water Distribution System (WDS) is a core decision in the design of the isolation system of a WDS. When closed, valves permit to isolate a small portion of the network, so called a sector, which can be de-watered for maintenance purposes at the cost of a supply disruption. However, valves have a cost so their number is limited, and their position must be chosen carefully in order to minimize the worst-case supply disruption which may occur during pipe maintenance. Supply disruption is usually measured as the undelivered user demand. When a sector is isolated by closing its boundary valves, other portions of the network may become disconnected from the reservoirs as a secondary effect, and experience supply disruption as well. This induced isolation must be taken into account when computing the undelivered demand induced by a sector isolation. While sector topology can be described in terms of graph partitioning, accounting for induced undelivered demand requires network flow modeling. The aim of the problem is to locate a given number of valves at the extremes of the network pipes so that the maximum supply disruption is minimized. We present a Bilevel Mixed Integer Linear Programming (MILP) model for this problem and show how to reduce it to a single level MILP by exploiting duality. Computational results on a real case study are presented, showing the effectiveness of the approach.

Cite as

Andrea Peano, Maddalena Nonato, Marco Gavanelli, Stefano Alvisi, and Marco Franchini. A Bilevel Mixed Integer Linear Programming Model for Valves Location in Water Distribution Systems. In 3rd Student Conference on Operational Research. Open Access Series in Informatics (OASIcs), Volume 22, pp. 103-112, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2012)


Copy BibTex To Clipboard

@InProceedings{peano_et_al:OASIcs.SCOR.2012.103,
  author =	{Peano, Andrea and Nonato, Maddalena and Gavanelli, Marco and Alvisi, Stefano and Franchini, Marco},
  title =	{{A Bilevel Mixed Integer Linear Programming Model for Valves Location in Water Distribution Systems}},
  booktitle =	{3rd Student Conference on Operational Research},
  pages =	{103--112},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-39-2},
  ISSN =	{2190-6807},
  year =	{2012},
  volume =	{22},
  editor =	{Ravizza, Stefan and Holborn, Penny},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.SCOR.2012.103},
  URN =		{urn:nbn:de:0030-drops-35519},
  doi =		{10.4230/OASIcs.SCOR.2012.103},
  annote =	{Keywords: Isolation Valves Positioning, Bilevel Programming, Hydroinformatics}
}
Document
Runtime Addition of Integrity Constraints in an Abductive Proof Procedure

Authors: Marco Alberti, Marco Gavanelli, and Evelina Lamma

Published in: LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010)


Abstract
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relationships that abductive answers are required to satisfy. Integrity constraints are usually known a priori. However, in some applications (such as interactive abductive logic programming, multi-agent interactions, contracting) it makes sense to relax this assumption, in order to let the abductive reasoning start with incomplete knowledge of integrity constraints, and to continue without restarting when new integrity constraints become known. In this paper, we propose a declarative semantics for abductive logic programming with addition of integrity constraints during the abductive reasoning process, an operational instantiation (with formal termination, soundness and completeness properties) and an implementation of such a framework based on the SCIFF language and proof procedure.

Cite as

Marco Alberti, Marco Gavanelli, and Evelina Lamma. Runtime Addition of Integrity Constraints in an Abductive Proof Procedure. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 4-13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)


Copy BibTex To Clipboard

@InProceedings{alberti_et_al:LIPIcs.ICLP.2010.4,
  author =	{Alberti, Marco and Gavanelli, Marco and Lamma, Evelina},
  title =	{{Runtime Addition of Integrity Constraints in an Abductive Proof Procedure}},
  booktitle =	{Technical Communications of the 26th International Conference on Logic Programming},
  pages =	{4--13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-17-0},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{7},
  editor =	{Hermenegildo, Manuel and Schaub, Torsten},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.4},
  URN =		{urn:nbn:de:0030-drops-25784},
  doi =		{10.4230/LIPIcs.ICLP.2010.4},
  annote =	{Keywords: Abduction, semantics, interactive computation, proof procedure}
}
Document
Expressing and Verifying Business Contracts with Abductive

Authors: Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello, Marco Montali, and Paolo Torroni

Published in: Dagstuhl Seminar Proceedings, Volume 7122, Normative Multi-agent Systems (2007)


Abstract
In this article, we propose to adopt the SCIFF abductive logic language to specify business contracts, and show how its proof procedures are useful to verify contract execution and fulfilment. SCIFF is a declarative language based on abductive logic programming, which accommodates forward rules, predicate definitions, and constraints over finite domain variables. Its declarative semantics is abductive, and can be related to that of deontic operators; its operational specification is the sound and complete SCIFF proof procedure, defined as a set of transition rules, which has been implemented and integrated into a reasoning and verification tool. A variation of the SCIFF proof-procedure (g-SCIFF) can be used for static verification of contract properties. We demonstrate the use of the SCIFF language for business contract specification and verification, in a concrete scenario. In order to accommodate integration of SCIFF with architectures for business contract, we also propose an encoding of SCIFF contract rules in RuleML.

Cite as

Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello, Marco Montali, and Paolo Torroni. Expressing and Verifying Business Contracts with Abductive. In Normative Multi-agent Systems. Dagstuhl Seminar Proceedings, Volume 7122, pp. 1-29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2007)


Copy BibTex To Clipboard

@InProceedings{alberti_et_al:DagSemProc.07122.15,
  author =	{Alberti, Marco and Chesani, Federico and Gavanelli, Marco and Lamma, Evelina and Mello, Paola and Montali, Marco and Torroni, Paolo},
  title =	{{Expressing and Verifying Business Contracts with Abductive}},
  booktitle =	{Normative Multi-agent Systems},
  pages =	{1--29},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7122},
  editor =	{Guido Boella and Leon van der Torre and Harko Verhagen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07122.15},
  URN =		{urn:nbn:de:0030-drops-9017},
  doi =		{10.4230/DagSemProc.07122.15},
  annote =	{Keywords: Contracts, Verification, Abduction}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail