A5010967150- Semantic Web and Ontologies
- Logic, Reasoning, and Knowledge
- Advanced Database Systems and Queries
- Natural Language Processing Techniques
- Advanced Algebra and Logic
- Logic, programming, and type systems
- Data Management and Algorithms
- Service-Oriented Architecture and Web Services
- Constraint Satisfaction and Optimization
- Multi-Agent Systems and Negotiation
- Formal Methods in Verification
- semigroups and automata theory
- Biomedical Text Mining and Ontologies
- Global trade and economics
- Rough Sets and Fuzzy Logic
- Economic Growth and Productivity
- Computability, Logic, AI Algorithms
- Machine Learning and Algorithms
- Transportation and Mobility Innovations
- German Economic Analysis & Policies
- Forest Management and Policy
- Global Trade and Competitiveness
- Silicon Carbide Semiconductor Technologies
- Digital Innovation in Industries
- Sharing Economy and Platforms
University of Liverpool
2015-2024
Technische Universität Dresden
2004-2022
Free University of Bozen-Bolzano
2008-2022
Birkbeck, University of London
2007-2022
SRH University Berlin
2022
National Research University Higher School of Economics
2022
University of Hildesheim
2021
Infineon Technologies (Germany)
2015-2020
University of Bremen
2017-2019
Centro di Ricerca per l’Orticoltura
2015
We survey temporal description logics that are based on standard such as LTL and CTL. In particular, we concentrate the computational complexity of satisfiability problem algorithms for deciding it.
Ontology-based data access is concerned with querying incomplete sources in the presence of domain-specific knowledge provided by an ontology. A central notion this setting that ontology-mediated query , which a database coupled In article, we study several classes queries, where queries are given as some form conjunctive and ontologies formulated description logics or other relevant fragments first-order logic, such guarded fragment unary negation fragment. The contributions article...
The use of ontologies for accessing data is one the most exciting new applications description logics in databases and other information systems. A realistic way realising sufficiently scalable ontology-based access practice by reduction to querying relational databases. In this paper, we describe combined approach, which incorporates given ontology into employs query rewriting eliminate spurious answers. We illustrate approach DL-Lite family briefly discuss results obtained EL family.
In monomodal logic there are a fair number of high-powered results on completeness covering large classes modal systems; witness for example Fine [74], [85] and Sahlqvist [75]. Monomodal is therefore well-understood subject in contrast to polymodal logic, where even the most elementary questions concerning completeness, decidability, etc. have been left unanswered. Given that many applications one modality not sufficient, lack general acutely felt by “users” logics, contrary logicians who...
As fragments of first-order logic, Description logics (DLs) do not provide nonmonotonic features such as defeasible inheritance and default rules. Since many applications would benefit from the availability features, several families DLs have been developed that are mostly based on logic autoepistemic logic. In this paper, we consider circumscription an interesting alternative approach to that, in particular, supports a natural way. We study extended with under different language...
Abstract Dynamic conservation of forest genetic resources (FGR) means maintaining the diversity trees within an evolutionary process and allowing generation turnover in forest. We assessed network forests areas managed for dynamic FGR (conservation units) across Europe (33 countries). On basis information available European Information System on (EUFGIS Portal), species distribution maps, environmental stratification continent, we developed ecogeographic indicators, a marginality index,...