Matti Järvisalo
Zitiert von
Zitiert von
Inprocessing Rules
M Järvisalo, M Heule, A Biere
Proceedings of the 6th International Joint Conference on Automated Reasoning …, 2012
The International SAT Solver Competitions
M Järvisalo, D Le Berre, O Roussel, L Simon
AI Magazine 33 (1), 89-92, 2012
Blocked clause elimination
M Järvisalo, A Biere, M Heule
Tools and Algorithms for the Construction and Analysis of Systems: 16th …, 2010
Complexity-Sensitive Decision Procedures for Abstract Argumentation
W Dvorák, M Järvisalo, JP Wallner, S Woltran
Proceedings of the 13th International Conference on Principles of Knowledge …, 2012
Constraint-based Causal Discovery: Conflict Resolution with Answer Set Programming.
A Hyttinen, F Eberhardt, M Järvisalo
UAI, 340-349, 2014
SAT competition 2016: Recent developments
T Balyo, M Heule, M Jarvisalo
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
Discovering Cyclic Causal Models with Latent Variables: A General SAT-Based Procedure
A Hyttinen, PO Hoyer, F Eberhardt, M Jarvisalo
UAI, 2013
Clause elimination procedures for CNF formulas
M Heule, M Järvisalo, A Biere
Logic for Programming, Artificial Intelligence, and Reasoning: 17th …, 2010
Efficient CNF simplification based on binary implication graphs
M Heule, M Järvisalo, A Biere
Theory and Applications of Satisfiability Testing-SAT 2011, 201-215, 2011
Clause elimination for SAT and QSAT
M Heule, M Järvisalo, F Lonsing, M Seidl, A Biere
Journal of Artificial Intelligence Research 53, 127-168, 2015
LMHS: a SAT-IP hybrid MaxSAT solver
P Saikko, J Berg, M Järvisalo
Theory and Applications of Satisfiability Testing–SAT 2016: 19th …, 2016
Learning optimal bounded treewidth Bayesian networks via maximum satisfiability
J Berg, M Järvisalo, B Malone
Artificial Intelligence and Statistics, 86-95, 2014
Complexity results and algorithms for extension enforcement in abstract argumentation
JP Wallner, A Niskanen, M Järvisalo
Journal of Artificial Intelligence Research 60, 1-40, 2017
Simulating Circuit-Level Simplifications on CNF
M Järvisalo, A Biere, MJH Heule
Journal of Automated Reasoning 49 (4), 583-619, 2012
Weak models of distributed computing, with connections to modal logic
L Hella, M Järvisalo, A Kuusisto, J Laurinharju, T Lempiäinen, K Luosto, ...
Proceedings of the 2012 ACM Symposium on Principles of distributed computing …, 2012
Unrestricted vs restricted cut in a tableau method for Boolean circuits
M Järvisalo, T Junttila, I Niemelä
Annals of Mathematics and Artificial Intelligence 44 (4), 373-399, 2005
Harnessing constraint programming for poetry composition
J Toivanen, M Järvisalo, H Toivonen
The Fourth International Conference on Computational Creativity, 2013
Limitations of restricted branching in clause learning
M Järvisalo, T Junttila
Constraints 14, 325-356, 2009
Do-calculus when the True Graph Is Unknown.
A Hyttinen, F Eberhardt, M Järvisalo
UAI, 395-404, 2015
Overview and analysis of the SAT Challenge 2012 solver competition
A Balint, A Belov, M Järvisalo, C Sinz
Artificial Intelligence 223, 120-155, 2015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20