A5082472539- Semantic Web and Ontologies
- Logic, Reasoning, and Knowledge
- Advanced Database Systems and Queries
- Natural Language Processing Techniques
- Multi-Agent Systems and Negotiation
- Data Quality and Management
- Service-Oriented Architecture and Web Services
- Logic, programming, and type systems
- Data Management and Algorithms
- Formal Methods in Verification
- Scientific Computing and Data Management
- Biomedical Text Mining and Ontologies
- semigroups and automata theory
- Advanced Algebra and Logic
- AI-based Problem Solving and Planning
- Topic Modeling
- Data Mining Algorithms and Applications
- Cellular Automata and Applications
- Electrodeposition and Electroless Coatings
- DNA and Biological Computing
- Web Data Mining and Analysis
- graph theory and CDMA systems
- Molecular Junctions and Nanostructures
- Computability, Logic, AI Algorithms
- Coding theory and cryptography
TU Wien
2014-2024
Umeå University
2023-2024
University of Vienna
2018-2021
University of Chile
2018
Laboratoire de Recherche en Informatique
2015
Université Paris-Sud
2015
Centre National de la Recherche Scientifique
2015
Universidad de las Américas Puebla
2004-2007
Free University of Bozen-Bolzano
2006
Query answering over Description Logic (DL) ontologies has become a vibrant field of research. Efficient realizations often exploit database technology and rewrite given query to an equivalent SQL or Datalog associated with the ontology. This approach been intensively studied for conjunctive in DL-Lite EL families, but is much less explored more expressive DLs queries. We present rewriting-based algorithm Horn-SHIQ ontologies, possibly extended recursive rules under limited recursion as...
The high computational complexity of the expressive Description Logics (DLs) that underlie OWL standard has motivated study their Horn fragments, which are usually tractable in data and can also have lower combined complexity, particularly for query answering. In this paper we provide algorithms answering conjunctive 2-way regular path queries (2CRPQs), a non-trivial generalization plain queries, fragments DLs SHOIQ SROIQ underlying 1 2. We show problem is ExpTime-complete Horn-SHOIQ...
In order to meet usability requirements, most logic-based applications provide explanation facilities for reasoning services. This holds also Description Logics, where research has focused on the of both TBox and, more recently, query answering. Besides explaining presence a tuple in answer, it is important explain why given missing. We address latter problem instance and conjunctive answering over DL-Lite ontologies by adopting abductive reasoning; that is, we look additions ABox force be...
Two-way regular path queries (2RPQs) have received increased attention recently due to their ability relate pairs of objects by flexibly navigating graph-structured data. They are present in property paths SPARQL 1.1, the new standard RDF query language, and XML language XPath. In line with XPath, we consider extension 2RPQs nesting, which allows one require that along a satisfy complex conditions, turn expressed through (nested) 2RPQs. We study computational complexity answering nested...
Conjunctive regular path queries are an expressive extension of the well-known class conjunctive queries. Such have been extensively studied in (graph) database community, since they support a controlled form recursion and enable sophisticated navigation. Somewhat surprisingly, there has little work aimed at using such context description logic (DL) knowledge bases, particularly for lightweight DLs that considered best suited data-intensive applications. This paper aims to bridge this gap by...
SHACL (SHape Constraint Language) is a W3C recommendation for validating graph-based data against set of constraints (called shapes). Importantly, allows to define recursive shapes, i.e. shape may refer itself, directly indirectly. The left open the semantics but proposals have emerged recently extend official support recursion. These are based on principle possibility (or non-contradiction): graph considered valid schema if one can assign shapes nodes in such way that all satisfied. This...
research-article Share on Research Directions for Principles of Data Management (Abridged) Authors: Serge Abiteboul View Profile , Marcelo Arenas Pablo Barceló Meghyn Bienvenu Diego Calvanese Claire David Richard Hull Eyke Hüllermeier Benny Kimelfeld Leonid Libkin Wim Martens Tova Milo Filip Murlak Frank Neven Magdalena Ortiz Thomas Schwentick Julia Stoyanovich Jianwen Su Dan Suciu Victor Vianu Ke Yi Authors Info & Claims ACM SIGMOD RecordVolume 45Issue 4December 2016 pp...
The area of Principles Data Management (PDM) has made crucial contributions to the development formal frameworks for understanding and managing data knowledge. This work involved a rich cross-fertilization between PDM other disciplines in mathematics computer science, including logic, complexity theory, knowledge representation. We anticipate on-going expansion PDM research as technology applications involving data management continue grow evolve. In particular, lifecycle Big Analytics...