Search Results for author: Francesco Scarcello

Found 5 papers, 1 papers with code

Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability

no code implementations24 Nov 2023 Hubie Chen, Gianluigi Greco, Stefan Mengel, Francesco Scarcello

Counting the number of answers to conjunctive queries is a fundamental problem in databases that, under standard assumptions, does not have an efficient solution.

Tree Projections and Constraint Optimization Problems: Fixed-Parameter Tractability and Parallel Algorithms

no code implementations14 Nov 2017 Georg Gottlob, Gianlugi Greco, Francesco Scarcello

Solution methods have therefore been proposed in the literature that do not require a tree projection to be given, and that either correctly decide whether the given CSP instance is satisfiable, or return that a tree projection actually does not exist.

Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program

no code implementations13 Sep 2017 Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf

In allocation problems, a given set of goods are assigned to agents in such a way that the social welfare is maximised, that is, the largest possible global worth is achieved.

The DLV System for Knowledge Representation and Reasoning

no code implementations4 Nov 2002 Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello

As for problem solving, we provide a formal definition of its kernel language, function-free disjunctive logic programs (also known as disjunctive datalog), extended by weak constraints, which are a powerful tool to express optimization problems.

Benchmarking

Cannot find the paper you are looking for? You can Submit a new open access paper.