Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
CUD@SAT: SAT solving on GPUs
- A. D. Palù, A. Dovier, A. Formisano, Enrico Pontelli
- Computer ScienceJ. Exp. Theor. Artif. Intell.
- 4 May 2015
This paper investigates the use of GPUs in parallelising a class of search problems, where the combinatorial nature leads to large parallel tasks and relatively less natural symmetries, leading to one order of magnitude of speedup using a simple NVIDIA platform.
Extending and Implementing RASP
This paper presents a refinement of the semantics of RASP so as to take into account the new constructs, and proves that the complexity of establishing the existence of an answer set, in such an enriched framework, remains NP-complete as in ASP.
Layered map reasoning: An experimental approach put to trial on sets
A layered formalization of basic set-theoretic concepts is developed on top of a kernel axiomatization of map algebra and the aim is to assess the potential usefulness of the proposed layered architecture and, to the extent it reveals promising, to best tune it.
Goals and Benchmarks for Automated Map Reasoning
Techniques for translating isolated sentences, as well as entire theories, from first-order logic into map calculus are designed, or in some cases simply brought nearer through the exercise of specifying properties of a few familiar structures.
A GPU Implementation of the ASP Computation
The design and implementation of a conflict-driven ASP solver, that is capable of exploiting the parallelism offered by GPUs, and preliminary experimental results confirm the feasibility and scalability of the approach, and the potential to enhance performance of ASP solvers.
Parallel Execution of the ASP Computation - an Investigation on GPUs
The design and implementation of a conflict-driven ASP solver that is capable of exploiting the Single-Instruction Multiple-Thread parallelism offered by General Purpose Graphical Processing Units (GPUs) and the preliminary experimental results confirm the feasibility and scalability of the approach, and the potential to enhance performance of ASP solvers.
Parallel Answer Set Programming
- A. Dovier, A. Formisano, Enrico Pontelli
- Computer ScienceHandbook of Parallel Constraint Reasoning
This Chapter provides a survey on the main techniques and approaches in the literature to enable exploitation of parallelism in the execution of Answer Set Programming solvers.
On multiple learning schemata in conflict driven solvers
The proposed formulation of the conflict analysis task turns out to be expressive enough to reckon with different orthogonal generalizations of the standard learning schemata, such as the conjunct analysis of multiple conflicts, the generation of possibly interdependent learned clauses, and the imposition of global optimality criteria.
Plan of Activities on the Map Calculus
The connections between rst-order logic and the map calculus are investigated, focusing on techniques for translating single sentences from one context to the other as well as on the translation of entire set theories.
Comparative uncertainty: theory and automation
- A. Capotorti, A. Formisano
- Mathematics, Computer ScienceMathematical Structures in Computer Science
- 1 February 2008
An executable specification is described, in the declarative framework of Answer Set Programming, that constitutes the core engine for qualitative management of uncertainty, and it is proved a representation result that connects qualitative notions of partial uncertainty to their numerical counterparts.