Francesco Scarcello

发表

Fixed-parameter complexity in AI and nonmonotonic reasoning

Georg Gottlob, Francesco Scarcello, Martha Sideri, 1999, Artif. Intell..

Bounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash Equilibria pdf

Francesco Scarcello, Gianluigi Greco, 2005, UAI.

A Deductive System for Non-Monotonic Reasoning

Gerald Pfeifer, Thomas Eiter, Francesco Scarcello, 1997, LPNMR.

Coalitional games induced by matching problems: Complexity and islands of tractability for the Shapley value

Francesco Scarcello, Gianluigi Greco, Francesco Lupia, 2020, Artif. Intell..

Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning

Georg Gottlob, Francesco Scarcello, Martha Sideri, 1999, LPNMR.

Constraint Satisfaction and Fair Multi-Objective Optimization Problems: Foundations, Complexity, and Islands of Tractability

Francesco Scarcello, Gianluigi Greco, G. Greco, 2013, IJCAI.

Propositional lower bounds: Algorithms and complexity

Luigi Palopoli, Francesco Scarcello, Marco Cadoli, 2004, Annals of Mathematics and Artificial Intelligence.

Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width

Georg Gottlob, Francesco Scarcello, Nicola Leone, 2003, J. Comput. Syst. Sci..

Tree Projections and Structural Decomposition Methods: The Power of Local Consistency and Larger Islands of Tractability

Francesco Scarcello, Gianluigi Greco, 2012 .

Hypertree Decompositions: Questions and Answers

Georg Gottlob, Francesco Scarcello, Nicola Leone, 2016, PODS.

Game Theoretic Approaches for Wireless Cooperative Content-Sharing

Antonio Iera, Francesco Scarcello, Antonella Molinaro, 2016 .

Tree Projections: Hypergraph Games and Minimality

Francesco Scarcello, Gianluigi Greco, 2008, ICALP.

Hypertree Decompositions: A Survey

Georg Gottlob, Francesco Scarcello, Nicola Leone, 2001, MFCS.

AI*IA 2019 – Advances in Artificial Intelligence: XVIIIth International Conference of the Italian Association for Artificial Intelligence, Rende, Italy, November 19–22, 2019, Proceedings

Mario Alviano, Francesco Scarcello, Gianluigi Greco, 2019, AI*IA.

On the Complexity of Compact Coalitional Games

Luigi Palopoli, Francesco Scarcello, Gianluigi Greco, 2009, IJCAI.

Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation

Francesco Scarcello, Nicola Leone, Pasquale Rullo, 1997, Inf. Comput..

Abduction with Penalization in Logic Programming

Francesco Scarcello, Simona Perri, Nicola Leone, 2001, AI*IA.

Artificial Intelligence

Francesco Scarcello, 2019, Encyclopedia of Bioinformatics and Computational Biology.

The KR System dlv: Progress Report, Comparisons and Benchmarks

Gerald Pfeifer, Thomas Eiter, Francesco Scarcello, 1998, KR.

The DLV system for knowledge representation and reasoning

Wolfgang Faber, Georg Gottlob, Gerald Pfeifer, 2002, TOCL.

On the power of structural decompositions of graph-based representations of constraint problems

Francesco Scarcello, Gianluigi Greco, 2010, Artif. Intell..

Hypertree Decompositions for Query Optimization

Francesco Scarcello, Gianluigi Greco, Lucantonio Ghionna, 2007, 2007 IEEE 23rd International Conference on Data Engineering.

Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints pdf

Luigi Palopoli, Francesco Scarcello, Gianluigi Greco, 2010, J. Artif. Intell. Res..

DATALOG with Nested Rules

Sergio Greco, Francesco Scarcello, Nicola Leone, 1997, LPKR.

Structural Decomposition Methods: Key Notions and Database Applications

Francesco Scarcello, Giorgio Terracina, Nicola Leone, 2018, A Comprehensive Guide Through the Italian Database Research.

Enhancing DLV instantiator by backjumping techniques

Francesco Scarcello, Nicola Leone, Simona Perri, 2007, Annals of Mathematics and Artificial Intelligence.

Counting solutions to conjunctive queries: structural and hybrid tractability

Francesco Scarcello, Gianluigi Greco, G. Greco, 2014, SEBD.

Constraint satisfaction: algorithms, complexity results, and applications

