What is he best known for?
The fields of study he is best known for:
- Programming language
- Artificial intelligence
- Algebra
His scientific interests lie mostly in Description logic, Theoretical computer science, Decidability, Ontology and Modal logic.
The various areas that Frank Wolter examines in his Description logic study include Modularity, Conjunctive query, Information retrieval and Conservative extension.
Frank Wolter is involved in the study of Theoretical computer science that focuses on Undecidable problem in particular.
His Decidability research is within the category of Discrete mathematics.
Frank Wolter combines subjects such as Ontology and Context with his study of Ontology.
His study explores the link between Modal logic and topics such as Multimodal logic that cross with problems in Dynamic logic, Intermediate logic and Calculus.
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)
- Many-Dimensional Modal Logics: Theory and Applications (498 citations)
What are the main themes of his work throughout his whole career to date?
The scientist’s investigation covers issues in Description logic, Theoretical computer science, Ontology, Discrete mathematics and Decidability.
The study incorporates disciplines such as Algorithm, Conjunctive query, Undecidable problem and Algebra in addition to Description logic.
His research investigates the connection with Theoretical computer science and areas like Forgetting which intersect with concerns in Interpolation.
His Discrete mathematics research incorporates elements of Modal logic, Accessibility relation and Temporal logic.
As part of the same scientific family, Frank Wolter usually focuses on Modal logic, concentrating on Multimodal logic and intersecting with Dynamic logic.
His Decidability research incorporates themes from Fragment, Finite model property and Boolean satisfiability problem.
He most often published in these fields:
- Description logic (50.68%)
- Theoretical computer science (34.59%)
- Ontology (23.63%)
What were the highlights of his more recent work (between 2018-2021)?
- Description logic (50.68%)
- Ontology (23.63%)
- Theoretical computer science (34.59%)
In recent papers he was focusing on the following fields of study:
Frank Wolter mainly focuses on Description logic, Ontology, Theoretical computer science, Decidability and Fragment.
In his articles, Frank Wolter combines various disciplines, including Description logic and French horn.
His work deals with themes such as Linear temporal logic, Data access, Temporal database and Primitive recursive function, which intersect with Ontology.
The concepts of his Theoretical computer science study are interwoven with issues in Conjunctive query and Decision problem.
His study in Decidability is interdisciplinary in nature, drawing from both Craig interpolation, Beth definability and Ontology engineering.
His Fragment study deals with P intersecting with Finite model theory, Type, Modal logic and Dichotomy.
Between 2018 and 2021, his most popular works were:
- Query Inseparability for ALC Ontologies (7 citations)
- Learning Description Logic Concepts: When can Positive and Negative Examples be Separated? (6 citations)
- Least General Generalizations in Description Logic: Verification and Existence (5 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Artificial intelligence
- Algebra
Frank Wolter mainly investigates Description logic, Theoretical computer science, Conjunctive query, P and EXPTIME.
His Description logic research is multidisciplinary, incorporating perspectives in Concept learning and Link.
His Theoretical computer science study typically links adjacent topics like Ontology.
His research in Conjunctive query focuses on subjects like Decidability, which are connected to Range, Algebra, Generalization and Meaning.
His P research includes themes of Datalog, Fragment and Modal logic.
His EXPTIME research incorporates elements of NEXPTIME, Undecidable problem, Polynomial hierarchy, Extension and Decision problem.
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.
