Critical behavior in the computational cost of satisfiability testing

&
Artificial Intelligence 81 (1-2):273-295 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(95)00056-9

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,168

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

Satisfiability testing for Boolean formulas using δ-trees.G. Gutiérrez, I. P. de Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.
A modal perspective on the computational complexity of attribute value grammar.Patrick Blackburn & Edith Spaan - 1993 - Journal of Logic, Language and Information 2 (2):129-169.
On the computational complexity of the numerically definite syllogistic and related logics.Ian Pratt-Hartmann - 2008 - Bulletin of Symbolic Logic 14 (1):1-28.
Satisfiability Testing for Boolean Formulas Using Δ-Trees.G. Gutiérrez, I. P. De Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde - 2002 - Studia Logica 72 (1):85 - 112.
Reversed Resolution in Reducing General Satisfiability Problem.Adam Kolany - 2010 - Studia Logica 95 (3):407-416.
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.
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.
Hypergraph Satisfiability.R. Cowen - 1991 - Reports on Mathematical Logic.
Theory and application of satisfiability testing - SAT 2011: 14th International Conference, SAT 2011, Ann Arbor, MI, USA, June 19-22, 2011: proceedings.Karem A. Sakallah & Laurent Simon (eds.) - 2011 - New York: Springer.
Consequence Operations Based on Hypergraph Satisfiability.Kolany Adam - 1997 - Studia Logica 58 (2):261-272.
Complexity Results for Modal Dependence Logic.Peter Lohmann & Heribert Vollmer - 2013 - Studia Logica 101 (2):343-366.
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.
How to Explain Miscomputation.Chris Tucker - 2018 - Philosophers' Imprint 18:1-17.
The evolved architecture of Hazard management: Risk detection reasoning and the motivational computation of threat magnitudes.John Tooby & Leda Cosmides - 2006 - Behavioral and Brain Sciences 29 (6):631-633.

Analytics

Added to PP
2020-12-22

Downloads
10 (#1,197,378)

6 months
8 (#367,748)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Algorithm portfolios.Carla P. Gomes & Bart Selman - 2001 - Artificial Intelligence 126 (1-2):43-62.
The TSP phase transition.Ian P. Gent & Toby Walsh - 1996 - Artificial Intelligence 88 (1-2):349-358.
Implicates and prime implicates in Random 3-SAT.Robert Schrag & James M. Crawford - 1996 - Artificial Intelligence 81 (1-2):199-222.

Add more citations

References found in this work

Add more references