Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Improvements to Core-Guided Binary Search for MaxSAT

From MaRDI portal
Publication:2843334
Jump to:navigation, search

DOI10.1007/978-3-642-31612-8_22zbMath1273.68357OpenAlexW1852879971MaRDI QIDQ2843334

Federico Heras, Antonio Morgado, João P. Marques-Silva

Publication date: 12 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10344/2771



Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)


Related Items (9)

Quantified maximum satisfiability ⋮ Advances in WASP ⋮ Exploiting Resolution-Based Representations for MaxSAT Solving ⋮ WPM3: an (in)complete algorithm for weighted partial MaxSAT ⋮ Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability ⋮ Exploiting subproblem optimization in SAT-based maxsat algorithms ⋮ \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT ⋮ On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving ⋮ Iterative and core-guided maxsat solving: a survey and assessment


Uses Software

  • Reveal
  • QMaxSAT
  • MiniMaxSat
  • MSUnCore





This page was built for publication: Improvements to Core-Guided Binary Search for MaxSAT

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2843334&oldid=15767603"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki