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

scientific article

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

zbMath1159.68567MaRDI QIDQ3604006

Knot Pipatsrisawat, Arthur Choi, Mark Chavira, Akop Palyan, Adnan Darwiche

Publication date: 24 February 2009


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

maximum satisfiability problemconstraint relaxationlower bound computation


Mathematics Subject Classification ID

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


Related Items (7)

Resolution-based lower bounds in MaxSAT ⋮ Boolean lexicographic optimization: algorithms \& applications ⋮ Incomplete inference for graph problems ⋮ A taxonomy of exact methods for partial Max-SAT ⋮ Curriculum-based course timetabling with SAT and MaxSAT ⋮ Algorithms for Weighted Boolean Optimization ⋮ Iterative and core-guided maxsat solving: a survey and assessment


Uses Software

  • MiniSat
  • Siege
  • Chaff






This page was built for publication:

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