Exploiting Resolution-Based Representations for MaxSAT Solving

DOI10.1007/978-3-319-24318-4_20zbMath1471.68257arXiv1505.02405OpenAlexW2210398979MaRDI QIDQ3453232

Ruben Martins, Miguel M. Neves, Mikoláš Janota, Inês Lynce, Vasco M. Manquinho

Publication date: 20 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.02405

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (1)

Generating SAT instances with community structure

Uses Software

• QMaxSAT
• Open-WBO
• PackUp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Curriculum-based course timetabling with SAT and MaxSAT
• On a generalization of extended resolution
• Iterative and core-guided maxsat solving: a survey and assessment
• Resolution graphs
• Improvements to Core-Guided Binary Search for MaxSAT
• The Community Structure of SAT Formulas
• Variable Independence and Resolution Paths for Quantified Boolean Formulas
• Open-WBO: A Modular MaxSAT Solver,
• Blocked Clause Elimination
• Community structure in social and biological networks
• Community-Based Partitioning for MaxSAT Solving
• On Solving the Partial MAX-SAT Problem
• Principles and Practice of Constraint Programming – CP 2003

This page was built for publication: Exploiting Resolution-Based Representations for MaxSAT Solving