Heba Aamer

Orcid: 0000-0003-0460-8534

According to our database1, Heba Aamer authored at least 13 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Distributed Subweb Specifications for Traversing the Web.
Theory Pract. Log. Program., March, 2024

2023
Inputs, Outputs, and Composition in the Logic of Information Flows.
ACM Trans. Comput. Log., October, 2023

Efficient computation of comprehensive statistical information of large OWL datasets: a scalable approach.
Enterp. Inf. Syst., July, 2023

Logical Analysis of Input and Output Sensitivity in the Logic of Information Flows
PhD thesis, 2023

2022
What Can Database Query Processing Do for Instance-Spanning Constraints?
Proceedings of the Business Process Management Workshops, 2022

2021
Link Traversal with Distributed Subweb Specifications.
Proceedings of the Rules and Reasoning - 5th International Joint Conference, 2021

Expressiveness within Sequence Datalog.
Proceedings of the PODS'21: Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2021

Input-Output Disjointness for Forward Expressions in the Logic of Information Flows.
Proceedings of the 24th International Conference on Database Theory, 2021

A Scalable Approach for Distributed Reasoning over Large-scale OWL Datasets.
Proceedings of the 13th International Joint Conference on Knowledge Discovery, 2021

2020
OWLStats: Distributed Computation of OWL Dataset Statistics.
Proceedings of the IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, 2020

Executable First-Order Queries in the Logic of Information Flows.
Proceedings of the 23rd International Conference on Database Theory, 2020

A Distributed Approach for Parsing Large-scale OWL Datasets.
Proceedings of the 12th International Joint Conference on Knowledge Discovery, 2020

2018
Concatenation, Separation, and Other Properties of Variably Polyadic Relations.
Proceedings of the Foundations of Information and Knowledge Systems, 2018


  Loading...