Francesco Scarcello

According to our database1, Francesco Scarcello authored at least 99 papers between 1993 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Coalitional games induced by matching problems: Complexity and islands of tractability for the Shapley value.
Artif. Intell., 2020

The Complexity of Computing Maximin Share Allocations on Graphs.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Artificial Intelligence.
Proceedings of the Encyclopedia of Bioinformatics and Computational Biology - Volume 1, 2019

On the Shapley value and its application to the Italian VQR research assessment exercise.
J. Informetrics, 2019

2018
Computing the Shapley value in allocation problems: approximations and bounds, with an application to the Italian VQR research assessment program.
J. Exp. Theor. Artif. Intell., 2018

Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms.
J. Comput. Syst. Sci., 2018

From Hypertree Width to Submodular Width and Data-dependent Structural Decompositions.
Proceedings of the 26th Italian Symposium on Advanced Database Systems, 2018

Structural Decomposition Methods: Key Notions and Database Applications.
Proceedings of the A Comprehensive Guide Through the Italian Database Research Over the Last 25 Years., 2018

2017
The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems.
SIAM J. Comput., 2017

Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems.
Inf. Comput., 2017

The Tractability of the Shapley Value over Bounded Treewidth Matching Games.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Greedy Strategies and Larger Islands of Tractability for Conjunctive Queries.
Proceedings of the 24th Italian Symposium on Advanced Database Systems, 2016

Towards a Fair VQR with the Aid of Database (and Game) Theory.
Proceedings of the 24th Italian Symposium on Advanced Database Systems, 2016

Hypertree Decompositions: Questions and Answers.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015
Structural Tractability of Shapley and Banzhaf Values in Allocation Games.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Energy-Saving Analysis in Cellular-WLAN Cooperative Scenarios.
IEEE Trans. Veh. Technol., 2014

The Complexity of the Nucleolus in Compact Games.
ACM Trans. Comput. Theory, 2014

A New Distributed Application and Network Layer Protocol for VoIP in Mobile Ad Hoc Networks.
IEEE Trans. Mob. Comput., 2014

Tree projections and structural decomposition methods: Minimality and game-theoretic characterization.
Theor. Comput. Sci., 2014

Mechanisms for Fair Allocation Problems: No-Punishment Payment Rules in Verifiable Settings.
J. Artif. Intell. Res., 2014

Counting solutions to conjunctive queries: structural and hybrid tractability.
Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2014

Treewidth and Hypertree Width.
Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013
Fair division rules for funds distribution: The case of the Italian Research Assessment Program (VQR 2004-2010).
Intelligenza Artificiale, 2013

Structural tractability of enumerating CSP solutions.
Constraints An Int. J., 2013

A fair cooperative content-sharing service.
Comput. Networks, 2013

Structural Tractability of ORDER BY Queries.
Proceedings of the 21st Italian Symposium on Advanced Database Systems, 2013

Constraint Satisfaction and Fair Multi-Objective Optimization Problems: Foundations, Complexity, and Islands of Tractability.
Proceedings of the IJCAI 2013, 2013

2012
Mechanisms for Fair Allocation Problems: No-Punishment Payment Rules in Fully Verifiable Settings
CoRR, 2012

The Power of Tree Projections: When Local Consistency Answers Conjunctive Queries
CoRR, 2012

Hard and Easy k-Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary.
Proceedings of the ECAI 2012, 2012

2011
Fair Cost Allocation in Cellular-Bluetooth Cooperation Scenarios.
IEEE Trans. Wirel. Commun., 2011

On the complexity of regular-grammars with integer attributes.
J. Comput. Syst. Sci., 2011

On the complexity of core, kernel, and bargaining set.
Artif. Intell., 2011

On the Power of Enforcing Local Consistency.
Proceedings of the Sistemi Evoluti per Basi di Dati, 2011

On the Complexity of the Core over Coalition Structures.
Proceedings of the IJCAI 2011, 2011

Structural Tractability of Constraint Optimization.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

H-DB: a hybrid quantitative-structural sql optimizer.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

2010
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints.
J. Artif. Intell. Res., 2010

On The Power of Tree Projections: Structural Tractability of Enumerating CSP Solutions
CoRR, 2010

On the power of structural decompositions of graph-based representations of constraint problems.
Artif. Intell., 2010

The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

2009
On the complexity of constrained Nash equilibria in graphical games.
Theor. Comput. Sci., 2009

On the Complexity of Compact Coalitional Games.
Proceedings of the IJCAI 2009, 2009

Tractable Optimization Problems through Hypergraph-Based Structural Restrictions.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

Tree Projections: Game Characterization and Computational Aspects.
Proceedings of the Graph Theory, 2009

Constrained coalitional games: formal framework, properties, and complexity results.
Proceedings of the 8th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

2008
On the Computational Complexity of the Bargaining Set and the Kernel in Compact Coalitional Games
CoRR, 2008

Tree Projections: Hypergraph Games and Minimality.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Uniform Constraint Satisfaction Problems and Database Theory.
Proceedings of the Complexity of Constraints, 2008

