NAVAS

From International Center for Computational Logic
Toggle side column

NAVAS

Navigation Approaches for Answer Sets

Due to the continuous development in recent years, a large number of demanding combinatorial search problems of enormous practical relevance can now be efficiently solved by Answer Set Programming (ASP). Depending on the scope of the problem to be solved, a "combinatorial explosion" of the number of solutions can occur very quickly. While modern ASP solvers can easily calculate several million solutions in a short time, this poses a new problem for the user: How should the enormous solution space be handled and made accessible? Typically, the Answer Sets are output in any order. However, many of these solutions are very similar. In practice, however, often only solutions are of interest that are sufficiently different from each other, that have special properties, or that are similar to a given set of solutions. Such features are not yet supported by ASP solvers. To enable an interactive and transparent navigation in ASP solution spaces the project NAVAS will deal with the following topics:

  1. Development of methods for interactive and transparent navigation in the Answer Set solution space;
  2. Implementation of the methods with efficient algorithms;
  3. Evaluation of the prototype on use cases from the areas of configuration and argumentation theory.

We are confident that the knowledge, developments and implementations achieved in NAVAS will make ASP technology more accessible to a wider audience. We see a particular immediate potential in the area of industrial applications, for example product configuration.

News:

First NAVAS Workshop in Vienna (23.-24.05.2022) [1]


Journal Articles

Nikolai Käfer, Christel Baier, Martin Diller, Clemens Dubslaff, Sarah Alice Gaggl, Holger Hermanns
Admissibility in Probabilistic Argumentation
Journal of Artificial Intelligence Research, to appear
Details
Sarah Alice Gaggl, Sebastian Rudolph, Hannes Straß
On the Decomposition of ADFs and the Complexity of Naive-based Semantics
Journal of Artificial Intelligence Research, 70:1-64, January 2021
Details Download

Proceedings Articles

Johannes Klaus Fichte, Sarah Alice Gaggl, Dominik Rusovac
Rushing and Strolling among Answer Sets - Navigation Made Easy
Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), to appear
Details
Sarah Alice Gaggl, Philipp Hanisch, Markus Krötzsch
Simulating Sets in Answer Set Programming
Proceedings of the 31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 2022), to appear
Details Download
Stefan Ellmauthaler, Sarah Alice Gaggl, Dominik Rusovac, Johannes P. Wallner
Representing Abstract Dialectical Frameworks with Binary Decision Diagrams
Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022), to appear
Details
Stefan Ellmauthaler, Sarah Alice Gaggl, Dominik Rusovac, Johannes P. Wallner
ADF - BDD : An ADF Solver Based on Binary Decision Diagrams
Proceedings of the 9th International Conference on Computational Models of Argument (COMMA 2022), to appear
Details
Sarah Alice Gaggl, Sebastian Rudolph, Hannes Straß
On the Decomposition of ADFs and the Complexity of Naive-based Semantics
IJCAI 2021 Journal Track, 2021
Details
Martin Diller, Sarah Alice Gaggl, Piotr Gorczyca
Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation
In Pietro Baroni, Christoph Benzmüller, Yì N. Wán, eds., Proceedings of the 4th International Conference on Logic and Argumentation (CLAR 2021), volume 13040 of LNCS, 147-168, 2021. Springer
Details Download
Christel Baier, Martin Diller, Clemens Dubslaff, Sarah Alice Gaggl, Holger Hermanns, Nikolai Käfer
Admissibility in Probabilistic Argumentation
In Meghyn Bienvenu, Gerhard Lakemeyer, Esra Erdem, eds., Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning (KR 2021), 87-98, November 2021
Details Download

Technical Reports

Johannes Klaus Fichte, Sarah Alice Gaggl, Dominik Rusovac
Rushing and Strolling among Answer Sets - Navigation Made Easy
Technical Report, arXiv.org, volume CoRR abs/2112.07596, December 2021
Details Download