default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFang Wei-Kleiner
Person information
- affiliation: University of Linköping, Department of Computer and Information Science
- affiliation: University of Freiburg, Department of Computer Science
Other persons with the same name
- Fang Wei — disambiguation page
- Fang Wei 0002
![[0000-0003-4423-1604]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0003-4423-1604")
— Singhua University, Department of Construction Management, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c22]Guilherme Schievelbein, Victor Anthony Arrascue Ayala, Fang Wei-Kleiner, Georg Lausen:
Exploiting Wide Property Tables Empowered by Inverse Properties for Efficient Distributed SPARQL Query Evaluation. ISWC (Satellites) 2019: 81-84- 2016
- [j6]Fang Wei-Kleiner:
Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs. J. Comput. Syst. Sci. 82(1): 23-44 (2016) - 2015
- [j5]Patrick Lambrix, Fang Wei-Kleiner, Zlatan Dragisic:
Completing the is-a structure in light-weight ontologies. J. Biomed. Semant. 6: 12 (2015) - 2014
- [c21]Fang Wei-Kleiner, Zlatan Dragisic, Patrick Lambrix:
Abduction Framework for Repairing Incomplete EL Ontologies: Complexity Results and Algorithms. AAAI 2014: 1120-1127 - [c20]Zlatan Dragisic, Patrick Lambrix, Fang Wei-Kleiner:
Completing the is-a Structure of Biomedical Ontologies. DILS 2014: 66-80 - [c19]Zlatan Dragisic, Patrick Lambrix, Fang Wei-Kleiner:
A System for Debugging Missing Is-a Structure in EL Ontologies. WoDOOM 2014: 51-58 - 2013
- [j4]Michael Meier, Michael Schmidt, Fang Wei, Georg Lausen:
Semantic query optimization in the presence of types. J. Comput. Syst. Sci. 79(6): 937-957 (2013) - [c18]Fang Wei-Kleiner:
Finding nearest neighbors in road networks: a tree decomposition method. EDBT/ICDT Workshops 2013: 233-240 - [c17]Patrick Lambrix, Fang Wei-Kleiner, Zlatan Dragisic, Valentina Ivanova:
Repairing missing is-a structure in ontologies is an abductive reasoning problem. WoDOOM 2013: 33-44 - [i2]Fang Wei-Kleiner:
Tree Decomposition based Steiner Tree Computation over Large Graphs. CoRR abs/1305.5757 (2013) - 2011
- [p1]Fang Wei:
TEDI: Efficient Shortest Path Query Answering on Graphs. Graph Data Management 2011: 214-238 - 2010
- [j3]Georg Gottlob, Reinhard Pichler, Fang Wei:
Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artif. Intell. 174(1): 105-132 (2010) - [j2]Georg Gottlob, Reinhard Pichler, Fang Wei:
Tractable database design and datalog abduction through bounded treewidth. Inf. Syst. 35(3): 278-298 (2010) - [j1]Georg Gottlob, Reinhard Pichler, Fang Wei:
Monadic datalog over finite structures of bounded treewidth. ACM Trans. Comput. Log. 12(1): 3:1-3:48 (2010) - [c16]Michael Meier, Michael Schmidt, Fang Wei, Georg Lausen:
Semantic query optimization in the presence of types. PODS 2010: 111-122 - [c15]Fang Wei:
Efficient Graph Reachability Query Answering Using Tree Decomposition. RP 2010: 183-197 - [c14]Fang Wei:
TEDI: efficient shortest path query answering on graphs. SIGMOD Conference 2010: 99-110
2000 – 2009
- 2009
- [c13]Hannes Eder, Fang Wei:
Evaluation of skyline algorithms in PostgreSQL. IDEAS 2009: 334-337 - 2008
- [c12]Georg Gottlob, Reinhard Pichler, Fang Wei:
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation. AAAI 2008: 1541-1546 - [c11]Reinhard Pichler, Axel Polleres, Fang Wei, Stefan Woltran:
dRDF: Entailment for Domain-Restricted RDF. ESWC 2008: 200-214 - [c10]Fang Wei, Georg Lausen:
A unified apriori-like algorithm for conjunctive query containment. IDEAS 2008: 111-120 - [i1]Georg Gottlob, Reinhard Pichler, Fang Wei:
Monadic Datalog over Finite Structures with Bounded Treewidth. CoRR abs/0809.3140 (2008) - 2007
- [c9]Georg Gottlob, Reinhard Pichler, Fang Wei:
Efficient Datalog Abduction through Bounded Treewidth. AAAI 2007: 1626-1631 - [c8]Georg Gottlob, Reinhard Pichler, Fang Wei:
Monadic datalog over finite structures with bounded treewidth. PODS 2007: 165-174 - [c7]François Bry, Norbert Eisinger, Thomas Eiter, Tim Furche, Georg Gottlob, Clemens Ley, Benedikt Linse, Reinhard Pichler, Fang Wei:
Foundations of Rule-Based Query Answering. Reasoning Web 2007: 1-153 - 2006
- [c6]Georg Gottlob, Reinhard Pichler, Fang Wei:
Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning. AAAI 2006: 250-256 - [c5]Georg Gottlob, Reinhard Pichler, Fang Wei:
Tractable database design through bounded treewidth. PODS 2006: 124-133 - 2005
- [b1]Fang Wei:
Query equivalence and containment on relational and tree databases. University of Freiburg, 2005 - 2003
- [c4]Georg Lausen, Fang Wei:
On the Containment of Conjunctive Queries. Computer Science in Perspective 2003: 231-244 - [c3]Fang Wei, Georg Lausen:
Containment of Conjunctive Queries with Safe Negation. ICDT 2003: 343-357 - 2002
- [c2]Fang Wei, Georg Lausen:
Conjunctive Query Containment in the Presence of Disjunctive Integrity Constraints. KRDB 2002 - 2001
- [c1]Fang Wei, Georg Lausen:
A Formal Analysis of the Lightweight Directory Access Protocol. ER (Workshops) 2001: 306-319
Coauthor Index
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-10-07 21:16 CEST 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:
