| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Francesco Scarcello 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 Georg Gottlob , Gianluigi Greco , Francesco Scarcello: The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions. IJCAI 2005 : 150-155 Georg Gottlob , Martin Grohe , Nysret Musliu , Marko Samer , Francesco Scarcello: Hypertree Decompositions: Structure, Algorithms, and Applications. WG 2005 : 1-15 Francesco Scarcello: Query answering exploiting structural properties. SIGMOD Record 34 (3): 91-99 (2005) Simona Perri , Francesco Scarcello, Nicola Leone : Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation. TPLP 5 (1-2): 123-159 (2005) Gianluigi Greco , Francesco Scarcello: Constrained Pure Nash Equilibria in Graphical Games. ECAI 2004 : 181-185 Nicola Leone , Simona Perri , Francesco Scarcello: BackJumping techniques for rules instantiation in the DLV system. NMR 2004 : 258-266 Francesco Scarcello, Gianluigi Greco , Nicola Leone : Weighted Hypertree Decompositions and Optimal Query Plans. PODS 2004 : 210-221 Gianluigi Greco , Antonella Guzzo , Domenico Saccà , Francesco Scarcello: Event choice datalog: a logic programming language for reasoning in multiple dimensions. PPDP 2004 : 238-249 Gianluigi Greco , Nicola Leone , Francesco Scarcello: On Weighted Hypertree Decompositions. SEBD 2004 : 54-61 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) Simona Perri , Francesco Scarcello: Advanced Backjumping Techniques for Rule Instantiations. APPIA-GULP-PRODE 2003 : 238-251 Gianluigi Greco , Francesco Scarcello: Non-Binary Constraints and Optimal Dual-Graph Representations. IJCAI 2003 : 227-232 Georg Gottlob , Gianluigi Greco , Francesco Scarcello: Pure Nash equilibria: hard and easy games. TARK 2003 : 215-230 Simona Perri , Francesco Scarcello, Nicola Leone : Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation CoRR cs.AI/0310047 : (2003) 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) Nicola Leone , Alfredo Mazzitelli , Francesco Scarcello: Cost-based Query Decompositions. SEBD 2002 : 390-403 Georg Gottlob , Francesco Scarcello, Martha Sideri : Fixed-parameter complexity in AI and nonmonotonic reasoning. Artif. Intell. 138 (1-2): 55-86 (2002) 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) Georg Gottlob , Nicola Leone , Francesco Scarcello: Hypertree Decompositions and Tractable Queries. J. Comput. Syst. Sci. 64 (3): 579-627 (2002) Georg Gottlob , Nicola Leone , Francesco Scarcello: Computing LOGCFL certificates. Theor. Comput. Sci. 270 (1-2): 761-777 (2002) Nicola Leone , Simona Perri , Francesco Scarcello: Abduction with Penalization in Logic Programming. AI*IA 2001 : 123-134 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 Nicola Leone , Simona Perri , Francesco Scarcello: Improving ASP Instantiators by Join-Ordering Methods. LPNMR 2001 : 280-294 Georg Gottlob , Nicola Leone , Francesco Scarcello: Hypertree Decompositions: A Survey. MFCS 2001 : 37-57 Georg Gottlob , Nicola Leone , Francesco Scarcello: Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. PODS 2001 Georg Gottlob , Nicola Leone , Francesco Scarcello: Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. SEBD 2001 : 147-154 Nicola Leone , Simona Perri , Francesco Scarcello: Join Ordering Techniques for Knowledge Base Systems. SEBD 2001 : 79-93 Giovambattista Ianni , Nicola Leone , Simona Perri , Francesco Scarcello: Abduction with Penalization in Logic Programming CoRR cs.LO/0111010 : (2001) Georg Gottlob , Nicola Leone , Francesco Scarcello: The complexity of acyclic conjunctive queries. J. ACM 48 (3): 431-498 (2001) Marco Cadoli , Francesco Scarcello: Semantical and computational aspects of Horn approximations. Artif. Intell. 119 (1-2): 1-17 (2000) Georg Gottlob , Nicola Leone , Francesco Scarcello: A comparison of structural CSP decomposition methods. Artif. Intell. 124 (2): 243-282 (2000) Georg Gottlob , Nicola Leone , Francesco Scarcello: On Tractable Queries and Constraints. DEXA 1999 : 1-15 Georg Gottlob , Nicola Leone , Francesco Scarcello: Computing LOGCFL Certificates. ICALP 1999 : 361-371 Georg Gottlob , Nicola Leone , Francesco Scarcello: A Comparison of Structural CSP Decomposition Methods. IJCAI 1999 : 394-399 Georg Gottlob , Francesco Scarcello, Martha Sideri : Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning. LPNMR 1999 : 1-18 Georg Gottlob , Nicola Leone , Francesco Scarcello: Hypertree Decompositions and Tractable Queries. PODS 1999 : 21-32 Georg Gottlob , Nicola Leone , Francesco Scarcello: Hypertree Decompositions and Tractable Queries. SEBD 1999 : 275-289 Marco Cadoli , Luigi Palopoli , Francesco Scarcello: Propositional lower bounds: Algorithms and complexity. Ann. Math. Artif. Intell. 27 (1-4): 129-148 (1999) Georg Gottlob , Nicola Leone , Francesco Scarcello: On the Complexity of Some Inductive Logic Programming Problems. New Generation Comput. 17 (1): 53-75 (1999) Georg Gottlob , Nicola Leone , Francesco Scarcello: The Complexity of Acyclic Conjunctive Queries. FOCS 1998 : 706-715 Thomas Eiter , Nicola Leone , Cristinel Mateis , Gerald Pfeifer , Francesco Scarcello: Progress Report on the Disjunctive Deductive Database System dlv . FQAS 1998 : 148-163 Marco Cadoli , Luigi Palopoli , Francesco Scarcello: Propositional Lower Bounds: Generalization and Algorithms. JELIA 1998 : 355-367 Thomas Eiter , Nicola Leone , Cristinel Mateis , Gerald Pfeifer , Francesco Scarcello: The KR System dlv: Progress Report, Comparisons and Benchmarks. KR 1998 : 406-417 Georg Gottlob , Nicola Leone , Francesco Scarcello: Hypertree Decompositions and Tractable Queries CoRR cs.DB/9812022 : (1998) Thomas Eiter , Nicola Leone , Cristinel Mateis , Gerald Pfeifer , Francesco Scarcello: The Architecture of a Disjunctive Deductive Database System. APPIA-GULP-PRODE 1997 : 141-152 Georg Gottlob , Nicola Leone , Francesco Scarcello: On the Complexity of Some Inductive Logic Programming Problems. ILP 1997 : 17-32 Sergio Greco , Nicola Leone , Francesco Scarcello: DATALOG with Nested Rules. LPKR 1997 : 52-65 Thomas Eiter , Nicola Leone , Cristinel Mateis , Gerald Pfeifer , Francesco Scarcello: A Deductive System for Non-Monotonic Reasoning. LPNMR 1997 : 364-375 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 : 0- Nicola Leone , Pasquale Rullo , Francesco Scarcello: Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation. Inf. Comput. 135 (2): 69-112 (1997) Nicola Leone , Pasquale Rullo , Francesco Scarcello: On the Computation of Disjunctive Stable Models. DEXA 1996 : 654-666 Nicola Leone , Pasquale Rullo , Francesco Scarcello: Stable Model Checking for Disjunctive Logic Programs. Logic in Databases 1996 : 265-278 Francesco Buccafurri , Nicola Leone , Francesco Scarcello: On the Expressive Power of Ordered Logic. AI Commun. 9 (1): 4-13 (1996) Francesco Scarcello, Nicola Leone , Luigi Palopoli : Curbing Theories: Fixpoint Semantics and Complexity Issues. GULP-PRODE 1995 : 545-556 Nicola Leone , Francesco Scarcello: Declarative and Fixpoint Characterizations of Disjunctive Stable Models. ILPS 1995 : 399-413 Francesco Scarcello: Calcolo del Modello Well-Founded di Programmi Datalog. GULP 1993 : 469-484 1 [ 4 ] 2 [ 15 ] [ 19 ] [ 27 ] 3 [ 8 ] 4 [ 8 ] [ 9 ] [ 12 ] [ 14 ] [ 16 ] [ 39 ] 5 [ 8 ] [ 39 ] 6 [ 35 ] 7 [ 8 ] [ 11 ] [ 13 ] [ 17 ] [ 18 ] [ 20 ] [ 21 ] [ 22 ] [ 23 ] [ 24 ] [ 25 ] [ 26 ] [ 28 ] [ 31 ] [ 32 ] [ 33 ] [ 37 ] [ 38 ] [ 39 ] [ 40 ] [ 42 ] [ 44 ] [ 55 ] [ 56 ] 8 [ 44 ] [ 45 ] [ 48 ] [ 49 ] [ 50 ] [ 52 ] [ 56 ] [ 57 ] 9 [ 10 ] 10 [ 55 ] 11 [ 49 ] 12 [ 29 ] 13 [ 8 ] 14 [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] [ 7 ] [ 8 ] [ 9 ] [ 10 ] [ 11 ] [ 12 ] [ 13 ] [ 14 ] [ 16 ] [ 17 ] [ 18 ] [ 20 ] [ 21 ] [ 23 ] [ 24 ] [ 25 ] [ 26 ] [ 28 ] [ 29 ] [ 30 ] [ 31 ] [ 32 ] [ 33 ] [ 34 ] [ 35 ] [ 36 ] [ 37 ] [ 38 ] [ 39 ] [ 41 ] [ 42 ] [ 43 ] [ 47 ] [ 48 ] [ 50 ] [ 51 ] [ 53 ] 15 [ 8 ] [ 9 ] [ 12 ] [ 14 ] [ 16 ] 16 [ 41 ] 17 [ 55 ] 18 [ 35 ] 19 [ 3 ] [ 15 ] [ 19 ] 20 [ 29 ] [ 30 ] [ 34 ] [ 35 ] [ 36 ] [ 39 ] [ 43 ] [ 46 ] [ 51 ] [ 53 ] 21 [ 8 ] [ 9 ] [ 12 ] [ 14 ] [ 16 ] [ 39 ] 22 [ 5 ] [ 6 ] [ 7 ] 23 [ 49 ] 24 [ 55 ] 25 [ 22 ] [ 40 ] 26 [ 47 ]  ©2006 Association for Computing Machinery |
