Propositional proof systems based on maximum satisfiability

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

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 74,247

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

Propositional Consistency Proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.
The Complexity of Propositional Proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
The Complexity of Propositional Proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
Pool Resolution is NP-Hard to Recognize.Samuel R. Buss - 2009 - Archive for Mathematical Logic 48 (8):793-798.
Propositional Proof Compressions and DNF Logic.L. Gordeev, E. Haeusler & L. Pereira - 2011 - Logic Journal of the IGPL 19 (1):62-86.
Hypergraph Satisfiability.R. Cowen - 1991 - Reports on Mathematical Logic.

Analytics

Added to PP
2022-06-13

Downloads
2 (#1,392,759)

6 months
2 (#276,659)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Citations of this work

No citations found.

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