Publication:3429154
From MaRDI portal
zbMath1116.68083MaRDI QIDQ3429154
Publication date: 30 March 2007
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Shared aggregate sets in answer set programming, Reasoning with Uncertain and Inconsistent OWL Ontologies, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks*, Resizing cardinality constraints for MaxSAT, Merging Variables: One Technique of Search in Pseudo-Boolean Optimization, An experiment with satisfiability modulo SAT, Boolean lexicographic optimization: algorithms \& applications, Reformulation based MaxSat robustness, Mining top-\(k\) motifs with a SAT-based framework, Exploiting subproblem optimization in SAT-based maxsat algorithms, Efficient branch-and-bound algorithms for weighted MAX-2-SAT, Cardinality networks: a theoretical and empirical study, Haplotype inference with pseudo-Boolean optimization, The weighted grammar constraint, Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics, Solving satisfiability problems with preferences, Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models, KBO orientability, Non existence of some mixed Moore graphs of diameter 2 using SAT, Probabilistic satisfiability: algorithms with the presence and absence of a phase transition, Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques, An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints, Minimal sets on propositional formulae. Problems and reductions, WPM3: an (in)complete algorithm for weighted partial MaxSAT, Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency, Conflict-driven answer set solving: from theory to practice, \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT, Encoding cardinality constraints using multiway merge selection networks, Propagation via lazy clause generation, Computing AES related-key differential characteristics with constraint programming, A multiparametric view on answer set programming, On the hardness of solving edge matching puzzles as SAT or CSP problems, Iterative and core-guided maxsat solving: a survey and assessment, A logical approach to efficient Max-SAT solving, SAT solving for termination proofs with recursive path orders and dependency pairs, Formal methods for reasoning and uncertainty reduction in evidential grid maps, A Boolean satisfiability approach to the resource-constrained project scheduling problem, A 0-1 integer linear programming approach to schedule outages of nuclear power plants, Complete Boolean satisfiability solving algorithms based on local search, Delegatable Functional Signatures, Mitigating Multi-target Attacks in Hash-Based Signatures, Writing Declarative Specifications for Clauses, DRAT Proofs for XOR Reasoning, Applying Visible Strong Equivalence in Answer-Set Program Transformations, Improving the Normalization of Weight Rules in Answer Set Programs, Optimal Base Encodings for Pseudo-Boolean Constraints, BDDs for Pseudo-Boolean Constraints – Revisited, Propositional SAT Solving, The Automatic Detection of Token Structures and Invariants Using SAT Checking, Quantitative Logic Reasoning, Lower and Upper Bounds for Random Mimimum Satisfiability Problem, PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF, Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms, Towards Robust CNF Encodings of Cardinality Constraints, Cardinality Networks and Their Applications, New Encodings of Pseudo-Boolean Constraints into CNF, Algorithms for Weighted Boolean Optimization
Uses Software
