565 search results - page 8 / 113 » Heuristics for Planning with SAT |
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
APPROX
2004
Springer
14 years 1 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...
AAAI
1997
13 years 9 months ago
1997
One of the important components of a local search strategy for satisfiability testing is the variable selection heuristic, which determines the next variable to be flipped. In a...
AIA
2006
13 years 9 months ago
2006
Model-based diagnosis of technical systems requires both a simulation machinery and a logic calculus. The former is responsible for the system's behavior analysis, the latter...
CAEPIA
2005
Springer
14 years 1 months ago
2005
Springer
Conformant planning is a variation of classical AI planning where the initial state is partially known and actions can have nondeterministic effects. While a classical plan must a...