2007
Weighted hypertree decompositions and optimal query plans.
J. Comput. Syst. Sci., 2007

Enhancing DLV instantiator by backjumping techniques.
Ann. Math. Artif. Intell., 2007

Infeasibility Certificates and the Complexity of the Core in Coalitional Games.
Proceedings of the IJCAI 2007, 2007

Hypertree Decompositions for Query Optimization.
Proceedings of the 23rd International Conference on Data Engineering, 2007

2006
The DLV system for knowledge representation and reasoning.
ACM Trans. Comput. Log., 2006

2005
Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation.
Theory Pract. Log. Program., 2005

Query answering exploiting structural properties.
SIGMOD Rec., 2005

Pure Nash Equilibria: Hard and Easy Games.
J. Artif. Intell. Res., 2005

Hypertree Decompositions: Structure, Algorithms, and Applications.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2005

Bounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash Equilibria.
Proceedings of the UAI '05, 2005

The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

On the complexity of computing peer agreements for consistent query answering in peer-to-peer data integration systems.
Proceedings of the 2005 ACM CIKM International Conference on Information and Knowledge Management, Bremen, Germany, October 31, 2005

2004
Optimal Models of Disjunctive Logic Programs: Semantics, Complexity, and Computation.
IEEE Trans. Knowl. Data Eng., 2004

On Weighted Hypertree Decompositions.
Proceedings of the Twelfth Italian Symposium on Advanced Database Systems, 2004

Event choice datalog: a logic programming language for reasoning in multiple dimensions.
Proceedings of the 6th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2004

BackJumping techniques for rules instantiation in the DLV system.
Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

Constrained Pure Nash Equilibria in Graphical Games.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

2003
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width.
J. Comput. Syst. Sci., 2003

Non-Binary Constraints and Optimal Dual-Graph Representations.
Proceedings of the IJCAI-03, 2003

Advanced Backjumping Techniques for Rule Instantiations.
Proceedings of the 2003 Joint Conference on Declarative Programming, 2003

2002
Computing LOGCFL certificates.
Theor. Comput. Sci., 2002

Hypertree Decompositions and Tractable Queries.
J. Comput. Syst. Sci., 2002

Fixed-parameter complexity in AI and nonmonotonic reasoning.
Artif. Intell., 2002

Cost-based Query Decompositions.
Proceedings of the Decimo Convegno Nazionale su Sistemi Evoluti per Basi di Dati, 2002

2001
The complexity of acyclic conjunctive queries.
J. ACM, 2001

Abduction with Penalization in Logic Programming
CoRR, 2001

Join Ordering Techniques for Knowledge Base Systems.
Proceedings of the Nono Convegno Nazionale Sistemi Evoluti per Basi di Dati, 2001

Hypertree Decompositions: A Survey.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Improving ASP Instantiators by Join-Ordering Methods.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2001

Census Data Repair: a Challenging Application of Disjunctive Logic Programming.
Proceedings of the Logic for Programming, 2001

Abduction with Penalization in Logic Programming.
Proceedings of the AI*IA 2001: Advances in Artificial Intelligence, 2001

2000
A comparison of structural CSP decomposition methods.
Artif. Intell., 2000

Semantical and computational aspects of Horn approximations.
Artif. Intell., 2000

1999
On the Complexity of Some Inductive Logic Programming Problems.
New Gener. Comput., 1999

Propositional lower bounds: Algorithms and complexity.
Ann. Math. Artif. Intell., 1999

On Tractable Queries and Constraints.
Proceedings of the Database and Expert Systems Applications, 10th International Conference, 1999

1998
The KR System dlv: Progress Report, Comparisons and Benchmarks.
Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998

Propositional Lower Bounds: Generalization and Algorithms.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1998

Progress Report on the Disjunctive Deductive Database System <tt>dlv</tt>.
Proceedings of the Flexible Query Answering Systems, Third International Conference, 1998

1997
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation.
Inf. Comput., 1997

The dlv System: Model Generator and Advanced Frontends (system description).
Proceedings of the Twelfth Workshop Logic Programming, 1997

A Deductive System for Non-Monotonic Reasoning.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

DATALOG with Nested Rules.
Proceedings of the Logic Programming and Knowledge Representation, 1997

The Architecture of a Disjunctive Deductive Database System.
Proceedings of the 1997 Joint Conf. on Declarative Programming, 1997

1996
On the Expressive Power of Ordered Logic.
AI Commun., 1996

Stable Model Checking for Disjunctive Logic Programs.
Proceedings of the Logic in Databases, 1996

On the Computation of Disjunctive Stable Models.
Proceedings of the Database and Expert Systems Applications, 7th International Conference, 1996

1995
Declarative and Fixpoint Characterizations of Disjunctive Stable Models.
Proceedings of the Logic Programming, 1995

Curbing Theories: Fixpoint Semantics and Complexity Issues.
Proceedings of the 1995 Joint Conference on Declarative Programming, 1995

1993
Calcolo del Modello Well-Founded di Programmi Datalog.
Proceedings of the 8th Italian Conference on Logic Programming, 1993


  Loading...