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

Links

PhilArchive



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

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

Propositional consistency proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.
The deduction rule and linear and near-linear proof simulations.Maria Luisa Bonet & Samuel R. Buss - 1993 - Journal of Symbolic Logic 58 (2):688-709.
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.
On the correspondence between arithmetic theories and propositional proof systems – a survey.Olaf Beyersdorff - 2009 - Mathematical Logic Quarterly 55 (2):116-137.
Pool resolution is NP-hard to recognize.Samuel R. Buss - 2009 - Archive for Mathematical Logic 48 (8):793-798.
Combinatorics of first order structures and propositional proof systems.Jan Krajíček - 2004 - Archive for Mathematical Logic 43 (4):427-441.
On the computational complexity of the numerically definite syllogistic and related logics.Ian Pratt-Hartmann - 2008 - Bulletin of Symbolic Logic 14 (1):1-28.
Propositional proof systems, the consistency of first order theories and the complexity of computations.Jan Krajíček & Pavel Pudlák - 1989 - Journal of Symbolic Logic 54 (3):1063-1079.
On obdd-based algorithms and proof systems that dynamically change the order of variables.Dmitry Itsykson, Alexander Knop, Andrei Romashchenko & Dmitry Sokolov - 2020 - Journal of Symbolic Logic 85 (2):632-670.
Theory and applications of satisfiability testing: 8th international conference, SAT 2005, St Andrews, UK, June 19-23, 2005: proceedings.Fahiem Bacchus & Toby Walsh (eds.) - 2005 - New York: Springer.
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.
Consequence Operations Based on Hypergraph Satisfiability.Kolany Adam - 1997 - Studia Logica 58 (2):261-272.
PDL with intersection and converse: satisfiability and infinite-state model checking.Stefan Göller, Markus Lohrey & Carsten Lutz - 2009 - Journal of Symbolic Logic 74 (1):279-314.

Analytics

Added to PP
2022-06-13

Downloads
8 (#1,291,989)

6 months
5 (#638,139)

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