default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesco Scarcello
Person information
- affiliation: University of Calabria, Cosenza, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j42]Danilo Avola
, Luigi Cinque, Angelo Di Mambro, Romeo Lanzino, Daniele Pannone, Francesco Scarcello:
Multi-Stream 1D CNN for EEG Motor Imagery Classification of Limbs Activation. IEEE Access 12: 83940-83951 (2024)- [j41]Federico Fontana, Romeo Lanzino, Marco Raoul Marini, Danilo Avola, Luigi Cinque, Francesco Scarcello, Gian Luca Foresti:
Distilled Gradual Pruning With Pruned Fine-Tuning. IEEE Trans. Artif. Intell. 5(8): 4269-4279 (2024) - [c70]Gianluigi Greco, Francesco Scarcello:
Maxileximin Envy Allocations and Connected Goods. AAAI 2024: 9713-9721 - [i18]Romeo Lanzino, Federico Fontana, Luigi Cinque, Francesco Scarcello, Atsuto Maki:
NT-ViT: Neural Transcoding Vision Transformers for EEG-to-fMRI Synthesis. CoRR abs/2409.11836 (2024) - 2023
- [j40]Danilo Avola, Luigi Cinque, Gian Luca Foresti, Romeo Lanzino, Marco Raoul Marini, Alessio Mecca, Francesco Scarcello:
A Novel Transformer-Based IMU Self-Calibration Approach through On-Board RGB Camera for UAV Flight Stabilization. Sensors 23(5): 2655 (2023) - [c69]Danilo Avola, Luigi Cinque, Maria De Marsico, Angelo Di Mambro, Alessio Fagioli, Gian Luca Foresti, Romeo Lanzino, Francesco Scarcello:
LieToMe: An LSTM-Based Method for Deception Detection by Hand Movements. ICIAP (1) 2023: 387-398 - [i17]Hubie Chen, Gianluigi Greco, Stefan Mengel, Francesco Scarcello:
Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability. CoRR abs/2311.14579 (2023) - 2021
- [c68]Ronald Fagin, Georg Gottlob, Christos H. Papadimitriou, Moshe Y. Vardi, Giorgio Ausiello, Maurizio Lenzerini, Domenico Saccà, Luigi Palopoli, Francesco Scarcello:
Panel on "Past and Future of Computer Science Theory" (Discussion Paper). SEBD 2021: 531-542 - 2020
- [j39]Gianluigi Greco, Francesco Lupia, Francesco Scarcello:
Coalitional games induced by matching problems: Complexity and islands of tractability for the Shapley value. Artif. Intell. 278 (2020) - [j38]Mario Alviano, Gianluigi Greco, Francesco Scarcello:
Special issue: Selected and revised papers from the 18th International Conference of the Italian Association for Artificial Intelligence. Intelligenza Artificiale 14(2): 179-181 (2020) - [c67]Gianluigi Greco, Francesco Scarcello:
The Complexity of Computing Maximin Share Allocations on Graphs. AAAI 2020: 2006-2013
2010 – 2019
- 2019
- [j37]Camil Demetrescu, Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
On the Shapley value and its application to the Italian VQR research assessment exercise. J. Informetrics 13(1): 87-104 (2019) - [e2]Mario Alviano, Gianluigi Greco, Marco Maratea, Francesco Scarcello:
Discussion and Doctoral Consortium papers of AI*IA 2019 - 18th International Conference of the Italian Association for Artificial Intelligence, Rende, Italy, November 19-22, 2019. CEUR Workshop Proceedings 2495, CEUR-WS.org 2019 [contents] - [e1]Mario Alviano, Gianluigi Greco, Francesco Scarcello:
AI*IA 2019 - Advances in Artificial Intelligence - XVIIIth International Conference of the Italian Association for Artificial Intelligence, Rende, Italy, November 19-22, 2019, Proceedings. Lecture Notes in Computer Science 11946, Springer 2019, ISBN 978-3-030-35165-6 [contents] - [r1]Francesco Scarcello:
Artificial Intelligence. Encyclopedia of Bioinformatics and Computational Biology (1) 2019: 287-293 - 2018
- [j36]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms. J. Comput. Syst. Sci. 94: 11-40 (2018) - [j35]Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
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. 30(4): 505-524 (2018) - [c66]Francesco Scarcello:
From Hypertree Width to Submodular Width and Data-dependent Structural Decompositions. SEBD 2018 - [p2]Gianluigi Greco, Nicola Leone, Francesco Scarcello, Giorgio Terracina:
Structural Decomposition Methods: Key Notions and Database Applications. A Comprehensive Guide Through the Italian Database Research 2018: 253-267 - 2017
- [j34]Gianluigi Greco, Francesco Scarcello:
Greedy strategies and larger islands of tractability for conjunctive queries and constraint satisfaction problems. Inf. Comput. 252: 201-220 (2017) - [j33]Gianluigi Greco, Francesco Scarcello:
The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems. SIAM J. Comput. 46(3): 1111-1145 (2017) - [c65]Gianluigi Greco, Francesco Lupia, Francesco Scarcello:
The Tractability of the Shapley Value over Bounded Treewidth Matching Games. IJCAI 2017: 1046-1052 - [i16]Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program. CoRR abs/1709.04176 (2017) - [i15]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
Tree Projections and Constraint Optimization Problems: Fixed-Parameter Tractability and Parallel Algorithms. CoRR abs/1711.05216 (2017) - 2016
- [c64]Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf:
Computing the Shapley Value in Allocation Problems: Approximations and Bounds, with an Application to the Italian VQR Research Assessment Program. RCRA@AI*IA 2016: 27-43 - [c63]Georg Gottlob, Gianluigi Greco, Nicola Leone, Francesco Scarcello:
Hypertree Decompositions: Questions and Answers. PODS 2016: 57-74 - [c62]Gianluigi Greco, Francesco Lupia, Francesco Scarcello:
Towards a Fair VQR with the Aid of Database (and Game) Theory. SEBD 2016: 254-261 - [c61]Gianluigi Greco, Francesco Lupia, Francesco Scarcello:
Greedy Strategies and Larger Islands of Tractability for Conjunctive Queries. SEBD 2016: 262-269 - [i14]Gianluigi Greco, Francesco Scarcello:
Greedy Strategies and Larger Islands of Tractability for Conjunctive Queries and Constraint Satisfaction Problems. CoRR abs/1603.09617 (2016) - 2015
- [c60]Gianluigi Greco, Francesco Lupia, Francesco Scarcello:
Structural Tractability of Shapley and Banzhaf Values in Allocation Games. IJCAI 2015: 547-553 - 2014
- [j32]Gianluigi Greco, Francesco Scarcello:
Mechanisms for Fair Allocation Problems: No-Punishment Payment Rules in Verifiable Settings. J. Artif. Intell. Res. 49: 403-449 (2014) - [j31]Gianluigi Greco, Francesco Scarcello:
Tree projections and structural decomposition methods: Minimality and game-theoretic characterization. Theor. Comput. Sci. 522: 95-114 (2014) - [j30]Floriano De Rango, Peppino Fazio, Francesco Scarcello, Francesco Conte:
A New Distributed Application and Network Layer Protocol for VoIP in Mobile Ad Hoc Networks. IEEE Trans. Mob. Comput. 13(10): 2185-2198 (2014) - [j29]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
The Complexity of the Nucleolus in Compact Games. ACM Trans. Comput. Theory 7(1): 3:1-3:52 (2014) - [j28]Leonardo Militano, Antonio Iera, Antonella Molinaro, Francesco Scarcello:
Energy-Saving Analysis in Cellular-WLAN Cooperative Scenarios. IEEE Trans. Veh. Technol. 63(1): 478-484 (2014) - [c59]Gianluigi Greco, Francesco Scarcello:
Counting solutions to conjunctive queries: structural and hybrid tractability. PODS 2014: 132-143 - [c58]Gianluigi Greco, Francesco Scarcello:
Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability. SEBD 2014: 216-223 - [p1]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
Treewidth and Hypertree Width. Tractability 2014: 3-38 - [i13]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints. CoRR abs/1401.3852 (2014) - 2013
- [j27]Leonardo Militano, Antonio Iera, Francesco Scarcello:
A fair cooperative content-sharing service. Comput. Networks 57(9): 1955-1973 (2013) - [j26]Gianluigi Greco, Francesco Scarcello:
Structural tractability of enumerating CSP solutions. Constraints An Int. J. 18(1): 38-74 (2013) - [j25]Gianluigi Greco, Francesco Scarcello:
Fair division rules for funds distribution: The case of the Italian Research Assessment Program (VQR 2004-2010). Intelligenza Artificiale 7(1): 45-56 (2013) - [c57]Gianluigi Greco, Francesco Scarcello:
Constraint Satisfaction and Fair Multi-Objective Optimization Problems: Foundations, Complexity, and Islands of Tractability. IJCAI 2013: 545-551 - [c56]Gianluigi Greco, Francesco Scarcello:
Structural Tractability of ORDER BY Queries. SEBD 2013: 359-372 - 2012
- [c55]Gianluigi Greco, Enrico Malizia, Francesco Scarcello, Luigi Palopoli:
Hard and Easy k-Typed Compact Coalitional Games: The Knowledge of Player Types Marks the Boundary. ECAI 2012: 372-377 - [i12]Gianluigi Greco, Francesco Scarcello:
The Power of Tree Projections: When Local Consistency Answers Conjunctive Queries. CoRR abs/1205.3321 (2012) - [i11]Gianluigi Greco, Francesco Scarcello:
Bounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash Equilibria. CoRR abs/1207.1383 (2012) - [i10]Gianluigi Greco, Francesco Scarcello:
Mechanisms for Fair Allocation Problems: No-Punishment Payment Rules in Fully Verifiable Settings. CoRR abs/1209.3418 (2012) - [i9]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions. CoRR abs/1209.3419 (2012) - [i8]Gianluigi Greco, Francesco Scarcello:
Tree Projections and Structural Decomposition Methods: Minimality and Game-Theoretic Characterization. CoRR abs/1212.2314 (2012) - 2011
- [j24]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
On the complexity of core, kernel, and bargaining set. Artif. Intell. 175(12-13): 1877-1910 (2011) - [j23]Marco Manna, Francesco Scarcello, Nicola Leone:
On the complexity of regular-grammars with integer attributes. J. Comput. Syst. Sci. 77(2): 393-421 (2011) - [j22]Antonio Iera, Leonardo Militano, Luca Paolo Romeo, Francesco Scarcello:
Fair Cost Allocation in Cellular-Bluetooth Cooperation Scenarios. IEEE Trans. Wirel. Commun. 10(8): 2566-2576 (2011) - [c54]Lucantonio Ghionna, Gianluigi Greco, Francesco Scarcello:
H-DB: a hybrid quantitative-structural sql optimizer. CIKM 2011: 2573-2576 - [c53]Gianluigi Greco, Francesco Scarcello:
Structural Tractability of Constraint Optimization. CP 2011: 340-355 - [c52]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
On the Complexity of the Core over Coalition Structures. IJCAI 2011: 216-221 - [c51]Gianluigi Greco, Francesco Scarcello:
On the Power of Enforcing Local Consistency. SEBD 2011: 139-146 - [i7]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
Pure Nash Equilibria: Hard and Easy Games. CoRR abs/1109.2152 (2011) - 2010
- [j21]Gianluigi Greco, Francesco Scarcello:
On the power of structural decompositions of graph-based representations of constraint problems. Artif. Intell. 174(5-6): 382-409 (2010) - [j20]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
Non-Transferable Utility Coalitional Games via Mixed-Integer Linear Constraints. J. Artif. Intell. Res. 38: 633-685 (2010) - [c50]Gianluigi Greco, Francesco Scarcello:
Structural Tractability of Enumerating CSP Solutions. CP 2010: 236-251 - [c49]Gianluigi Greco, Francesco Scarcello:
The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability. PODS 2010: 327-338 - [i6]Gianluigi Greco, Francesco Scarcello:
On The Power of Tree Projections: Structural Tractability of Enumerating CSP Solutions. CoRR abs/1005.1567 (2010)
2000 – 2009
- 2009
- [j19]Gianluigi Greco, Francesco Scarcello:
On the complexity of constrained Nash equilibria in graphical games. Theor. Comput. Sci. 410(38-40): 3901-3924 (2009) - [c48]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
Constrained coalitional games: formal framework, properties, and complexity results. AAMAS (2) 2009: 1295-1296 - [c47]Georg Gottlob, Gianluigi Greco, Zoltán Miklós, Francesco Scarcello, Thomas Schwentick:
Tree Projections: Game Characterization and Computational Aspects. Graph Theory, Computational Intelligence and Thought 2009: 217-226 - [c46]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions. ICALP (2) 2009: 16-30 - [c45]Gianluigi Greco, Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
On the Complexity of Compact Coalitional Games. IJCAI 2009: 147-152 - 2008
- [c44]Francesco Scarcello, Georg Gottlob, Gianluigi Greco:
Uniform Constraint Satisfaction Problems and Database Theory. Complexity of Constraints 2008: 156-195 - [c43]Gianluigi Greco, Francesco Scarcello:
Tree Projections: Hypergraph Games and Minimality. ICALP (1) 2008: 736-747 - [i5]Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
On the Computational Complexity of the Bargaining Set and the Kernel in Compact Coalitional Games. CoRR abs/0810.3136 (2008) - 2007
- [j18]Simona Perri, Francesco Scarcello, Gelsomina Catalano, Nicola Leone:
Enhancing DLV instantiator by backjumping techniques. Ann. Math. Artif. Intell. 51(2-4): 195-228 (2007) - [j17]Francesco Scarcello, Gianluigi Greco, Nicola Leone:
Weighted hypertree decompositions and optimal query plans. J. Comput. Syst. Sci. 73(3): 475-506 (2007) - [c42]Lucantonio Ghionna, Luigi Granata, Gianluigi Greco, Francesco Scarcello:
Hypertree Decompositions for Query Optimization. ICDE 2007: 36-45 - [c41]Enrico Malizia, Luigi Palopoli, Francesco Scarcello:
Infeasibility Certificates and the Complexity of the Core in Coalitional Games. IJCAI 2007: 1402-1407 - 2006
- [j16]Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello:
The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3): 499-562 (2006) - 2005
- [j15]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
Pure Nash Equilibria: Hard and Easy Games. J. Artif. Intell. Res. 24: 357-406 (2005) - [j14]Francesco Scarcello:
Query answering exploiting structural properties. SIGMOD Rec. 34(3): 91-99 (2005) - [j13]Simona Perri, Francesco Scarcello, Nicola Leone:
Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation. Theory Pract. Log. Program. 5(1-2): 123-159 (2005) - [c40]Gianluigi Greco, Francesco Scarcello:
On the complexity of computing peer agreements for consistent query answering in peer-to-peer data integration systems. CIKM 2005: 36-43 - [c39]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions. IJCAI 2005: 150-155 - [c38]Gianluigi Greco, Francesco Scarcello:
Bounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash Equilibria. UAI 2005: 225-232 - [c37]Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello:
Hypertree Decompositions: Structure, Algorithms, and Applications. WG 2005: 1-15 - 2004
- [j12]Nicola Leone, Francesco Scarcello, V. S. Subrahmanian:
Optimal Models of Disjunctive Logic Programs: Semantics, Complexity, and Computation. IEEE Trans. Knowl. Data Eng. 16(4): 487-503 (2004) - [c36]Gianluigi Greco, Francesco Scarcello:
Constrained Pure Nash Equilibria in Graphical Games. ECAI 2004: 181-185 - [c35]Nicola Leone, Simona Perri, Francesco Scarcello:
BackJumping techniques for rules instantiation in the DLV system. NMR 2004: 258-266 - [c34]Francesco Scarcello, Gianluigi Greco, Nicola Leone:
Weighted Hypertree Decompositions and Optimal Query Plans. PODS 2004: 210-221 - [c33]Gianluigi Greco, Antonella Guzzo, Domenico Saccà, Francesco Scarcello:
Event choice datalog: a logic programming language for reasoning in multiple dimensions. PPDP 2004: 238-249 - [c32]Gianluigi Greco, Nicola Leone, Francesco Scarcello:
On Weighted Hypertree Decompositions. SEBD 2004: 54-61 - 2003
- [j11]Georg Gottlob, Nicola Leone, Francesco Scarcello:
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. J. Comput. Syst. Sci. 66(4): 775-808 (2003) - [c31]Simona Perri, Francesco Scarcello:
Advanced Backjumping Techniques for Rule Instantiations. APPIA-GULP-PRODE 2003: 238-251 - [c30]Gianluigi Greco, Francesco Scarcello:
Non-Binary Constraints and Optimal Dual-Graph Representations. IJCAI 2003: 227-232 - [c29]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
Pure Nash equilibria: hard and easy games. TARK 2003: 215-230 - [i4]Simona Perri, Francesco Scarcello, Nicola Leone:
Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation. CoRR cs.AI/0310047 (2003) - 2002
- [j10]Georg Gottlob, Francesco Scarcello, Martha Sideri:
Fixed-parameter complexity in AI and nonmonotonic reasoning. Artif. Intell. 138(1-2): 55-86 (2002) - [j9]Georg Gottlob, Nicola Leone, Francesco Scarcello:
Hypertree Decompositions and Tractable Queries. J. Comput. Syst. Sci. 64(3): 579-627 (2002) - [j8]Georg Gottlob, Nicola Leone, Francesco Scarcello:
Computing LOGCFL certificates. Theor. Comput. Sci. 270(1-2): 761-777 (2002) - [c28]Nicola Leone, Alfredo Mazzitelli, Francesco Scarcello:
Cost-based Query Decompositions. SEBD 2002: 390-403 - [i3]Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, Francesco Scarcello:
The DLV System for Knowledge Representation and Reasoning. CoRR cs.AI/0211004 (2002) - 2001
- [j7]Georg Gottlob, Nicola Leone, Francesco Scarcello:
The complexity of acyclic conjunctive queries. J. ACM 48(3): 431-498 (2001) - [c27]Nicola Leone, Simona Perri, Francesco Scarcello:
Abduction with Penalization in Logic Programming. AI*IA 2001: 123-134 - [c26]Enrico Franconi, Antonio Laureti Palma, Nicola Leone, Simona Perri, Francesco Scarcello:
Census Data Repair: a Challenging Application of Disjunctive Logic Programming. LPAR 2001: 561-578 - [c25]Nicola Leone, Simona Perri, Francesco Scarcello:
Improving ASP Instantiators by Join-Ordering Methods. LPNMR 2001: 280-294 - [c24]Georg Gottlob, Nicola Leone, Francesco Scarcello:
Hypertree Decompositions: A Survey. MFCS 2001: 37-57 - [c23]Georg Gottlob, Nicola Leone, Francesco Scarcello:
Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. PODS 2001 - [c22]Nicola Leone, Simona Perri, Francesco Scarcello:
Join Ordering Techniques for Knowledge Base Systems. SEBD 2001: 79-93 - [c21]Georg Gottlob, Nicola Leone, Francesco Scarcello:
Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. SEBD 2001: 147-154 - [i2]Giovambattista Ianni, Nicola Leone, Simona Perri, Francesco Scarcello:
Abduction with Penalization in Logic Programming. CoRR cs.LO/0111010 (2001) - 2000
- [j6]Marco Cadoli, Francesco Scarcello:
Semantical and computational aspects of Horn approximations. Artif. Intell. 119(1-2): 1-17 (2000) - [j5]Georg Gottlob, Nicola Leone, Francesco Scarcello:
A comparison of structural CSP decomposition methods. Artif. Intell. 124(2): 243-282 (2000)
1990 – 1999
- 1999
- [j4]Marco Cadoli, Luigi Palopoli, Francesco Scarcello:
Propositional lower bounds: Algorithms and complexity. Ann. Math. Artif. Intell. 27(1-4): 129-148 (1999) - [j3]Georg Gottlob, Nicola Leone, Francesco Scarcello:
On the Complexity of Some Inductive Logic Programming Problems. New Gener. Comput. 17(1): 53-75 (1999) - [c20]Georg Gottlob, Nicola Leone, Francesco Scarcello:
On Tractable Queries and Constraints. DEXA 1999: 1-15 - [c19]Georg Gottlob, Nicola Leone, Francesco Scarcello:
Computing LOGCFL Certificates. ICALP 1999: 361-371 - [c18]Georg Gottlob, Nicola Leone, Francesco Scarcello:
A Comparison of Structural CSP Decomposition Methods. IJCAI 1999: 394-399 - [c17]Georg Gottlob, Francesco Scarcello, Martha Sideri:
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. LPNMR 1999: 1-18 - [c16]Georg Gottlob, Nicola Leone, Francesco Scarcello:
Hypertree Decompositions and Tractable Queries. PODS 1999: 21-32 - [c15]Georg Gottlob, Nicola Leone, Francesco Scarcello:
Hypertree Decompositions and Tractable Queries. SEBD 1999: 275-289 - 1998
- [c14]Georg Gottlob, Nicola Leone, Francesco Scarcello:
The Complexity of Acyclic Conjunctive Queries. FOCS 1998: 706-715 - [c13]Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, Francesco Scarcello:
Progress Report on the Disjunctive Deductive Database System dlv. FQAS 1998: 148-163 - [c12]Marco Cadoli, Luigi Palopoli, Francesco Scarcello:
Propositional Lower Bounds: Generalization and Algorithms. JELIA 1998: 355-367 - [c11]Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, Francesco Scarcello:
The KR System dlv: Progress Report, Comparisons and Benchmarks. KR 1998: 406-417 - [i1]Georg Gottlob, Nicola Leone, Francesco Scarcello:
Hypertree Decompositions and Tractable Queries. CoRR cs.DB/9812022 (1998) - 1997
- [j2]Nicola Leone, Pasquale Rullo, Francesco Scarcello:
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation. Inf. Comput. 135(2): 69-112 (1997) - [c10]Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, Francesco Scarcello:
The Architecture of a Disjunctive Deductive Database System. APPIA-GULP-PRODE 1997: 141-152 - [c9]Georg Gottlob, Nicola Leone, Francesco Scarcello:
On the Complexity of Some Inductive Logic Programming Problems. ILP 1997: 17-32 - [c8]Sergio Greco, Nicola Leone, Francesco Scarcello:
DATALOG with Nested Rules. LPKR 1997: 52-65 - [c7]Thomas Eiter, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, Francesco Scarcello:
A Deductive System for Non-Monotonic Reasoning. LPNMR 1997: 364-375 - [c6]Simona Citrigno, Thomas Eiter, Wolfgang Faber, Georg Gottlob, Christoph Koch, Nicola Leone, Cristinel Mateis, Gerald Pfeifer, Francesco Scarcello:
The dlv System: Model Generator and Advanced Frontends (system description). WLP 1997 - 1996
- [j1]Francesco Buccafurri, Nicola Leone, Francesco Scarcello:
On the Expressive Power of Ordered Logic. AI Commun. 9(1): 4-13 (1996) - [c5]Nicola Leone, Pasquale Rullo, Francesco Scarcello:
On the Computation of Disjunctive Stable Models. DEXA 1996: 654-666 - [c4]Nicola Leone, Pasquale Rullo, Francesco Scarcello:
Stable Model Checking for Disjunctive Logic Programs. Logic in Databases 1996: 265-278 - 1995
- [c3]Francesco Scarcello, Nicola Leone, Luigi Palopoli:
Curbing Theories: Fixpoint Semantics and Complexity Issues. GULP-PRODE 1995: 545-556 - [c2]Nicola Leone, Francesco Scarcello:
Declarative and Fixpoint Characterizations of Disjunctive Stable Models. ILPS 1995: 399-413 - 1993
- [c1]Francesco Scarcello:
Calcolo del Modello Well-Founded di Programmi Datalog. GULP 1993: 469-484
Coauthor Index
[c70] [i17] [j39] [j38] [c67] [e2] [e1] [j36] [p2] [j34] [j33] [c65] [i15] [c63] [c62] [c61] [i14] [c60] [j32] [j31] [j29] [c59] [c58] [p1] [i13] [j26] [j25] [c57] [c56] [c55] [i12] [i11] [i10] [i9] [i8] [j24] [c54] [c53] [c52] [c51] [i7] [j21] [j20] [c50] [c49] [i6] [j19] [c48] [c47] [c46] [c45] [c44] [c43] [j17] [c42] [j15] [c40] [c39] [c38] [c36] [c34] [c33] [c32] [c30] [c29]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
