scientific article
From MaRDI portal
Publication:3489523
zbMath0707.68096MaRDI QIDQ3489523
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A kind of logical compilation for knowledge bases, Problem solving by searching for models with a theorem prover, Local consistency in parallel constraint satisfaction networks, Using OBDDs to handle dynamic constraints, aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming, Exploiting the deep structure of constraint problems, Compiling finite linear CSP into SAT, \textsc{Conjure}: automatic generation of constraint models from problem specifications, Underconstrained knowledge-intensive constraint satisfaction search, Structure-driven algorithms for truth maintenance, Learning to select SAT encodings for pseudo-Boolean and linear Integer constraints, Dealing with satisfiability and \(n\)-ary CSPs in a logical framework, MUST: Provide a Finer-Grained Explanation of Unsatisfiability, Linear resolution for consequence finding, Scheduling with neural networks -- the case of the Hubble Space Telescope, The logic of constraint satisfaction, On the relations between SAT and CSP enumerative algorithms, The approximation of implicates and explanations, Local search with constraint propagation and conflict-based heuristics
