On market-inspired approaches to propositional satisfiability

, , &
Artificial Intelligence 144 (1-2):125-156 (2003)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(02)00386-7

Links

PhilArchive



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

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

Hypergraph Satisfiability.R. Cowen - 1991 - Reports on Mathematical Logic.
Lewis Dichotomies in Many-Valued Logics.Simone Bova - 2012 - Studia Logica 100 (6):1271-1290.
Two notions of compactness in Gödel logics.Petr Cintula - 2005 - Studia Logica 81 (1):99-123.
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.
On the computational complexity of the numerically definite syllogistic and related logics.Ian Pratt-Hartmann - 2008 - Bulletin of Symbolic Logic 14 (1):1-28.
Complexity Results for Modal Dependence Logic.Peter Lohmann & Heribert Vollmer - 2013 - Studia Logica 101 (2):343-366.
Introduction to Mathematics of Satisfiability.Victor W. Marek - 2009 - Taylor & Francis.
Theory and applications of satisfiability testing: 7th international conference, SAT 2004, Vancouver, BC, Canada, May 10-13, 2004: revised selected papers.Holger H. Hoos & David G. Mitchell (eds.) - 2005 - New York: Springer.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
Satisfiability is False Intuitionistically: A Question from Dana Scott.Charles McCarty - 2020 - Studia Logica 108 (4):803-813.
Consequence Operations Based on Hypergraph Satisfiability.Kolany Adam - 1997 - Studia Logica 58 (2):261-272.
On α-satisfiability and its α-lock resolution in a finite lattice-valued propositional logic.Xingxing He, Jun Liu, Yang Xu, Luis Martínez & Da Ruan - 2012 - Logic Journal of the IGPL 20 (3):579-588.
Relaxing non-interference requirements in parallel plans.Miquel Bofill, Joan Espasa & Mateu Villaret - 2021 - Logic Journal of the IGPL 29 (1):45-71.
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
2020-12-22

Downloads
4 (#1,608,067)

6 months
3 (#987,746)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The distributed breakout algorithms.Katsutoshi Hirayama & Makoto Yokoo - 2005 - Artificial Intelligence 161 (1-2):89-115.

Add more citations

References found in this work

Refining the phase transition in combinatorial search.Tad Hogg - 1996 - Artificial Intelligence 81 (1-2):127-154.

Add more references