A comparative runtime analysis of heuristic algorithms for satisfiability problems

, &
Artificial Intelligence 173 (2):240-257 (2009)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2008.11.002

Links

PhilArchive



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

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

MAX-SAT Problem using Hybrid Harmony Search Algorithm.Iyad Abu Doush, Amal Lutfi Quran, Mohammed Azmi Al-Betar & Mohammed A. Awadallah - 2018 - Journal of Intelligent Systems 27 (4):643-658.
Checking Validity of Quantifier-Free Formulas in Combinations of First-Order Theories.Clark Wayne Barrett - 2003 - Dissertation, Stanford University
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.
Combinatorial Analytic Tableaux.Robert Cowen - 1993 - Reports on Mathematical Logic:29-39.
Heuristic evaluation functions in artificial intelligence search algorithms.Richard E. Korf - 1995 - Minds and Machines 5 (4):489-498.
Generalized Davis-Putnam and satisfiability problems in mathematics.Robert Cowen - 2010 - Logic Journal of the IGPL 18 (3):456-463.
How experimental algorithmics can benefit from Mayo’s extensions to Neyman–Pearson theory of testing.Thomas Bartz-Beielstein - 2008 - Synthese 163 (3):385-396.
Hypergraph Satisfiability.R. Cowen - 1991 - Reports on Mathematical Logic.
Nature inspired algorithms for solving the community detection problem.Eslam Hussein, Ahmed Ibrahem Hafez, Aboul Ella Hassanien & Aly A. Fahmy - 2017 - Logic Journal of the IGPL 25 (6):902-914.
How experimental algorithmics can benefit from Mayo’s extensions to Neyman–Pearson theory of testing.Thomas Bartz-Beielstein - 2008 - Synthese 163 (3):385 - 396.
Efficient Algorithms for Mining Frequent Patterns from Sparse and Dense Databases.Gita Alaghband & Lan Vu - 2015 - Journal of Intelligent Systems 24 (2):181-197.
An overview of tableau algorithms for description logics.Franz Baader & Ulrike Sattler - 2001 - Studia Logica 69 (1):5-40.
The satisfiability problem.John Franco, Endre Boros & P. L. Hammer (eds.) - 1999 - New York: Elsevier.
Planning as satisfiability: parallel plans and algorithms for plan search.Jussi Rintanen, Keijo Heljanko & Ilkka Niemelä - 2006 - Artificial Intelligence 170 (12-13):1031-1080.
Two variable first-order logic over ordered domains.Martin Otto - 2001 - Journal of Symbolic Logic 66 (2):685-702.

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,283,306)

6 months
8 (#352,434)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references