Aybüke Özgün

dblp:135/5089 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0003-2523-0518ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3 · 1 since 2021Artificial intelligence and machine learning · 2 · 1 since 2021Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%
Theoretical computer science
1 paper
Computational complexity · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning › uncertainty reasoning
belief functions
0.712023
A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence · KR 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
belief revision
0.712023
A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence · KR 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › information fusion
evidence combination
0.712023
A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence · KR 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
uncertainty reasoning
0.712023
A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence · KR 2023

Methods — techniques the papers use, named apart from their topics

topology of evidence · 1.3
YearPublicationVenuePosition
2023 A Belief Model for Conflicting and Uncertain Evidence: Connecting Dempster-Shafer Theory and the Topology of Evidence
abstract
One problem to solve in the context of information fusion, decision-making, and other artificial intelligence challenges is to compute justified beliefs based on evidence. In real-life examples, this evidence may be inconsistent, incomplete, or uncertain, making the problem of evidence fusion highly non-trivial. In this paper, we propose a new model for measuring degrees of beliefs based on possibly inconsistent, incomplete, and uncertain evidence, by combining tools from Dempster-Shafer Theory and Topological Models of Evidence. Our belief model is more general than the aforementioned approaches in two important ways: (1) it can reproduce them when appropriate constraints are imposed, and, more notably, (2) it is flexible enough to compute beliefs according to various standards that represent agents' evidential demands. The latter novelty allows the users of our model to employ it to compute an agent's (possibly) distinct degrees of belief, based on the same evidence, in situations when, e.g, the agent prioritizes avoiding false negatives and when it prioritizes avoiding false positives. Finally, we show that computing degree of belief with this model is #P-complete in general.
Daira Pinto Prieto, Ronald de Haan, Aybüke Özgün
KR3
2019 A dynamic logic for learning theory
Alexandru Baltag, Nina Gierasimczuk, Aybüke Özgün, Ana Lucia Vargas Sandoval, Sonja Smets
J. Log. Algebraic Methods Program.3
2018 APAL with Memory Is Better
Alexandru Baltag, Aybüke Özgün, Ana Lucia Vargas Sandoval
WoLLIC2
2016 Justified Belief and the Topology of Evidence
Alexandru Baltag, Nick Bezhanishvili, Aybüke Özgün, Sonja Smets
WoLLIC3
2014 Arbitrary Announcements on Topological Subset Spaces
Hans van Ditmarsch, Sophia Knight, Aybüke Özgün
EUMAS3