Search Results

Documents authored by Pontelli, Enrico

Document
DOI: 10.4230/LIPIcs.CP.2024.28
CP for Bin Packing with Multi-Core and GPUs

Authors: Fabio Tardivo, Laurent Michel, and Enrico Pontelli

Published in: LIPIcs, Volume 307, 30th International Conference on Principles and Practice of Constraint Programming (CP 2024)

Abstract
The BinPacking constraint models the requirements of many logistics, resource allocation, and production scheduling applications. This paper explores new avenues based on the impressive computational power of modern GPUs to propagate the BinPacking constraint. This work showcases how the perspective of massive parallelization can lead to novel approaches, such as the use of a portfolio of lower bounds, to enhance the pruning of the BinPacking constraints. It delivers insights into the design choices and challenges presented by GPU platform for constraint propagation. The paper evaluates a GPU-accelerated propagator against both sequential and parallel CPU versions, as well as state-of-the-art approaches. Comparisons across various benchmarks from the literature show strong performances with respect to both CPU versions and the standard pruning approach. When compared to techniques based on Linear Programming, our approach proves valuable for large instances or when spending extensive time to obtain the best possible bound is not convenient.
Cite as

Fabio Tardivo, Laurent Michel, and Enrico Pontelli. CP for Bin Packing with Multi-Core and GPUs. In 30th International Conference on Principles and Practice of Constraint Programming (CP 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 307, pp. 28:1-28:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)

Copy BibTex To Clipboard

@InProceedings{tardivo_et_al:LIPIcs.CP.2024.28,
  author =	{Tardivo, Fabio and Michel, Laurent and Pontelli, Enrico},
  title =	{{CP for Bin Packing with Multi-Core and GPUs}},
  booktitle =	{30th International Conference on Principles and Practice of Constraint Programming (CP 2024)},
  pages =	{28:1--28:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-336-2},
  ISSN =	{1868-8969},
  year =	{2024},
  volume =	{307},
  editor =	{Shaw, Paul},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CP.2024.28},
  URN =		{urn:nbn:de:0030-drops-207138},
  doi =		{10.4230/LIPIcs.CP.2024.28},
  annote =	{Keywords: Constraint Propagation, Bin Packing, Parallelism, GPU, Lower Bounds}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.8
MASP-Reduce: A Proposal for Distributed Computation of Stable Models

Authors: Federico Igne, Agostino Dovier, and Enrico Pontelli

Published in: OASIcs, Volume 64, Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)

Abstract
There has been an increasing interest in recent years towards the development of efficient solvers for Answer Set Programming (ASP) and towards the application of ASP to solve increasing more challenging problems. In particular, several recent efforts have explored the issue of scalability of ASP solvers when addressing the challenges caused by the need to ground the program before resolution. This paper offers an alternative solution to this challenge, focused on the use of distributed programming techniques to reason about ASP programs whose grounding would be prohibitive for mainstream ASP solvers. The work builds on a proposal of a characterization of answer set solving as a form of non-standard graph coloring. The paper expands this characterization to include syntactic extensions used in modern ASP (e.g., choice rules, weight constraints). We present an implementation of the solver using a distributed programming framework specifically designed to manipulate very large graphs, as provided by Apache Spark, which in turn builds on the MapReduce programming framework. Finally, we provide a few preliminary results obtained from the first prototype implementation of this approach.
Cite as

Federico Igne, Agostino Dovier, and Enrico Pontelli. MASP-Reduce: A Proposal for Distributed Computation of Stable Models. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 8:1-8:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{igne_et_al:OASIcs.ICLP.2018.8,
  author =	{Igne, Federico and Dovier, Agostino and Pontelli, Enrico},
  title =	{{MASP-Reduce: A Proposal for Distributed Computation of Stable Models}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{8:1--8:4},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-090-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{64},
  editor =	{Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.8},
  URN =		{urn:nbn:de:0030-drops-98749},
  doi =		{10.4230/OASIcs.ICLP.2018.8},
  annote =	{Keywords: ASP solving, Parallelism, Map-reduce}
}
Document
DOI: 10.4230/OASIcs.ICLP.2018.14
Explanations Generation For Web Service Workflow

Authors: Van Duc Nguyen, Son Cao Tran, and Enrico Pontelli

Published in: OASIcs, Volume 64, Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)

