16 papers · ranked by Valyu relevance
Botond Molnár, Ferenc Molnár, Melinda Varga, Zoltán Toroczkai + 1 more
'Mária Ercsey-Ravasz'] Many real-life optimization problems can be formulated in Boolean logic as MaxSAT, a class of problems where the task is finding Boolean assignments to variables satisfying the maximum number of logical constraints. Since MaxSAT is NP-hard, no algorithm is known to efficiently solve these…
Jialu Zhang, Chu-Min Li, Mohamed Sami Cherif, Shuolin Li + 1 more
—The Maximum Satisfiability problem (MaxSAT) is a major optimization challenge with numerous practical applications. In recent MaxSAT evaluations, most MaxSAT solvers have incorporated an Integer Linear Programming (ILP) solver into their portfolios. However, a good portfolio strategy requires a lot of tuning work and…
Zaijun Zhang, Jincheng Zhou, Xiaoxia Wang, Heng Yang + 10 more
'Marcin Sosnowski' 'Jaroslaw Krzywanski' 'Karolina Grabowska' 'Dorian Skrobek' 'Ghulam Moeen Uddin' 'Yunfei Gao' 'Anna Zylka' 'Anna Kulakowska' 'Bachil El Fil'] The (weighted) partial maximum satisfiability ((W)PMS) problem is an important generalization of the classic problem of propositional (Boolean) satisfiability…
Anastasios Kyrillidis, Moshe Y. Vardi, Zhiwei Zhang
Boolean MaxSAT, as well as generalized formulations such as Min-MaxSAT and Max-hybrid-SAT, are fundamental optimization problems in Boolean reasoning. Existing methods for MaxSAT have been successful in solving benchmarks in CNF format. They lack, however, the ability to handle 1) (non-CNF) hybrid constraints, such as…
Ruben Martins, Saurabh Joshi, Vasco Manquinho, Inês Lynce
Maximum Satisfiability (MaxSAT) is an optimization variant of the Boolean Satisfiability (SAT) problem. In general, MaxSAT algorithms perform a succession of SAT solver calls to reach an optimum solution making extensive use of cardinality constraints. Many of these algorithms are non-incremental in nature, i.e. at…
Jiongzhi Zheng, Zhuo Chen, Chu-Min Li, Kun He
MaxSAT is an optimization version of the famous NP-complete Satisfiability problem (SAT). Algorithms for MaxSAT mainly include complete solvers and local search incomplete solvers. In many complete solvers, once a better solution is found, a Soft conflict Pseudo Boolean (SPB) constraint will be generated to enforce the…
Carlos Ansótegui, Felip Manyà, Jesus Ojeda, Josep M. Salvia + 1 more
'Eduard Torres'] We present a Satisfiability (SAT)-based approach for building Mixed Covering Arrays with Constraints of minimum length, referred to as the Covering Array Number problem. This problem is central in Combinatorial Testing for the detection of system failures. In particular, we show how to apply Maximum…
Josep Alòs, Carlos Ansótegui, Josep M. Salvia, Eduard Torres
In this paper, we describe how we can effectively exploit alternative parameter configurations to a MaxSAT solver. We describe how these configurations can be computed in the context of MaxSAT. In particular, we experimentally show how to easily combine configurations of a non-competitive solver to obtain a better…
Emir Demirović, Nysret Musliu, Felix Winter
Employee scheduling is a well known problem that appears in a wide range of different areas including health care, air lines, transportation services, and basically any organization that has to deal with workforces. In this paper we model a collection of challenging staff scheduling instances as a weighted partial…
Minghao Liu, Fuqi Jia, Pei Huang, Fan Zhang + 4 more
'Shaowei Cai' 'Feifei Ma' 'Jian Zhang'] With the rapid development of deep learning techniques, various recent work has tried to apply graph neural networks (GNNs) to solve NP-hard problems such as Boolean Satisfiability (SAT), which shows the potential in bridging the gap between machine learning and symbolic…
Ole Lübke
Recently, a novel, MaxSAT-based method for error correction in quantum computing has been proposed that requires both incremental MaxSAT solving capabilities and support for XOR constraints, but no dedicated MaxSAT solver fulfilling these criteria existed yet. We alleviate that and introduce IGMaxHS, which is based on…
Niko Pinter, Damian Glätzer, Matthias Fahrner, Klemens Fröhlich + 6 more
Quantitative mass spectrometry-based proteomics has become a high-throughput technology for the identification and quantification of thousands of proteins in complex biological samples. Two de facto standard tools, MaxQuant and MSstats, allow for the analysis of raw data and finding proteins with differential abundance…
Petra Gutenbrunner, Pelagia Kyriakidou, Frido Welker, Jürgen Cox
We describe MaxNovo, a novel spectrum graph-based peptide de-novo sequencing algorithm integrated into the MaxQuant software. It identifies complete sequences of peptides as well as sequence tags that are incomplete at one or both of the peptide termini. MaxNovo searches for the highest-scoring path in a directed…
Huixia Lu, Jordi Marti, Jordi Faraudo
The MAX protein is a key transcriptional regulator that partners with the c-MYC oncoprotein and other members of the MYC/MAX/MAD network to control genes involved in fundamental cellular processes such as growth, differentiation, metabolism, and apoptosis. The transcriptional and tumorigenic activities of MYC mainly…
Sukhdeep Singh, Marco Y. Hein, A. Francis Stewart
We introduce msVolcano, a web application, for the visualization of label-free mass spectrometric data. It is optimized for the output of the MaxQuant data analysis pipeline of interactomics experiments and generates volcano plots with lists of interacting proteins. The user can optimize the cutoff values to find…
Mellisa Xie, Skye Comstra, Casey Schmidt, Lauren Hodkinson + 1 more
The histone locus body (HLB) is a conserved nuclear body that regulates histone mRNA production in metazoans. While some HLB components are known, there are likely uncharacterized factors that target the histone locus. We identified the Drosophila melanogaster protein Max, which interacts with known HLB member Myc, as…