Chaff

swMATH6916MaRDI QIDQ18982FDOQ18982

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• Extended Resolution Proofs for Conjoining BDDs
• Logics in Artificial Intelligence
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• Computational aspects of infeasibility analysis in mixed integer programming
• Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques
• Efficient theory combination via Boolean search
• Correct Hardware Design and Verification Methods
• Applications and Theory of Petri Nets 2004
• Tradeoffs in the Complexity of Backdoor Detection
• Optimization modulo theories with linear rational costs
• HordeSat: a massively parallel portfolio SAT solver
• Computer Aided Verification
• Eliminating Redundant Clauses in SAT Instances
• Backdoors in the Context of Learning
• Bounded LTL model checking with stable models
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
• Mixed deterministic and probabilistic networks
• Theory and Applications of Satisfiability Testing
• Learning from conflicts in propositional satisfiability
• A pearl on SAT and SMT solving in Prolog
• MDD propagators with explanation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• APPSSAT: Approximate probabilistic planning using stochastic satisfiability
• Rapid learning for binary programs
• Consistency for Quantified Constraint Satisfaction Problems
• On Solving Soft Temporal Constraints Using SAT Techniques
• Boundary Points and Resolution
• Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
• Automated Deduction – CADE-20
• SAT-based verification for timed component connectors
• SAT-based verification for timed component connectors
• Combining decision procedures by (model-)equality propagation
• A Decision-Making Procedure for Resolution-Based SAT-Solvers
• Protecting Data Privacy Through Hard-to-Reverse Negative Databases
• A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
• Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory and Applications of Satisfiability Testing
• A unified framework for DPLL(T) + certificates
• Establishing flight software reliability: testing, model checking, constraint-solving, monitoring and learning
• Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
• Formal Methods in Computer-Aided Design
• Towards Robust CNF Encodings of Cardinality Constraints
• Title not available (Why is that?)
• Verification conditions for source-level imperative programs
• Allen Linear (Interval) Temporal Logic – Translation to LTL and Monitor Synthesis
• Evaluating CDCL variable scoring schemes
• Title not available (Why is that?)
• Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
• Quantifier elimination by dependency sequents
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• On using cutting planes in pseudo-Boolean optimization
• An overview of parallel SAT solving
• Implementing logical connectives in constraint programming
• Theory and Applications of Satisfiability Testing
• Determinization of Resolution by an Algorithm Operating on Complete Assignments
• On SAT Modulo Theories and Optimization Problems
• Accelerating bounded model checking of safety properties
• Data compression for proof replay
• Compiling finite linear CSP into SAT
• AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
• A symbolic approach to predicate abstraction.
• Information-based branching schemes for binary linear mixed integer problems
• On tree automata that certify termination of left-linear term rewriting systems
• Title not available (Why is that?)
• Automatic construction of parallel portfolios via algorithm configuration
• Theory and Applications of Satisfiability Testing
• State space search nogood learning: online refinement of critical-path dead-end detectors in planning
• Cache conscious data structures for Boolean satisfiability solvers
• Efficient data structures for backtrack search SAT solvers
• Symbolic computational techniques for solving games
• Memory intensive AND/OR search for combinatorial optimization in graphical models
• Bounded model checking of infinite state systems
• Shift-and-propagate
• SAT solver management strategies in IC3: an experimental approach
• Matrix Interpretations for Proving Termination of Term Rewriting
• Logic programming with infinite sets
• Title not available (Why is that?)
• Combining Abstraction Refinement and SAT-Based Model Checking
• Efficient SAT-based bounded model checking for software verification
• Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
• Tools and Algorithms for the Construction and Analysis of Systems
• Symbolic techniques in satisfiability solving
• Fast congruence closure and extensions
• Title not available (Why is that?)
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Correct Hardware Design and Verification Methods
• Formal Methods for Hardware Verification
• Producing and verifying extremely large propositional refutations
• Statistical regimes across constrainedness regions
• A backjumping technique for disjunctive logic programming
• An efficient approach to solving random \(k\)-SAT problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for software: Chaff