Efficient Identification of Implicit Facts in Incomplete OWL2-EL Knowledge Bases

Summary: I/O-aware, disk-resident algorithm for deriving implicit facts in OWL2-EL KBs, enabling scalable integration on incomplete sources. Exhaustively applying inference rules under memory limits, with correctness guarantees and validation on real/synthetic data. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h5836eb8ae29e0bda
Venue: VLDB
Year: 2014
Pagerank: 5.5694935e-05
Overall Rank: 7,271 | 51.12%
DOI: 10.14778/2733085.2733104

Incoming Non-self Citations Over Time

Authors

1. John Liagouris (National Technical University of Athens)
2. Manolis Terrovitis (Research Center Athena)

BibTeX Citation

@article{liagouris_vldb14,
        title = {{Efficient Identification of Implicit Facts in Incomplete OWL2-EL Knowledge Bases}},
        author = {Liagouris, John and Terrovitis, Manolis},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {14},
        doi = {10.14778/2733085.2733104},
        url = {https://doi.org/10.14778/2733085.2733104},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,884	FlowLog: Efficient and Extensible Datalog via Incrementality	2026	VLDB	4.9793485e-05
12,403	Slider: an Efficient Incremental Reasoner	2015	SIGMOD	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
18	MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract)	1986	PODS	0.00059023577
53	Eddies: Continuously Adaptive Query Processing	2000	SIGMOD	0.00040860054
129	Efficient and Extensible Algorithms for Multi Query Optimization	2000	SIGMOD	0.0003040756
2,109	A Study of Transitive Closure As a Recursion Mechanism	1987	SIGMOD	9.0238479e-05
2,584	Advanced Processing for Ontological Queries	2010	VLDB	8.2585389e-05
6,131	More Efficient Datalog Queries: Subsumptive Tabling Beats Magic Sets	2011	SIGMOD	5.8779512e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	9,466	Efficiently Enumerating Answers to Ontology-Mediated Queries	2022	PODS
2	4,492	Supporting Ontology-based Semantic Matching in RDBMS	2004	VLDB
3	8,628	Inferray: fast in-memory RDF inference	2016	VLDB
4	3,039	Knowledge Expansion over Probabilistic Knowledge Bases	2014	SIGMOD
5	8,646	Optimizing Query Answering under Ontological Constraints	2011	VLDB
6	4,655	A Temporal-Probabilistic Database Model for Information Extraction	2013	VLDB
7	6,757	Teaching an RDBMS about ontological constraints	2016	VLDB
8	9,278	Ontological Pathfinding: Mining First-Order Knowledge from Large Knowledge Bases	2016	SIGMOD
9	2,300	Leveraging Data and Structure in Ontology Integration	2007	SIGMOD
10	12,265	The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries	2017	PODS