Resolution for Max-SAT

Artificial Intelligence 171 (8-9):606-618 (2007)

Abstract

This article has no associated abstract. (fix it)

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,879

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2020-12-22

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

References found in this work

No references found.

Add more references

Similar books and articles

SAT-Based MaxSAT Algorithms.Carlos Ansótegui, Maria Luisa Bonet & Jordi Levy - 2013 - Artificial Intelligence 196:77-105.
Pool Resolution is NP-Hard to Recognize.Samuel R. Buss - 2009 - Archive for Mathematical Logic 48 (8):793-798.
Degree Complexity for a Modified Pigeonhole Principle.Maria Luisa Bonet & Nicola Galesi - 2003 - Archive for Mathematical Logic 42 (5):403-414.
A Resolution Calculus for MinSAT.Chu-Min Li, Fan Xiao & Felip Manyà - 2021 - Logic Journal of the IGPL 29 (1):28-44.
The Complexity of Resolution Refinements.Joshua Buresh-Oppenheim & Toniann Pitassi - 2007 - Journal of Symbolic Logic 72 (4):1336 - 1352.
Split Resolution in Greek Dramatic Lyric.L. P. E. Parker - 1968 - Classical Quarterly 18 (2):241-269.
Group Cancellation and Resolution.Alessandra Carbone - 2006 - Studia Logica 82 (1):73-93.
Resolution-Based Methods for Modal Logics.H. de Nivelle, R. Schmidt & U. Hustadt - 2000 - Logic Journal of the IGPL 8 (3):265-292.
The Depth of Resolution Proofs.Alasdair Urquhart - 2011 - Studia Logica 99 (1-3):349-364.
Legitimacy and the Virtualization of Dispute Resolution.Laurens Mommers - 2005 - Artificial Intelligence and Law 13 (2):207-232.