Francesco Scarcello, Gianluigi Greco, Felice Crupi, 2016 .

Semantical and Computational Aspects of Horn Approximations

Francesco Scarcello, Marco Cadoli, 1993, IJCAI.

The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability

Francesco Scarcello, Gianluigi Greco, 2010, PODS '10.

The Power of Tree Projections: When Local Consistency Answers Conjunctive Queries pdf

Francesco Scarcello, Gianluigi Greco, 2012, ArXiv.

Pure Nash equilibria: hard and easy games

Georg Gottlob, Francesco Scarcello, Gianluigi Greco, 2003, TARK '03.

Computing the Shapley value in allocation problems: approximations and bounds, with an application to the Italian VQR research assessment program

Francesco Scarcello, Francesco Lupia, Marco Schaerf, 2017, RCRA@AI*IA.

The Architecture of a Disjunctive Deductive Database System

Gerald Pfeifer, Thomas Eiter, Francesco Scarcello, 1997, APPIA-GULP-PRODE.

Query answering exploiting structural properties

Francesco Scarcello, Francesco Scarcello, 2005, SGMD.

Computing LOGCFL Certificates

Georg Gottlob, Francesco Scarcello, Nicola Leone, 1999, ICALP.

Constrained coalitional games: formal framework, properties, and complexity results

Luigi Palopoli, Francesco Scarcello, Gianluigi Greco, 2009, AAMAS.

Declarative and Fixpoint Characterizations of Disjunctive Stable Models

Francesco Scarcello, Nicola Leone, N. Leone, 1995, ILPS.

Optimal models of disjunctive logic programs: semantics, complexity, and computation

V. S. Subrahmanian, Francesco Scarcello, Nicola Leone, 2004, IEEE Transactions on Knowledge and Data Engineering.

Structural Tractability of Enumerating CSP Solutions

Francesco Scarcello, Gianluigi Greco, 2010, CP.

The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions

Georg Gottlob, Francesco Scarcello, Gianluigi Greco, 2005, IJCAI.

The dlv System: Model Generator and Application Frontends

Wolfgang Faber, Georg Gottlob, Gerald Pfeifer, 1997 .

The Complexity of Computing Maximin Share Allocations on Graphs

Francesco Scarcello, Gianluigi Greco, G. Greco, 2020, AAAI.

Abductive logic programs with penalization: semantics, complexity and implementation

Francesco Scarcello, Nicola Leone, Simona Perri, 2003, Theory and Practice of Logic Programming.

Hypertree decompositions and tractable queries

Georg Gottlob, Francesco Scarcello, Nicola Leone, 1998, PODS '99.

A fair cooperative content-sharing service

Antonio Iera, Francesco Scarcello, Leonardo Militano, 2013, Comput. Networks.

A New Distributed Application and Network Layer Protocol for VoIP in Mobile Ad Hoc Networks

Francesco Scarcello, Francesco Conte, Floriano De Rango, 2014, IEEE Transactions on Mobile Computing.

Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width

Georg Gottlob, Francesco Scarcello, Nicola Leone, 2001, PODS '01.

On the Expressive Power of Ordered Logic

Francesco Buccafurri, Francesco Scarcello, Nicola Leone, 1996, AI Commun..

Calcolo del Modello Well-Founded di Programmi Datalog

Francesco Scarcello, 1993, GULP.

The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems

Francesco Scarcello, Gianluigi Greco, 2017, SIAM J. Comput..

Towards a Fair VQR with the Aid of Database (and Game) Theory

Francesco Scarcello, Gianluigi Greco, Francesco Lupia, 2016, SEBD.

Infeasibility Certificates and the Complexity of the Core in Coalitional Games

Luigi Palopoli, Francesco Scarcello, Enrico Malizia, 2007, IJCAI.

Hard and Easy k-Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary

Luigi Palopoli, Francesco Scarcello, Gianluigi Greco, 2012, ECAI.

Computing LOGCFL certificates

Georg Gottlob, Francesco Scarcello, Nicola Leone, 1999, Theor. Comput. Sci..

Weighted hypertree decompositions and optimal query plans

Francesco Scarcello, Nicola Leone, Gianluigi Greco, 2004, PODS '04.

On the complexity of regular-grammars with integer attributes

Francesco Scarcello, Nicola Leone, Marco Manna, 2011, J. Comput. Syst. Sci..

Greedy Strategies and Larger Islands of Tractability for Conjunctive Queries

