Results 141 to 150 of about 18,622 (181)
A Dichotomy Theorem for Maximum Generalized Satisfiability Problems
Journal of Computer and System Sciences, 1995 AbstractWe study the complexity of an infinite class of optimization satisfiability problems. Each problem is represented through a finite set, S, of logical relations (generalizing the notion of clauses of bounded length). We prove the existence of a dichotomic classification for optimization satisfiability problems Max-Sat(S). We exhibit a particular
Nadia Creignou
openalex +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the complexity of the maximum satisfiability problem for horn formulas
Information Processing Letters, 1987Some results concerning the corresponding complexity of algorithms which check the partial consistency of logic databases are presented. It is proved that even when some quite strong restrictions are imposed, the maximum satisfiability (MAX-SAT) problem for Horn formulas is NP- complete.
Brigitte Jaumard
exaly +3 more sources
A Hybrid Genetic Algorithm for the Maximum Satisfiability Problem
, 2013 The satisfiability problem is the first problem proved to be NP-complete and has been one of the core NP-complete problems since then. It has many applications in many fields such as artificial intelligence, circuit design and VLSI testing. The maximum satisfiability problem is an optimization version of the satisfiablity problem, which is a decision ...
Lin‐Yu Tseng, Yo-An Lin
openalex +2 more sources
Approximation algorithms for the maximum satisfiability problem
, 1996 Summary: The maximum satisfiability problem (MAX SAT) is the following: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we present approximation algorithms for MAX SAT, including a 0.76544-approximation algorithm.
Takao Asano, Takao Ono, Tomio Hirata
openalex +3 more sources
Probabilistic estimates for the generalized maximum satisfiability problem
Discrete Applied Mathematics, 1994 As a random instance of the generalized maximum satisfiability problem (GMAXSAT), the author studies certain properties of a random binomial partite hypergraph. The methodology used is that of the first and second moment method. Numerical data are also supplied.
M. Cochand
openalex +2 more sources
A fixed point operator for the generalised maximum satisfiability problem
Discrete Applied Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Cochand
openalex +3 more sources
A neural circuit for the maximum 2-satisfiability problem
Proceedings Euromicro Workshop on Parallel and Distributed Processing, 2002 In this paper we discuss a uniform family of circuits, realizing neural networks to solve approximately the maximum 2-satisfiability problem. An implementation on FPGA for the problem instances of 16 variables and 480 clauses is presented. The circuit shows a good performance solving problem instances in 20 /spl mu/s with relative error less than 0.003.
Maria Alberta Alberti +4 more
openalex +3 more sources
Randomness in heuristics: An experimental investigation for the maximum satisfiability problem
, 1999 Summary: A genetic algorithm and a tabu search are investigated for the maximum satisfiability problem. When the evolutionary algorithm is hybridized with the randomized procedure G-bit, better performance is achieved and it even outperforms the well known probabilistic procedure GSAT.
Habiba Drias
openalex +3 more sources
Modified extremal optimization for the hard maximum satisfiability problem
Journal of Zhejiang University: Science C, 2011Based on our recent study on probability distributions for evolution in extremal optimization (EO), we propose a modified framework called EOSAT to approximate ground states of the hard maximum satisfiability (MAXSAT) problem, a generalized version of the satisfiability (SAT) problem.
Guo-Qiang Zeng, Weijie Mao
exaly +2 more sources