What is he best known for?
The fields of study he is best known for:
- Programming language
- Artificial intelligence
- Algebra
Michael Zakharyaschev focuses on Theoretical computer science, Ontology, Description logic, Decidability and Discrete mathematics.
His work on Satisfiability as part of general Theoretical computer science study is frequently linked to T-norm fuzzy logics, therefore connecting diverse disciplines of science.
The study incorporates disciplines such as Context, Ontology, Data access and Relational database, Conjunctive query in addition to Ontology.
His Description logic research incorporates themes from Modal logic, Solver and Transitive relation.
The concepts of his Decidability study are interwoven with issues in Linear temporal logic, Temporal logic and Knowledge representation and reasoning.
His study in the fields of Boolean satisfiability problem under the domain of Discrete mathematics overlaps with other disciplines such as Monoidal t-norm logic.
His most cited work include:
- Monodic fragments of first-order temporal logics: 2000-2001 A.D (953 citations)
- Semi-qualitative Reasoning about Distances: A Preliminary Report (683 citations)
- Modal Logic (643 citations)
What are the main themes of his work throughout his whole career to date?
Theoretical computer science, Description logic, Discrete mathematics, Ontology and Conjunctive query are his primary areas of study.
Michael Zakharyaschev mostly deals with Temporal logic in his studies of Theoretical computer science.
His Description logic research integrates issues from Context, Satisfiability and Algebra, Transitive relation.
His work deals with themes such as Modal logic and Accessibility relation, which intersect with Discrete mathematics.
His work in Modal logic covers topics such as Multimodal logic which are related to areas like Dynamic logic.
His Ontology course of study focuses on Datalog and Extension.
He most often published in these fields:
- Theoretical computer science (32.54%)
- Description logic (30.95%)
- Discrete mathematics (28.97%)
What were the highlights of his more recent work (between 2013-2021)?
- Ontology (23.41%)
- Theoretical computer science (32.54%)
- Conjunctive query (18.65%)
In recent papers he was focusing on the following fields of study:
His primary areas of study are Ontology, Theoretical computer science, Conjunctive query, Description logic and Datalog.
His Ontology research includes themes of Ontology, Data access, Data complexity and Temporal logic.
His biological study spans a wide range of topics, including Linear temporal logic, Undecidable problem and Metric.
His Theoretical computer science research is multidisciplinary, incorporating perspectives in Set, Knowledge base, Semantics and Algorithm, Primitive recursive function.
The study incorporates disciplines such as Discrete mathematics, Decidability, EXPTIME, Web Ontology Language and Axiom in addition to Conjunctive query.
His work carried out in the field of Description logic brings together such families of science as Computational complexity theory and Signature, Algebra.
Between 2013 and 2021, his most popular works were:
- Ontology-based data access: a survey (101 citations)
- Answering SPARQL Queries over Databases under OWL 2 QL Entailment Regime (86 citations)
- The price of query rewriting in ontology-based data access (68 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algebra
- Artificial intelligence
Michael Zakharyaschev mainly investigates Ontology, Theoretical computer science, Conjunctive query, Datalog and Description logic.
His study on Ontology also encompasses disciplines like
- Data access that intertwine with fields like SPARQL, Information retrieval and Relational database,
- Natural language processing, which have a strong connection to Temporal database and Knowledge representation and reasoning.
His Datalog research is multidisciplinary, relying on both Query language, Temporal logic and Extension.
Within one scientific family, Michael Zakharyaschev focuses on topics pertaining to Linear temporal logic under Temporal logic, and may sometimes address concerns connected to Dynamic logic.
His Interval temporal logic study in the realm of Description logic connects with subjects such as T-norm fuzzy logics.
Michael Zakharyaschev usually deals with Decidability and limits it to topics linked to Boolean satisfiability problem and Satisfiability.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