Abstract
The motivation for the work is the challenge of providing textual explanations of automatically generated scientific workflows (e.g., paragraphs that scientists can include in their publications). The extended abstract presents a system which generates explanations for a web service workflow from sets of atoms derived from a collection of ontologies. The system, called nlgPhylogeny, demonstrates the feasibility of the task in the Phylotastic project, that aims at providing evolutionary biologists with a platform for automatic generation of phylogenetic trees given some suitable inputs.
Cite as

Van Duc Nguyen, Son Cao Tran, and Enrico Pontelli. Explanations Generation For Web Service Workflow. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 14:1-14:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{nguyen_et_al:OASIcs.ICLP.2018.14,
  author =	{Nguyen, Van Duc and Tran, Son Cao and Pontelli, Enrico},
  title =	{{Explanations Generation For Web Service Workflow}},
  booktitle =	{Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
  pages =	{14:1--14:3},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-090-3},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{64},
  editor =	{Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.14},
  URN =		{urn:nbn:de:0030-drops-98801},
  doi =		{10.4230/OASIcs.ICLP.2018.14},
  annote =	{Keywords: Phylotastic, Grammatical Framework}
}
Document
DOI: 10.4230/OASIcs.ICLP.2016.8
An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents

Authors: Tran Cao Son, Enrico Pontelli, Michael Gelfond, and Marcello Balduccini

Published in: OASIcs, Volume 52, Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)

Abstract
We propose a framework for answering the question of whether statements made by an agent can be believed, in light of observations made over time. The basic components of the framework are a formalism for reasoning about actions, changes, and observations and a formalism for default reasoning. The framework is suitable for concrete implementation, e.g., using answer set programming for asserting the truthfulness of statements made by agents, starting from observations, knowledge about the actions of the agents, and a theory about the "normal" behavior of agents.
Cite as

