Propositional proof systems based on maximum satisfiability

, , , &
Artificial Intelligence 300 (C):103552 (2021)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2021.103552

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 97,297

External links

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

Through your library

My notes

Similar books and articles

Review: Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi, Minimum Propositional Proof Length Is NP-Hard to Linearly Approximate. [REVIEW]Alexander Razborov - 2002 - Bulletin of Symbolic Logic 8 (2):301-302.
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability.Zhao Xing & Weixiong Zhang - 2005 - Artificial Intelligence 164 (1-2):47-80.
On market-inspired approaches to propositional satisfiability.William E. Walsh, Makoto Yokoo, Katsutoshi Hirayama & Michael P. Wellman - 2003 - Artificial Intelligence 144 (1-2):125-156.
Propositional consistency proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.
Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss.Daniil Kozhemiachenko - 2018 - Journal of Applied Non-Classical Logics 28 (4):389-413.
Modelling and solving temporal reasoning as propositional satisfiability.Duc Nghia Pham, John Thornton & Abdul Sattar - 2008 - Artificial Intelligence 172 (15):1752-1782.
Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability.Shaowei Cai & Zhendong Lei - 2020 - Artificial Intelligence 287 (C):103354.
CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability.Chuan Luo, Shaowei Cai, Kaile Su & Wenxuan Huang - 2017 - Artificial Intelligence 243 (C):26-44.
Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability.Jeremias Berg & Matti Järvisalo - 2017 - Artificial Intelligence 244 (C):110-142.
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs.Miroslaw Truszczyński - 2010 - Artificial Intelligence 174 (16-17):1285-1306.

Analytics

Added to PP
2022-06-13

Downloads
21 (#853,170)

6 months
15 (#298,149)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Citations of this work

Polynomial calculus for optimization.Ilario Bonacina, Maria Luisa Bonet & Jordi Levy - 2024 - Artificial Intelligence 337 (C):104208.

Add more citations

References found in this work

A theory of diagnosis from first principles.Raymond Reiter - 1987 - Artificial Intelligence 32 (1):57-95.
SAT-based MaxSAT algorithms.Carlos Ansótegui, Maria Luisa Bonet & Jordi Levy - 2013 - Artificial Intelligence 196 (C):77-105.
Resolution for Max-SAT.María Luisa Bonet, Jordi Levy & Felip Manyà - 2007 - Artificial Intelligence 171 (8-9):606-618.

View all 10 references / Add more references