Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Consistency restoration and explanations in dynamic CSPs—application to configuration
J Amilhastre, H Fargier, P Marquis - Artificial Intelligence, 2002 - Elsevier
Most of the algorithms developed within the Constraint Satisfaction Problem (CSP)
framework cannot be used as such to solve interactive decision support problems, like …
framework cannot be used as such to solve interactive decision support problems, like …
[PDF][PDF] Arc consistency in SAT
IP Gent - ECAI, 2002 - academia.edu
I describe and study the 'support encoding'of binary constraint satisfaction problems (CSP's)
into boolean satisfiability (SAT). This is based on work by Kasif in 1990, in which clauses …
into boolean satisfiability (SAT). This is based on work by Kasif in 1990, in which clauses …
Parallel resolution of the satisfiability problem: A survey
D Singer - Parallel combinatorial optimization, 2006 - Wiley Online Library
The propositional Satisfiability problem (SAT) is one of the most studied in computer science
since it was the first problem proven to be NP-complete by Cook in 1971. Nowadays, the …
since it was the first problem proven to be NP-complete by Cook in 1971. Nowadays, the …
A comparison between SAT and CSP techniques
H Bennaceur - Constraints, 2004 - Springer
The aim of this paper is to establish a connection between the propositional logic and the
constraint based reasoning frameworks. This work is based on a translation of the …
constraint based reasoning frameworks. This work is based on a translation of the …
Tabu search vs. random walk
O Steinmann, A Strohmaier, T Stützlel - Annual Conference on Artificial …, 1997 - Springer
We investigate the benefit of Tabu Search for satisfiability (SAT) and constraint satisfaction
problems (CSP and compare it to the more frequently used random walk heuristic. We …
problems (CSP and compare it to the more frequently used random walk heuristic. We …
Optimal anytime constrained simulated annealing for constrained global optimization
In this paper we propose an optimal anytime version of constrained simulated annealing
(CSA) for solving constrained nonlinear programming problems (NLPs). One of the goals of …
(CSA) for solving constrained nonlinear programming problems (NLPs). One of the goals of …
Propagation in CSP and SAT
Y Dimopoulos, K Stergiou - … Conference on Principles and Practice of …, 2006 - Springer
Abstract Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks
widely used to represent and solve combinatorial problems. A concept of primary …
widely used to represent and solve combinatorial problems. A concept of primary …
Parallel resolution of the satisfiability problem (SAT) with OpenMP and MPI
D Singer, A Vagner - International Conference on Parallel Processing and …, 2005 - Springer
The past few years have seen enormous progress in the performance of propositional
satisfiability (SAT) solving, and consequently SAT solvers are widely used in industry for …
satisfiability (SAT) solving, and consequently SAT solvers are widely used in industry for …
Modeling and solving semiring constraint satisfaction problems by transformation to weighted semiring Max-SAT
We present a variant of the Weighted Maximum Satisfiability Problem (Weighted Max-SAT),
which is a modeling of the Semiring Constraint Satisfaction framework. We show how to …
which is a modeling of the Semiring Constraint Satisfaction framework. We show how to …