Francesco Scarcello, Gianluigi Greco, Francesco Lupia, 2016, SEBD.

Energy-Saving Analysis in Cellular–WLAN Cooperative Scenarios

Antonio Iera, Francesco Scarcello, Antonella Molinaro, 2014, IEEE Transactions on Vehicular Technology.

Hypertree Decompositions: Structure, Algorithms, and Applications

Georg Gottlob, Nysret Musliu, Marko Samer, 2005, WG.

Census Data Repair: a Challenging Application of Disjunctive Logic Programming

Francesco Scarcello, Nicola Leone, Enrico Franconi, 2001, LPAR.

Advanced Backjumping Techniques for Rule Instantiations

Francesco Scarcello, Simona Perri, 2003, APPIA-GULP-PRODE.

The complexity of acyclic conjunctive queries

Georg Gottlob, Francesco Scarcello, Nicola Leone, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Advanced Parallel Algorithms far Processing Acyclic Conjunctive Queries, Rules, and Constraints,

Georg Gottlob, Francesco Scarcello, Nicola Leone, 2000 .

Weighted hypertree decompositions and optimal query plans

Francesco Scarcello, Nicola Leone, Gianluigi Greco, 2007, J. Comput. Syst. Sci..

The Tractability of the Shapley Value over Bounded Treewidth Matching Games

Francesco Scarcello, Gianluigi Greco, Francesco Lupia, 2017, IJCAI.

Tree Projections: Game Characterization and Computational Aspects

Thomas Schwentick, Georg Gottlob, Francesco Scarcello, 2009, Graph Theory, Computational Intelligence and Thought.

On the complexity of computing peer agreements for consistent query answering in peer-to-peer data integration systems

Francesco Scarcello, Gianluigi Greco, 2005, CIKM '05.

On the Complexity of Some Inductive Logic Programming Problems

Georg Gottlob, Francesco Scarcello, Nicola Leone, 1997, ILP.

Join Ordering Techniques for Knowledge Base Systems

Francesco Scarcello, Nicola Leone, Simona Perri, 2001, SEBD.

Stable Model Checking for Disjunctive Logic Programs

Francesco Scarcello, Nicola Leone, Pasquale Rullo, 1996, Logic in Databases.

Uniform Constraint Satisfaction Problems and Database Theory

Georg Gottlob, Francesco Scarcello, Gianluigi Greco, 2008, Complexity of Constraints.

BackJumping techniques for rules instantiation in the DLV system

Francesco Scarcello, Nicola Leone, Simona Perri, 2004, NMR.

Tree projections and structural decomposition methods: Minimality and game-theoretic characterization

Francesco Scarcello, Gianluigi Greco, 2014, Theor. Comput. Sci..

On the Computation of Disjunctive Stable Models

Francesco Scarcello, Nicola Leone, Pasquale Rullo, 1996, DEXA.

Structural tractability of enumerating CSP solutions

Francesco Scarcello, Gianluigi Greco, G. Greco, 2010, Constraints.

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

Georg Gottlob, Francesco Scarcello, Gianluigi Greco, 2018, J. Comput. Syst. Sci..

Event choice datalog: a logic programming language for reasoning in multiple dimensions

Francesco Scarcello, Domenico Saccà, Gianluigi Greco, 2004, PPDP '04.

On the Computational Complexity of the Bargaining Set and the Kernel in Compact Coalitional Games pdf

Luigi Palopoli, Francesco Scarcello, Enrico Malizia, 2008, ArXiv.

H-DB: a hybrid quantitative-structural sql optimizer

Francesco Scarcello, Gianluigi Greco, Lucantonio Ghionna, 2011, CIKM '11.

Tractable Optimization Problems through Hypergraph-Based Structural Restrictions

Georg Gottlob, Francesco Scarcello, Gianluigi Greco, 2009, ICALP.

Structural Tractability of ORDER BY Queries

Francesco Scarcello, Gianluigi Greco, 2013, SEBD.

On the Shapley value and its application to the Italian VQR research assessment exercise

Francesco Scarcello, Camil Demetrescu, Francesco Lupia, 2019, J. Informetrics.

Fair Cost Allocation in Cellular-Bluetooth Cooperation Scenarios

Antonio Iera, Francesco Scarcello, Leonardo Militano, 2011, IEEE Transactions on Wireless Communications.

