scientific article; zbMATH DE number 1149402
From MaRDI portal
Publication:4386920
zbMath0900.68179MaRDI QIDQ4386920
Publication date: 10 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
What we can learn from conflicts in propositional satisfiability, Min-domain retroactive ordering for asynchronous backtracking, MCS---a new algorithm for multicriteria optimisation in constraint programming, Dynamic ordering for asynchronous backtracking on DisCSPs, Computing and restoring global inverse consistency in interactive constraint satisfaction, Conflict-directed \(A^{*}\) and its role in model-based embedded systems, Random backtracking in backtrack search algorithms for satisfiability, The model evolution calculus as a first-order DPLL method, Heuristic-based backtracking relaxation for propositional satisfiability, Message delay and DisCSP search algorithms, Unnamed Item, Unnamed Item, Metaheuristics: A bibliography, Asynchronous forward-checking for DisCSPs, An empirical study of phase transitions in binary constraint satisfaction problems, The Relation Between Complete and Incomplete Search, A theoretical evaluation of selected backtracking algorithms., Achieving consistency with cutting planes, Learning from conflicts in propositional satisfiability, SAT problems with chains of dependent variables, On a reduction of the interval coloring problem to a series of bandwidth coloring problems, STR2: optimized simple tabular reduction for table constraints, MUST: Provide a Finer-Grained Explanation of Unsatisfiability, Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance, Combining metaheuristics with mathematical programming, constraint programming and machine learning, A CSP search algorithm with responsibility sets and kernels, Nogood-based asynchronous forward checking algorithms, Concurrent search for distributed CSPs, Between Restarts and Backjumps, About the choice of the variable to unassign in a decision repair algorithm, Generating Feasible Schedules for a Pick-up and Delivery Problem, Using an Incomplete Version of Dynamic Backtracking for Graph Colouring, Conflict analysis in mixed integer programming, Building decision procedures for modal logics from propositional decision procedures — The case study of modal K, Combining metaheuristics with mathematical programming, constraint programming and machine learning, A multi-level search strategy for the 0-1 multidimensional knapsack problem, Experiments with conflict analysis in mixed integer programming, A SAT approach to query optimization in mediator systems, A Flexible Search Framework for CHR, Adaptive CHR Meets CHR ∨, Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem, Computational aspects of infeasibility analysis in mixed integer programming, On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning, Backtracking algorithms for disjunctions of temporal constraints, Search algorithms in type theory, Conflict Analysis for MINLP, Reasoning from last conflict(s) in constraint programming, Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems, Explanation-based large neighborhood search, Backjump-based backtracking for constraint satisfaction problems, Local search with constraint propagation and conflict-based heuristics, Hybrid backtracking bounded by tree-decomposition of constraint networks, Efficient solution techniques for disjunctive temporal reasoning problems, Proving unsatisfiability of CNFs locally, Constraint solving in uncertain and dynamic environments: A survey
