default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatti Järvisalo
- > Home > Persons > Matti Järvisalo
Publications
- 2024
[j33]Hannes Ihalainen, Jeremias Berg, Matti Järvisalo:
Unifying SAT-Based Approaches to Maximum Satisfiability Solving. J. Artif. Intell. Res. 80: 931-976 (2024)- [j32]Christoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Järvisalo:
From Single-Objective to Bi-Objective Maximum Satisfiability Solving. J. Artif. Intell. Res. 80: 1223-1269 (2024) - [c110]Christoph Jabs
, Jeremias Berg, Matti Järvisalo:
Core Boosting in SAT-Based Multi-objective Optimization. CPAIOR (2) 2024: 1-19 - [c109]Hannes Ihalainen, Andy Oertel, Yong Kiam Tan, Jeremias Berg, Matti Järvisalo, Magnus O. Myreen, Jakob Nordström:
Certified MaxSAT Preprocessing. IJCAR (1) 2024: 396-418 - [i15]Hannes Ihalainen, Andy Oertel, Yong Kiam Tan, Jeremias Berg, Matti Järvisalo, Jakob Nordström:
Certified MaxSAT Preprocessing. CoRR abs/2404.17316 (2024) - 2023
- [c107]Christoph Jabs, Jeremias Berg, Hannes Ihalainen, Matti Järvisalo:
Preprocessing in SAT-Based Multi-Objective Combinatorial Optimization. CP 2023: 18:1-18:20 - [c106]Markus Iser, Jeremias Berg, Matti Järvisalo:
Oracle-Based Local Search for Pseudo-Boolean Optimization. ECAI 2023: 1124-1131 - [c104]Hannes Ihalainen, Jeremias Berg, Matti Järvisalo:
Unifying Core-Guided and Implicit Hitting Set Based Optimization. IJCAI 2023: 1935-1943 - 2022
- [c100]Hannes Ihalainen, Jeremias Berg, Matti Järvisalo:
Clause Redundancy and Preprocessing in Maximum Satisfiability. IJCAR 2022: 75-94 - [c97]Andreas Niskanen, Jere Mustonen, Jeremias Berg, Matti Järvisalo:
Computing Smallest MUSes of Quantified Boolean Formulas. LPNMR 2022: 301-314 - [c96]Christoph Jabs, Jeremias Berg, Andreas Niskanen, Matti Järvisalo:
MaxSAT-Based Bi-Objective Boolean Optimization. SAT 2022: 12:1-12:23 - [c95]Pavel Smirnov, Jeremias Berg, Matti Järvisalo:
Improvements to the Implicit Hitting Set Approach to Pseudo-Boolean Optimization. SAT 2022: 13:1-13:18 - [c94]Andreas Niskanen, Jeremias Berg, Matti Järvisalo:
Incremental Maximum Satisfiability. SAT 2022: 14:1-14:19 - 2021
- [c92]Hannes Ihalainen, Jeremias Berg, Matti Järvisalo:
Refined Core Relaxation for Core-Guided MaxSAT Solving. CP 2021: 28:1-28:19 - [c91]Andreas Niskanen, Jeremias Berg, Matti Järvisalo:
Enabling Incrementality in the Implicit Hitting Set Approach to MaxSAT Under Changing Weights. CP 2021: 44:1-44:19 - [c90]Pavel Smirnov, Jeremias Berg, Matti Järvisalo:
Pseudo-Boolean Optimization by Implicit Hitting Sets. CP 2021: 51:1-51:20 - 2020
- [c86]Marcus Leivo, Jeremias Berg, Matti Järvisalo:
Preprocessing in Incomplete MaxSAT Solving. ECAI 2020: 347-354 - 2019
- [j24]Tuukka Korhonen, Jeremias Berg, Matti Järvisalo:
Solving Graph Problems via Potential Maximal Cliques: An Experimental Evaluation of the Bouchitté-Todinca Algorithm. ACM J. Exp. Algorithmics 24(1): 1.9:1-1.9:19 (2019) - [c74]Tuukka Korhonen, Jeremias Berg, Matti Järvisalo:
Enumerating Potential Maximal Cliques via SAT and ASP. IJCAI 2019: 1116-1122 - [c72]Jeremias Berg, Matti Järvisalo:
Unifying Reasoning and Core-Guided Search for Maximum Satisfiability. JELIA 2019: 287-303 - 2018
- [c63]Jeremias Berg, Antti Hyttinen, Matti Järvisalo:
Applications of MaxSAT in Data Analysis. POS@SAT 2018: 50-64 - 2017
- [j19]Jeremias Berg, Matti Järvisalo:
Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability. Artif. Intell. 244: 110-142 (2017) - [c61]Jeremias Berg, Emilia Oikarinen, Matti Järvisalo, Kai Puolamäki:
Minimum-Width Confidence Bands via Constraint Optimization. CP 2017: 443-459 - [c59]Jeremias Berg, Matti Järvisalo:
Weight-Aware Core Extraction in SAT-Based MaxSAT Solving. CP 2017: 652-670 - [c52]Tuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Järvisalo:
MaxPre: An Extended MaxSAT Preprocessor. SAT 2017: 449-456 - 2016
- [c50]Jeremias Berg, Matti Järvisalo:
Impact of SAT-Based Preprocessing on Core-Guided MaxSAT Solving. CP 2016: 66-85 - [c48]Jeremias Berg, Paul Saikko, Matti Järvisalo:
Subsumed Label Elimination for Maximum Satisfiability. ECAI 2016: 630-638 - [c42]Paul Saikko, Jeremias Berg, Matti Järvisalo:
LMHS: A SAT-IP Hybrid MaxSAT Solver. SAT 2016: 539-546 - 2015
- [c40]Jeremias Berg, Paul Saikko, Matti Järvisalo:
Re-using Auxiliary Variables for MaxSAT Preprocessing. ICTAI 2015: 813-820 - [c39]Jeremias Berg, Paul Saikko, Matti Järvisalo:
Improving the Effectiveness of SAT-Based Preprocessing for MaxSAT. IJCAI 2015: 239-245 - 2014
- [c34]Kerstin Bunte, Matti Järvisalo, Jeremias Berg, Petri Myllymäki, Jaakko Peltonen, Samuel Kaski:
Optimal Neighborhood Preserving Visualization by Maximum Satisfiability. AAAI 2014: 1694-1700 - [c32]Jeremias Berg, Matti Järvisalo, Brandon M. Malone:
Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability. AISTATS 2014: 86-95 - [c31]Jeremias Berg, Matti Järvisalo:
SAT-Based Approaches to Treewidth Computation: An Evaluation. ICTAI 2014: 328-335 - 2013
- [c25]Jeremias Berg, Matti Järvisalo:
Optimal Correlation Clustering via MaxSAT. ICDM Workshops 2013: 750-757
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 19:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
