A5065498907- Logic, Reasoning, and Knowledge
- Multi-Agent Systems and Negotiation
- Semantic Web and Ontologies
- Bayesian Modeling and Causal Inference
- Business Process Modeling and Analysis
- AI-based Problem Solving and Planning
- Access Control and Trust
- Advanced Database Systems and Queries
- Topic Modeling
- Service-Oriented Architecture and Web Services
- Advanced Algebra and Logic
- Software Engineering Research
- Logic, programming, and type systems
- Model-Driven Software Engineering Techniques
- Rough Sets and Fuzzy Logic
- Data Management and Algorithms
- Graph Theory and Algorithms
- Data Stream Mining Techniques
- Advanced Software Engineering Methodologies
- Natural Language Processing Techniques
- Formal Methods in Verification
- Scientific Computing and Data Management
- Biomedical Text Mining and Ontologies
- Mobile Crowdsensing and Crowdsourcing
- Complex Network Analysis Techniques
University of Hagen
2022-2024
Universität Koblenz
2012-2021
University of Koblenz and Landau
2012-2021
Folkwang University of the Arts
2021
University of Siegen
2021
Koblenz University of Applied Sciences
2012-2020
Technical University of Darmstadt
2020
Leipzig University
2016-2018
Otto-von-Guericke University Magdeburg
2014
TU Dortmund University
2008-2012
The field of computational models argument is emerging as an important aspect artificial intelligence research. reason for this based on the recognition that if we are to develop robust intelligent systems, then it imperative they can handle incomplete and inconsistent information in a way somehow emulates humans tackle such complex task. And one key ways do use argumentation either internally, by evaluating arguments counterarguments, or externally, instance entering into discussion debate...
Abstract argumentation offers an appealing way of representing and evaluating arguments counterarguments. This approach can be enhanced by considering probability assignments on arguments, allowing for a quantitative treatment formal argumentation. In this paper, we regard the assignment as denoting degree belief that agent has in argument being acceptable. While there are various interpretations this, example is how it could applied to deductive argument. Here, acceptable combination which...
We present algorithms based on satisfiability problem (SAT) solving, as well answer set programming (ASP), for solving the of determining inconsistency degrees in propositional knowledge bases. consider six different measures whose respective decision problems lie first level polynomial hierarchy. Namely, these are contension, forgetting-based, hitting set, max-distance, sum-distance, and hit-distance measures. In an extensive experimental analysis, we compare SAT-based ASP-based approaches...
We review the First International Competition on Computational Models of Argumentation (ICCMA'15). The competition evaluated submitted solvers' performance four different computational tasks related to solving abstract argumentation frameworks. Each task solvers in ways that pushed edge existing by introducing new challenges. Despite being first this area, high number competitors entered, and differences results, suggest will help shape landscape ongoing developments theory solvers.
We investigate the structural patterns of appearance and disappearance links in dynamic knowledge networks. Human is nowadays increasingly created curated online, a collaborative highly fashion. The thus interlinked nature, an important open task to understand its temporal evolution. In this paper, we study underlying mechanisms changes networks which are i.e., direct result network's structure. Concretely, ask whether interconnections between concepts (items base) can be predicted using...
This paper develops an inconsistency measure on conditional probabilistic knowledge bases. The is based fundamental principles for measures and thus provides a solid theoretical framework the treatment of inconsistencies in expert systems. We illustrate its usefulness immediate application several examples present some formal results. Building this we use Shapley value-a well-known solution coalition games-to define sophisticated indicator that not only able to but reveal causes base....