Tran Cao Son, Enrico Pontelli, Michael Gelfond, and Marcello Balduccini. An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 8:1-8:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{caoson_et_al:OASIcs.ICLP.2016.8,
  author =	{Cao Son, Tran and Pontelli, Enrico and Gelfond, Michael and Balduccini, Marcello},
  title =	{{An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{8:1--8:4},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.8},
  URN =		{urn:nbn:de:0030-drops-67383},
  doi =		{10.4230/OASIcs.ICLP.2016.8},
  annote =	{Keywords: Agents, ASP, Reasoning, Knowledge}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2012.359
ASP at Work: An ASP Implementation of PhyloWS

Authors: Tiep Le, Hieu Nguyen, Enrico Pontelli, and Tran Cao Son

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

Abstract
This paper continues the exploration started in [Bininda-Emonds,2004], aimed at demonstrating the use of logic programming technology to support a large scale deployment and analysis of phylogenetic data from biological studies. This application paper illustrates the use of ASP technology in implementing the PhyloWS web service API — a recently proposed and community-agreed standard API to enable uniform access and inter-operation among phylogenetic applications and repositories. To date, only very incomplete implementations of PhyloWS have been realized; this paper demonstrates how ASP provides an ideal technology to support a more comprehensive realization of PhyloWS on a repository of semantically-described phylogenetic studies. The paper also presents a challenge for the developers of ASP-solvers.
Cite as

Tiep Le, Hieu Nguyen, Enrico Pontelli, and Tran Cao Son. ASP at Work: An ASP Implementation of PhyloWS. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 359-369, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@InProceedings{le_et_al:LIPIcs.ICLP.2012.359,
  author =	{Le, Tiep and Nguyen, Hieu and Pontelli, Enrico and Cao Son, Tran},
  title =	{{ASP at Work: An ASP Implementation of PhyloWS}},
  booktitle =	{Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)},
  pages =	{359--369},
  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.359},
  URN =		{urn:nbn:de:0030-drops-36369},
  doi =		{10.4230/LIPIcs.ICLP.2012.359},
  annote =	{Keywords: Answer sets, phylogenetic inference, systems, applications}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.187
BAAC: A Prolog System for Action Description and Agents Coordination

Authors: Agostino Dovier, Andrea Formisano, and Enrico Pontelli

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

Abstract
The paper presents a system for knowledge representation and coordination, where autonomous agents reason and act in a shared environment. Agents autonomously pursue individual goals, but can interact through a shared knowledge repository. In their interactions, agents deal with problems of synchronization and concurrency, and have to realize coordination by developing proper strategies in order to ensure a consistent global execution of their autonomously derived plans. This kind of knowledge is modeled using an extension of the action description language B. A distributed planning problem is formalized by providing a number of declarative specifications of the portion of the problem pertaining a single agent. Each of these specifications is executable by a stand-alone CLP-based planner. The coordination platform, implemented in Prolog, is easily modifiable and extensible. New user-defined interaction protocols can be integrated.
Cite as

Agostino Dovier, Andrea Formisano, and Enrico Pontelli. BAAC: A Prolog System for Action Description and Agents Coordination. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 187-197, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{dovier_et_al:LIPIcs.ICLP.2011.187,
  author =	{Dovier, Agostino and Formisano, Andrea and Pontelli, Enrico},
  title =	{{BAAC: A Prolog System for Action Description and Agents Coordination}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{187--197},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.187},
  URN =		{urn:nbn:de:0030-drops-31600},
  doi =		{10.4230/LIPIcs.ICLP.2011.187},
  annote =	{Keywords: Knowledge Representation, Multi-Agent Systems, Planning, CLP}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.209
CDAOStore: A Phylogenetic Repository Using Logic Programming and Web Services

Authors: Brandon Chisham, Enrico Pontelli, Tran Cao Son, and Ben Wright

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

Abstract
The CDAOStore is a portal aimed at facilitating the storage and retrieval of data and metadata associated to studies in the field of evolutionary biology and phylogenetic analysis. The novelty of CDAOStore lies in the use of a semantic-based approach to the storage and querying of data. This enables CDAOStore to overcome the data format restrictions and complexities of other repositories (e.g., TreeBase) and to provide a domain-specific query interface, derived from studies of querying requirements for phylogenetic databases. CDAOStore represents the first full implementation of the EvoIO stack, an inter-operation stack composed of a formal ontology (the Comparative Data Analysis Ontology), an XML exchange format (NeXML), and a web services API (PhyloWS). CDAOStore has been implemented on top of an RDF triple store, using a combination of standard web technologies and logic programming technology. In particular, we employed Prolog to support some of the format transformation tasks and, more importantly, in the implementation of several of the domain-specific queries, whose structure is beyond the reach of standard RDF query languages (e.g., SPARQL). CDAOStore is operational and it already hosts over 90 million RDF triples, imported from TreeBase or submitted by other domain scientists.
Cite as

Brandon Chisham, Enrico Pontelli, Tran Cao Son, and Ben Wright. CDAOStore: A Phylogenetic Repository Using Logic Programming and Web Services. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 209-219, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{chisham_et_al:LIPIcs.ICLP.2011.209,
  author =	{Chisham, Brandon and Pontelli, Enrico and Son, Tran  Cao and Wright, Ben},
  title =	{{CDAOStore: A Phylogenetic Repository Using Logic Programming and Web Services}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{209--219},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.209},
  URN =		{urn:nbn:de:0030-drops-31635},
  doi =		{10.4230/LIPIcs.ICLP.2011.209},
  annote =	{Keywords: Bioinformatics, Phylogenetic Analysis, Prolog, Ontologies}
}
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
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact