WPM3: An (in)complete algorithm for weighted partial MaxSAT

Artificial Intelligence 250 (C):37-57 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,783

External links

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

Through your library

Similar books and articles

A resolution calculus for MinSAT.Chu-Min Li, Fan Xiao & Felip Manyà - 2021 - Logic Journal of the IGPL 29 (1):28-44.
SAT-based MaxSAT algorithms.Carlos Ansótegui, Maria Luisa Bonet & Jordi Levy - 2013 - Artificial Intelligence 196 (C):77-105.
Partial monotonic protothetics.François Lepage - 2000 - Studia Logica 66 (1):147-163.
Strong reducibility of partial numberings.Dieter Spreen - 2005 - Archive for Mathematical Logic 44 (2):209-217.
Natural boundary value problems for weighted form Laplacians.Wojciech Kozłowski & Antoni Pierzchalski - 2008 - Annali della Scuola Normale Superiore di Pisa- Classe di Scienze 7 (2):343-367.

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,315,307)

6 months
4 (#783,478)

Historical graph of downloads
How can I increase my downloads?