PBS

swMATH4622MaRDI QIDQ16793FDOQ16793

Author name not available (Why is that?)

Cited In (38)

• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• The state of SAT
• Solving satisfiability problems with preferences
• Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
• Boolean lexicographic optimization: algorithms \& applications
• Dynamic symmetry-breaking for Boolean satisfiability
• Theory and Applications of Satisfiability Testing
• On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
• Variants of LTL query checking
• Curriculum-based course timetabling with SAT and MaxSAT
• Efficient verification of sequential and concurrent C programs
• Multi-mode resource-constrained project scheduling using RCPSP and SAT solvers
• Tools for modeling and solving search problems
• Solution and Optimization of Systems of Pseudo-Boolean Constraints
• Exact algorithms for MAX-SAT
• Best-First AND/OR Search for 0/1 Integer Programming
• Title not available (Why is that?)
• A SAT approach to query optimization in mediator systems
• Haplotype inference with pseudo-Boolean optimization
• Iterative and core-guided maxsat solving: a survey and assessment
• Dependence graph based verification and synthesis of hardware/software co-designs with SAT related formulation
• New Encodings of Pseudo-Boolean Constraints into CNF
• A Boolean satisfiability approach to the resource-constrained project scheduling problem
• HySAT: An efficient proof engine for bounded model checking of hybrid systems
• Logic programs with monotone abstract constraint atoms
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• Local-search techniques for propositional logic extended with cardinality constraints
• Search techniques for SAT-based Boolean optimization
• Recent Advances in Constraints
• Algorithms for Weighted Boolean Optimization
• Three optimizations for assume-guarantee reasoning with \(L^{*}\)
• Strong equivalence of logic programs with abstract constraint atoms
• SDSAT: Tight integration of small domain encoding and lazy approaches in solving difference logic.
• Satisfiability modulo the theory of costs: foundations and applications
• Algorithms for Solving Satisfiability Problems with Qualitative Preferences
• Breaking instance-independent symmetries in exact graph coloring
• Properties and applications of programs with monotone and convex constraints
• Probability logic and optimization SAT: The PSAT and CPA models

This page was built for software: PBS