Symbolic Techniques for Formally Verified and Explainable AI

Status	Pågående
Gällande start-/slutdatum	01/01/2020 → 31/12/2022

Advanced Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving
Linsbichler, T., Maratea, M., Niskanen, A., Wallner, J. P. & Woltran, S., juni 2022, I: Artificial Intelligence. 307, 40 s., 103697.
Forskningsoutput: Tidskriftsbidrag › Artikel › Vetenskaplig › Peer review

Öppen tillgång
Fil
Incremental Maximum Satisfiability
Niskanen, A., Berg, J. & Järvisalo, M., 2022, (!!Accepted/In press) Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review
MaxSAT-Based Bi-Objective Boolean Optimization
Jabs, C. J., Berg, J., Niskanen, A. & Järvisalo, M., 2022, (!!Accepted/In press) Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022). Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review

Projektinformation