39 citations · 97 across the 16 of their papers we have counts for
18 papers
Stable Marriage Problems with Ties and Incomplete Preferences: An Empirical Comparison of ASP, SAT, ILP, CP, and Local Search Methods
Selin Eyupoglu, Muge Fidan, Yavuz Gulesen +5
We study a variation of the Stable Marriage problem, where every man and every woman express their preferences as preference lists which may be incomplete and contain ties. This pr…
Knowledge-Based Stable Roommates Problem: A Real-World Application
Muge Fidan, Esra Erdem
The Stable Roommates problem with Ties and Incomplete lists (SRTI) is a matching problem characterized by the preferences of agents over other agents as roommates, where the prefer…
Dynamic Multi-Agent Path Finding based on Conflict Resolution using Answer Set Programming
Basem Atiq, Volkan Patoglu, Esra Erdem
We study a dynamic version of multi-agent path finding problem (called D-MAPF) where existing agents may leave and new agents may join the team at different times. We introduce a n…
Solving Gossip Problems using Answer Set Programming: An Epistemic Planning Approach
Esra Erdem, Andreas Herzig
We investigate the use of Answer Set Programming to solve variations of gossip problems, by modeling them as epistemic planning problems.
Reasoning about Cardinal Directions between 3-Dimensional Extended Objects using Answer Set Programming
Yusuf Izmirlioglu, Esra Erdem
We propose a novel formal framework (called 3D-nCDC-ASP) to represent and reason about cardinal directions between extended objects in 3-dimensional (3D) space, using Answer Set Pr…
Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming
Aysu Bogatarkan, Esra Erdem
The multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous w…