On the complexity of core, kernel, and bargaining set

Luigi Palopoli, Francesco Scarcello, Gianluigi Greco, 2008, Artif. Intell..

Curbing Theories: Fixpoint Semantics and Complexity Issues

Luigi Palopoli, Francesco Scarcello, Nicola Leone, 1995, GULP-PRODE.

A Comparison of Structural CSP Decomposition Methods

Georg Gottlob, Francesco Scarcello, Nicola Leone, 1999, IJCAI.

On Weighted Hypertree Decompositions

Francesco Scarcello, Nicola Leone, Gianluigi Greco, 2004, SEBD.

Progress Report on the Disjunctive Deductive Database System dlv

Gerald Pfeifer, Thomas Eiter, Francesco Scarcello, 1998, FQAS.

Structural Tractability of Shapley and Banzhaf Values in Allocation Games

Francesco Scarcello, Gianluigi Greco, Francesco Lupia, 2015, IJCAI.

On the Complexity of the Core over Coalition Structures

Luigi Palopoli, Francesco Scarcello, Gianluigi Greco, 2011, IJCAI.

Non-Binary Constraints and Optimal Dual-Graph Representations

Francesco Scarcello, Gianluigi Greco, 2003, IJCAI.

Propositional Lower Bounds: Generalization and Algorithms

Luigi Palopoli, Francesco Scarcello, Marco Cadoli, 1998, JELIA.

Mechanisms for Fair Allocation Problems: No-Punishment Payment Rules in Fully Verifiable Settings pdf

Francesco Scarcello, Gianluigi Greco, G. Greco, 2012, ArXiv.

Treewidth and Hypertree Width

Georg Gottlob, Francesco Scarcello, Gianluigi Greco, 2014, Tractability.

On the Power of Enforcing Local Consistency

Francesco Scarcello, Gianluigi Greco, 2011, SEBD.

On the complexity of constrained Nash equilibria in graphical games

Francesco Scarcello, Gianluigi Greco, G. Greco, 2009, Theor. Comput. Sci..

On the complexity of some inductive logic programming problems

Georg Gottlob, Francesco Scarcello, Nicola Leone, 1997, New Generation Computing.

Mechanisms for Fair Allocation Problems: No-Punishment Payment Rules in Verifiable Settings

Francesco Scarcello, Gianluigi Greco, G. Greco, 2014, J. Artif. Intell. Res..

Cost-based Query Decompositions

Francesco Scarcello, Nicola Leone, Alfredo Mazzitelli, 2002, Sistemi Evoluti per Basi di Dati.

The Complexity of the Nucleolus in Compact Games

Luigi Palopoli, Francesco Scarcello, Gianluigi Greco, 2015, TOCT.

Structural Tractability of Constraint Optimization

Francesco Scarcello, Gianluigi Greco, 2011, CP.

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

Francesco Scarcello, Gianluigi Greco, G. Greco, 2013, Intelligenza Artificiale.

On The Power of Tree Projections: Structural Tractability of Enumerating CSP Solutions pdf

Francesco Scarcello, Gianluigi Greco, 2010, ArXiv.

The dlv System: Model Generator and Advanced Frontends (system description)

Wolfgang Faber, Georg Gottlob, Gerald Pfeifer, 1997, WLP.

Improving ASP Instantiators by Join-Ordering Methods

Francesco Scarcello, Nicola Leone, Simona Perri, 2001, LPNMR.

On Tractable Queries and Constraints

Georg Gottlob, Francesco Scarcello, Nicola Leone, 1999, DEXA.

The complexity of acyclic conjunctive queries

Georg Gottlob, Francesco Scarcello, Nicola Leone, 2001, JACM.

Constrained Pure Nash Equilibria in Graphical Games

Francesco Scarcello, Gianluigi Greco, 2004, ECAI.

From Hypertree Width to Submodular Width and Data-dependent Structural Decompositions

Francesco Scarcello, 2018, SEBD.

Panel on "Past and Future of Computer Science Theory" (Discussion Paper)

Georg Gottlob, Maurizio Lenzerini, Luigi Palopoli, 2021, SEBD.

Hypertree Decompositions and Tractable Queries 1

Georg Gottlob, Francesco Scarcello, G. Gottlob, 2002 .

Multivalued Functions : Turing Characterizations and Complexity Results

Francesco Scarcello, Domenico Saccà, 2003 .