( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing Smallest MUSes of Quantified Boolean Formulas.

, , , и . LPNMR, том 13416 из Lecture Notes in Computer Science, стр. 301-314. Springer, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Matti Järvisalo

Matti Adam

Katharina Matti

Matti Mantere

Matti Matilainen

 

Другие публикации лиц с тем же именем

MaxSAT-Based Cutting Planes for Learning Graphical Models., , и . CPAIOR, том 9075 из Lecture Notes in Computer Science, стр. 347-356. Springer, (2015)Preprocessing Argumentation Frameworks via Replacement Patterns., , , , и . JELIA, том 11468 из Lecture Notes in Computer Science, стр. 116-132. Springer, (2019)Learning Chordal Markov Networks via Stochastic Local Search., , и . ECAI, том 325 из Frontiers in Artificial Intelligence and Applications, стр. 2632-2639. IOS Press, (2020)SAT-based Judgment Aggregation., , и . AAMAS, стр. 1412-1420. ACM, (2023)Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper)., и . CP, том 210 из LIPIcs, стр. 8:1-8:11. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Refined Core Relaxation for Core-Guided MaxSAT Solving., , и . CP, том 210 из LIPIcs, стр. 28:1-28:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Certified MaxSAT Preprocessing., , , , , и . CoRR, (2024)Enumerating Potential Maximal Cliques via SAT and ASP., , и . IJCAI, стр. 1116-1122. ijcai.org, (2019)Controllability of Control Argumentation Frameworks., , и . IJCAI, стр. 1855-1861. ijcai.org, (2020)Scheduled for July 2020, Yokohama, Japan, postponed due to the Corona pandemic..Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability., , и . AISTATS, том 33 из JMLR Workshop and Conference Proceedings, стр. 86-95. JMLR.org, (2014)