Остановите войну!
for scientists:
default search action
Francesco Scarcello
- > Home > Persons > Francesco Scarcello
Publications
- 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 - 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) - 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
- [c63]Georg Gottlob, Gianluigi Greco, Nicola Leone, Francesco Scarcello:
Hypertree Decompositions: Questions and Answers. PODS 2016: 57-74 - 2014
- [p1]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
Treewidth and Hypertree Width. Tractability 2014: 3-38 - 2012
- [i9]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions. CoRR abs/1209.3419 (2012) - 2011
- [i7]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
Pure Nash Equilibria: Hard and Easy Games. CoRR abs/1109.2152 (2011) - 2009
- [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 - 2008
- [c44]Francesco Scarcello, Georg Gottlob, Gianluigi Greco:
Uniform Constraint Satisfaction Problems and Database Theory. Complexity of Constraints 2008: 156-195 - 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) - [c39]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
The Complexity of Quantified Constraint Satisfaction Problems under Structural Restrictions. IJCAI 2005: 150-155 - [c37]Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello:
Hypertree Decompositions: Structure, Algorithms, and Applications. WG 2005: 1-15 - 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) - [c29]Georg Gottlob, Gianluigi Greco, Francesco Scarcello:
Pure Nash equilibria: hard and easy games. TARK 2003: 215-230 - 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) - [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) - [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 - [c21]Georg Gottlob, Nicola Leone, Francesco Scarcello:
Robbers, Marshals, and Guards: Game Theoretic and Logical Characterizations of Hypertree Width. SEBD 2001: 147-154 - 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 - [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 - [i1]Georg Gottlob, Nicola Leone, Francesco Scarcello:
Hypertree Decompositions and Tractable Queries. CoRR cs.DB/9812022 (1998) - 1997
- [c9]Georg Gottlob, Nicola Leone, Francesco Scarcello:
On the Complexity of Some Inductive Logic Programming Problems. ILP 1997: 17-32 - [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
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-04-03 22:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint