What is he best known for?
The fields of study he is best known for:
- Programming language
- Artificial intelligence
- Algorithm
His scientific interests lie mostly in Theoretical computer science, Programming language, Knowledge representation and reasoning, Answer set programming and Logic programming.
His biological study spans a wide range of topics, including Computational complexity theory, Representation and Computation.
His Programming language research includes elements of Semantics and Rotation formalisms in three dimensions.
His work carried out in the field of Answer set programming brings together such families of science as Graphical user interface, User interface and Database.
His research integrates issues of Prolog, Functional logic programming, Computational logic and Complete information in his study of Logic programming.
His Non-monotonic logic research incorporates elements of Datalog and Declarative programming.
His most cited work include:
- The DLV system for knowledge representation and reasoning (1059 citations)
- Logic Programming and Nonmonotonic Reasoning (316 citations)
- Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity (223 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Theoretical computer science, Answer set programming, Programming language, Stable model semantics and Logic programming.
His studies deal with areas such as Computation, Semantics, Set and Knowledge representation and reasoning as well as Theoretical computer science.
The various areas that Wolfgang Faber examines in his Answer set programming study include Discrete mathematics, Heuristics, Declarative programming and Polynomial hierarchy.
His Programming language research includes themes of Computational complexity theory and Disjunctive programming.
His work investigates the relationship between Stable model semantics and topics such as Equivalence that intersect with problems in Epistemic modal logic, Algorithm and Rewriting.
His work in Logic programming covers topics such as Functional logic programming which are related to areas like Horn clause.
He most often published in these fields:
- Theoretical computer science (61.11%)
- Answer set programming (46.91%)
- Programming language (38.27%)
What were the highlights of his more recent work (between 2013-2021)?
- Answer set programming (46.91%)
- Theoretical computer science (61.11%)
- Semantics (19.75%)
In recent papers he was focusing on the following fields of study:
Wolfgang Faber focuses on Answer set programming, Theoretical computer science, Semantics, Non-monotonic logic and Programming language.
While the research belongs to areas of Answer set programming, Wolfgang Faber spends his time largely on the problem of Key, intersecting his research to questions surrounding Transformation and Debugging.
His Theoretical computer science study combines topics in areas such as Negation, Computational complexity theory, Modular design, Semantics and Declarative programming.
His study looks at the relationship between Declarative programming and topics such as Circumscription, which overlap with Satisfiability, Optimization problem, Datalog, Language construct and Prolog.
His work deals with themes such as Set, Logic programming and Truth value, which intersect with Semantics.
His study brings together the fields of Knowledge representation and reasoning and Programming language.
Between 2013 and 2021, his most popular works were:
- ASP-Core-2 Input Language Format (71 citations)
- Rewriting recursive aggregates in answer set programming: back to monotonicity (23 citations)
- The ASP System DLV: Advancements and Applications (17 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Artificial intelligence
- Algorithm
The scientist’s investigation covers issues in Answer set programming, Theoretical computer science, Non-monotonic logic, Implementation and Programming language.
In his study, Input language is inextricably linked to Knowledge representation and reasoning, which falls within the broad field of Answer set programming.
His Theoretical computer science research is multidisciplinary, incorporating perspectives in Equivalence and Semantics.
He interconnects Satisfiability, Circumscription, Maximum satisfiability problem, Optimization problem and Declarative programming in the investigation of issues within Non-monotonic logic.
Wolfgang Faber focuses mostly in the field of Implementation, narrowing it down to matters related to Computation and, in some cases, Negation.
In general Programming language, his work in Solver and Consistency is often linked to Base and Region connection calculus linking many areas of study.
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.
