default search action
Francesco Scarcello
- > Home > Persons > Francesco Scarcello
Publications
- 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 - 2016
- [c63]Georg Gottlob, Gianluigi Greco, Nicola Leone, Francesco Scarcello:
Hypertree Decompositions: Questions and Answers. PODS 2016: 57-74 - 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) - 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) - 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
- [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) - 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) - [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 - [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) - [i4]Simona Perri, Francesco Scarcello, Nicola Leone:
Abductive Logic Programs with Penalization: Semantics, Complexity and Implementation. CoRR cs.AI/0310047 (2003) - 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
- [j5]Georg Gottlob, Nicola Leone, Francesco Scarcello:
A comparison of structural CSP decomposition methods. Artif. Intell. 124(2): 243-282 (2000) - 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 - [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 - [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
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-08-23 19:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint