Orkunt Sabuncu

dblp:77/4263 · DBLP profile ↗
← Back
18ranked-venue papers
2as first author
4since 2021 · last 2024
0000-0003-1432-042XORCID · verified

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

Artificial intelligence and machine learning · 13 · 2 first-author · 2 since 2021Theory of computation · 10 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4Software engineering, systems software and programming languages · 3 · 2 since 2021Databases, data management, data science and information retrieval · 1
YearPublicationVenuePosition
2024 Answer Set Explanations via Preferred Unit-Provable Unsatisfiable Subsets
Mario Alviano, Susana Hahn, Orkunt Sabuncu, Hannes Weichelt
LPNMR3
2024 Clingraph: A System for ASP-based Visualization
abstract
Abstract We present the Answer Set Programming (ASP)-based visualization tool clingraph, which aims at visualizing various concepts of ASP by means of ASP itself. This idea traces back to the aspviz tool and clingraph redevelops and extends it in the context of modern ASP systems. More precisely, clingraph takes graph specifications in terms of ASP facts and hands them over to the graph visualization system graphviz. The use of ASP provides a great interface between logic programs and/or answer sets and their visualization. Also, clingraph offers a Python application programming interface (API) that extends this ease of interfacing to clingo’s API and in turn to connect and monitor various aspects of the solving process.
Susana Hahn, Orkunt Sabuncu, Torsten Schaub, Tobias Stolzmann
Theory Pract. Log. Program.2
2022 Clingraph: ASP-Based Visualization
Susana Hahn, Orkunt Sabuncu, Torsten Schaub, Tobias Stolzmann
LPNMR2
2022 Multi-agent Pick and Delivery with Capacities: Action Planning Vs Path Finding
Nima Tajelipirbazari, Cagri Uluc Yildirimoglu, Orkunt Sabuncu, Ali Can Arici, Idil Helin Ozen, Volkan Patoglu, Esra Erdem 0001
PADL3
2018 Experimenting with robotic intra-logistics domains
abstract
Abstract We introduce theasprilo1framework to facilitate experimental studies of approaches addressing complex dynamic applications. For this purpose, we have chosen the domain of robotic intra-logistics. This domain is not only highly relevant in the context of today's fourth industrial revolution but it moreover combines a multitude of challenging issues within a single uniform framework. This includes multi-agent planning, reasoning about action, change, resources, strategies, etc. In return,aspriloallows users to study alternative solutions as regards effectiveness and scalability. Althoughasprilorelies on Answer Set Programming and Python, it is readily usable by any system complying with its fact-oriented interface format. This makes it attractive for benchmarking and teaching well beyond logic programming. More precisely,aspriloconsists of a versatile benchmark generator, solution checker and visualizer as well as a bunch of reference encodings featuring various ASP techniques. Importantly, the visualizer's animation capabilities are indispensable for complex scenarios like intra-logistics in order to inspect valid as well as invalid solution candidates. Also, it allows for graphically editing benchmark layouts that can be used as a basis for generating benchmark suites.
Martin Gebser, Philipp Obermeier, Thomas Otto, Torsten Schaub, Orkunt Sabuncu, Van Nguyen 0001, Tran Cao Son
Theory Pract. Log. Program.5
2017 moviola: Interpreting Dynamic Logic Programs via Multi-shot Answer Set Programming
Orkunt Sabuncu, João Leite 0001
LPNMR1
2016 Solving Goal Recognition Design Using ASP
abstract
Goal Recognition Design involves identifying the best ways to modify an underlying environment that agents operate in, typically by making asubset of feasible actions infeasible, so that agents are forced to reveal their goals as early as possible. Thus far, existing work has focused exclusively on imperative classical planning. In this paper, we address the same problem with a different paradigm, namely, declarative approaches based on Answer Set Programming (ASP). Our experimental results show that one of our ASP encodings is more scalable and is significantly faster by up to three orders of magnitude than thecurrent state of the art.
Tran Cao Son, Orkunt Sabuncu, Christian Schulz-Hanke, Torsten Schaub, William Yeoh 0001
AAAI2
2015 Integrating ASP into ROS for Reasoning in Robots
Benjamin Andres, David Rajaratnam, Orkunt Sabuncu, Torsten Schaub
LPNMR3
2013 Fostering Social Interaction of Home-Bound Elderly People: The EasyReach System
Roberto Bisiani, Davide Merico, Stefano Pinardi, Matteo Dominoni, Amedeo Cesta, Andrea Orlandini, Riccardo Rasconi, Marco Suriano, Alessandro Umbrico, Orkunt Sabuncu, Torsten Schaub, Daniela D'Aloisi, Raffaele Nicolussi, Filomena Papa, Vassilis Bouglas, Giannis Giakas, Thanassis Kavatzikidis, Silvio Bonfiglio
IEA/AIE10
2013 Evaluating Answer Set Clause Learning for General Game Playing
Timothy Joseph Cerexhe, Orkunt Sabuncu, Michael Thielscher
LPNMR2
2013 Matchmaking with Answer Set Programming
Martin Gebser, Thomas Glase, Orkunt Sabuncu, Torsten Schaub
LPNMR3
2013 Ricochet Robots: A Transverse ASP Benchmark
Martin Gebser, Holger Jost, Roland Kaminski, Philipp Obermeier, Orkunt Sabuncu, Torsten Schaub, Marius Lindauer
LPNMR5
2012 Stream Reasoning with Answer Set Programming: Preliminary Report
Martin Gebser, Torsten Grote, Roland Kaminski, Philipp Obermeier, Orkunt Sabuncu, Torsten Schaub
KR5
2012 An ontology-based retrieval system using semantic indexing
Soner Kara, Özgür Alan, Orkunt Sabuncu, Samet Akpinar, Nihan Kesim Cicekli, Ferda Nur Alpaslan
Inf. Syst.3
2011 Finite Model Computation via Answer Set Programming
abstract
We show how Finite Model Computation (FMC) of first-order theories can efficiently and transparentlybe solved by taking advantage of an extension of Answer Set Programming, called incremental Answer Set Programming (iASP). The idea is to use the incremental parameter in iASP programs to account for the domain size of a model. The FMC problem is then successively addressed for increasing domain sizes until an answer set, representing a finite model of the original first-order theory, is found. We developed a system based on the iASP solver iClingo and demonstrate its competitiveness.
Martin Gebser, Orkunt Sabuncu, Torsten Schaub
IJCAI2
2010 Event boundary detection using audio-visual features and web-casting texts with imprecise time information
abstract
We propose a method to detect events and event boundaries in soccer videos by using web-casting texts and audio-visual features. The events and their inaccurate time information given in web-casting texts need to be aligned with the visual content of the video. We overcome this issue by utilizing textual, visual and audio features. Existing methods assume that the time at which the event occurs is given precisely (in seconds). However, most web-casting texts presented by popular organizations such as uefa.com (the official site of Union of European Football Associations) provide the time information in minutes rather than seconds. We propose a robust method which is able to handle uncertainties in the time points of the events. As a result of our experiments, we claim that our method detects event boundaries satisfactorily for uncertain web-casting texts, and that the use of audio-visual features improves the performance of event boundary detection.
Mujdat Boyar, Özgür Alan, Samet Akpinar, Orkunt Sabuncu, Nihan Kesim Cicekli, Ferda Nur Alpaslan
ICME4
2010 An Incremental Answer Set Programming Based System for Finite ModelComputation
Martin Gebser, Orkunt Sabuncu, Torsten Schaub
JELIA2
2004 Using Criticalities as a Heuristic for Answer Set Programming
Orkunt Sabuncu, Ferda Nur Alpaslan, Varol Akman
LPNMR1