NAVAS
NAVAS
Research group
People
- Contact Sarah Alice Gaggl
- Authors Sarah Alice Gaggl
- 2020 – 2024
- funded by BMBF; 1.268.842,48 €
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:
- Development of methods for interactive and transparent navigation in the Answer Set solution space;
- Implementation of the methods with efficient algorithms;
- 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:
[1] First NAVAS Workshop in Vienna (23.-24.05.2022)
[2] Honorable Mention at LPNMR 2022
Journal Articles
IASCAR: Incremental Answer Set Counting by Anytime Refinement
Theory and Practice of Logic Programming, 1-28, February 2024
Details Download
Admissibility in Probabilistic Argumentation
Journal of Artificial Intelligence Research, 74:957-1004, June 2022
Details Download
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
To Lead or to be Led: A Generalized Condorcet Jury Theorem under Dependence
AAMAS '24: Proceedings of the 2024 International Conference on Autonomous Agents and Multiagent Systems, 2024
Details Download
Winning Snake: Design Choices in Multi-Shot ASP
Proceedings of the 40th International Conference on Logic Programming (ICLP 2024), to appear
Details Download
Navigating and Querying Answer Sets: How Hard Is It Really and Why?
Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning (KR 2024), to appear
Details
Representative Answer Sets: Collecting Something of Everything
In Kobi Gal, Ann Nowé, Grzegorz J. Nalepa, Roy Fairstein, Roxana Radulescu, eds., Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023), 271--278, September 2023. IOS Press
Details Download
Tunas - Fishing for Diverse Answer Sets: A Multi-Shot Trade up Strategy
In Georg Gottlob, Daniela Inclezan, Marco Maratea, eds., Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022), volume 13416 of Lecture Notes in Computer Science, 89-102, August 2022. Springer International Publishing
Details Download
Rushing and Strolling among Answer Sets - Navigation Made Easy
Proceedings of the 36th AAAI Conference on Artificial Intelligence (AAAI 2022), volume 36 of 5, 5651-5659, June 2022
Details Download
IASCAR: Incremental Answer Set Counting by Anytime Refinement
In Georg Gottlob, Daniela Inclezan, Marco Maratea, eds., Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022), volume 13416 of Lecture Notes in Computer Science, 217-230, August 2022. Springer International Publishing
Details Download
Simulating Sets in Answer Set Programming
In Luc De Raedt, eds., Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI 2022), 2634--2640, 2022. ijcai.org
Details Download
Rushing and Strolling among Answer Sets – Navigation Made Easy (Extended Abstract)
In Yuliya Lierler, Jose F. Morales, Carmine Dodaro, Veronica Dahl, Martin Gebser, Tuncay Tekle, eds., Technical Communication Proceeding of the 38th International Conference on Logic Programming (ICLP 2022), volume 364 of EPTCS, 181-184, 2022. Open Publishing Association
Details
NEXAS: A Visual Tool for Navigating and Exploring Argumentation Solution Spaces
In Francesca Toni, eds., Proceedings of the 9th International Conference on Computational Models of Argument (COMMA 2022), volume 220146 of FAIA, 116-127, September 2022. IOS Press
Details Download
A Practical Account into Counting Dung’s Extensions by Dynamic Programming
In Georg Gottlob, Daniela Inclezan, Marco Maratea, eds., Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022), volume 13416 of Lecture Notes in Computer Science, 387-400, 2022. Springer
Details
Representing Abstract Dialectical Frameworks with Binary Decision Diagrams
In G. Gottlob, D Inclezan, M. Maratea, eds., Proceedings of the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022), volume 13416 of Lecture Notes in Computer Science, 177-198, 2022. Springer
Details Download
Strategies in Flexible Dispute Derivations for Assumption-Based Argumentation
In Sarah A. Gaggl, Jean-Guy Mailly, Matthias Thimm, Johannes P. Wallner, eds., Proceedings of the 4th International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2022), volume 3236, 59-72, October 2022. CEUR-WS
Details Download
ADF - BDD : An ADF Solver Based on Binary Decision Diagrams
In Francesca Toni, eds., Proceedings of the 9th International Conference on Computational Models of Argument (COMMA 2022), volume 220146 of FAIA, 355-356, September 2022. IOS Press
Details Download
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
On the Decomposition of ADFs and the Complexity of Naive-based Semantics
IJCAI 2021 Journal Track, 2021
Details
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
Edited Proceedings
Proceedings 39th International Conference on Logic Programming
Volume 385, September 2023. Open Publishing Association
Details
Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings
Volume 14281 of Lecture Notes in Computer Science, September 2023. Springer
Details
The Fourth International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2022)
Volume 3236, October 2022. CEUR-WS
Details
Technical Reports
Winning Snake: Design Choices in Multi-Shot ASP
Technical Report, arXiv.org, volume arXiv:2408.08150, August 2024. To appear in Theory and Practice of Logic Programming (TPLP), Proceedings of ICLP 2024
Details Download
IASCAR: Incremental Answer Set Counting by Anytime Refinement
Technical Report, arXiv.org, volume arXiv:2311.07233, November 2023. Under consideration in Theory and Practice of Logic Programming (TPLP)
Details Download
Rushing and Strolling among Answer Sets - Navigation Made Easy
Technical Report, arXiv.org, volume CoRR abs/2112.07596, December 2021
Details Download
Talks and Miscellaneous
flexABle – System Description for ICCMA 2023
System description for ICCMA 2023, 2023
Details Download
Rushing and Strolling among Answer Sets - Navigation Made Easy
International Workshop on Counting and Sampling in Haifa, Israel at FLoC 2022, August 2022
Details
Rushing and Strolling among Answer Sets - Navigation Made Easy (Extended Abstract)
KR Recently Published Research Track (KR 2022), August 2022
Details
Scalable Understanding: Navigation Approaches for Answer Sets
Invited talk at the Artificial Intelligence Group (AIG) at the FernUnversität in Hagen, October 2022
Details
Answer Set Navigation: Probleme Besser Verstehen
Invited talk at Security Networks AG Dresden (remotely held), May 2022
Details