A randomized algorithm for solving the satisfiability problem

In spite of the NP-completeness of the satisfiability decision problem (SAT problem), many researchers have been attracted by it because SAT has many applications in Artificial Intelligence. This paper presents a randomized David-Putnam based algorithm (RSAT) which solves this problem. Instead of se...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Cecchi, Laura
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	1997
Materias:	Ciencias Informáticas complete problems NP Satisfiability problem ARTIFICIAL INTELLIGENCE Algorithms
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/24079
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Evolutionary algorithms to solve the school timetabling problem
por: Fernandez, Natalia, et al.
Publicado: (2002)

Hybrid evolutionary algorithms to solve scheduling problems
por: Minetti, Gabriela F., et al.
Publicado: (2002)

Evolutionary algorithms whit studs and random immigrants to solve E/T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2001)

Algorithms to solve the dynamic weighted tardiness problem
por: Lasso, Marta Graciela, et al.
Publicado: (2002)

Adding problem-specific knowledge in evolutionary algorithms to solve W-T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2002)

NP-completeness results for edge modification problems
por: Burzyn, P., et al.
Publicado: (2006)

NP-completeness results for edge modification problems
por: Burzyn, P., et al.

NP-completeness results for edge modification problems
por: Burzyn, P., et al.
Publicado: (2006)

NP-completeness results for edge modification problems
por: Burzyn, Pablo, et al.
Publicado: (2006)

Studs and immigrants in multirecombined evolutionary algorithm to face weighted tardiness scheduling problems
por: Pandolfi, Daniel, et al.
Publicado: (2001)

Cellular memetic algorithms evaluated on SAT
por: Alba Torres, Enrique, et al.
Publicado: (2005)

Theory of problem solving ; an approach to artificial intelligence /
por: Banerji, Ranan B., 1928-
Publicado: (1969)

A study of genotype and phenotype distributions in hybrid evolutionary algorithms to solve the flow shop scheduling problem
por: Minetti, Gabriela F., et al.
Publicado: (2002)

Inserting problem-specific knowledge in multirecombined evolutionary algorithms
por: Pandolfi, Daniel, et al.
Publicado: (2002)

An algorithm to deal with due date violation in a multi-objective scheduling problem
por: Ibáñez, Francisco S., et al.
Publicado: (2003)

Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001)

Tractable reasoning problems with fully-characterized association rules
por: Minuto Espil, M.

Tractable reasoning problems with fully-characterized association rules
Publicado: (2012)

Clique-critical graphs: Maximum size and recognition
por: Alcón, Liliana Graciela
Publicado: (2006)

A self-adaptive recombination method in evolutionary algorithms for solving epistatic problems
por: Stark, Natalia, et al.
Publicado: (2011)

An immune artificial algorithm for dynamic optimization problems: a case of study
por: Aragón, Victoria S., et al.
Publicado: (2009)

Incest prevention and multicore combinated evolutionary algorithms for the job shop scheduling problem
por: Salto, Carolina, et al.
Publicado: (2001)

The complexity of clique graph recognition
por: Alcón, Liliana Graciela, et al.
Publicado: (2009)

Coupling REPMAC with FDA to solve highly imbalanced classification problems
por: Ahumada, Hernán César, et al.
Publicado: (2008)

Adaptability of multirecombinated evolutionary algorithms to changing common due dates
por: Pandolfi, Daniel, et al.
Publicado: (2001)

Alternative representations and multirecombined approaches for solving the single-machine common due date problem
por: Villagra, Andrea, et al.
Publicado: (2001)

A T-cell algorithm for solving dynamic economic power dispatch problems
por: Aragón, Victoria S., et al.
Publicado: (2020)

Cellular memetic algorithms
por: Alba Torres, Enrique, et al.
Publicado: (2005)

Solving unrestricted parallel machine scheduling problems via evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2003)

Immune algorithm for solving the smooth economic dispatch problem
por: Aragón, Victoria S., et al.
Publicado: (2015)

Solving the two dimensional cutting problem using evolutionary algorithms with penalty functions
por: Beraudo, Vanina, et al.
Publicado: (2005)

Different evolutionary approaches to solve the flow shop scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001)

Solving the flow shop scheduling problem under evolutionary approaches
por: Vilanova, Gabriela, et al.
Publicado: (2001)

Incorporating tabu search for local search into evolutionary algorithms to solve the job shop scheduling problem
por: Fernandez, Natalia, et al.
Publicado: (2001)

Immune algorithm for solving the smooth economic dispatch problem
por: Aragón, Victoria S., et al.
Publicado: (2015)

An O*(1.1939n) time algorithm for minimum weighted dominating induced matching
por: Lin, M.C., et al.

An O*(1.1939n) time algorithm for minimum weighted dominating induced matching
Publicado: (2013)

Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2002)

Using different chromosome representations for the JSS problem
por: Salto, Carolina, et al.
Publicado: (2001)

Multiobjetive optimization co-evolution for the job shop scheduling problem
por: Esquivel, Susana Cecilia, et al.
Publicado: (1999)