scientific article; zbMATH DE number 5139167
From MaRDI portal
Publication:3429161
zbMATH Open1116.68090MaRDI QIDQ3429161FDOQ3429161
Authors: Hossein M. Sheini, Karem A. Sakallah 
Publication date: 30 March 2007
Title of this publication is not available (Why is that?)
Recommendations
- PURL: a new polynomial-time solvable class of satisfiability
- scientific article; zbMATH DE number 5139165
- scientific article; zbMATH DE number 5139168
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
- scientific article; zbMATH DE number 1903342
- scientific article; zbMATH DE number 2090309
- Theory and Applications of Satisfiability Testing
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cited In (24)
- On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
- Solving satisfiability problems with preferences
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
- On dedicated CDCL strategies for PB solvers
- Reasoning with uncertain and inconsistent OWL ontologies
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- A logical approach to efficient Max-SAT solving
- In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers
- Incomplete dynamic backtracking for linear pseudo-Boolean problems
- Title not available (Why is that?)
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- Pueblo
- Haplotype inference with pseudo-Boolean optimization
- Iterative and core-guided maxsat solving: a survey and assessment
- New Encodings of Pseudo-Boolean Constraints into CNF
- On using cutting planes in pseudo-Boolean optimization
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Search techniques for SAT-based Boolean optimization
- Algorithms for Weighted Boolean Optimization
- Clausal proofs for pseudo-Boolean reasoning
- PBLib -- a library for encoding pseudo-Boolean constraints into CNF
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3429161)
