A SAT Approach to Branchwidth

doi 10.24963/ijcai.2017/689
Full Text
Abstract

Available in full text

Date
Authors
Publisher

International Joint Conferences on Artificial Intelligence Organization

Related search

SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2008English

From Parallel SAT to Distributed SAT

English

To SAT or Not to SAT: Ashenhurst Decomposition in a Large Scale

2008English

Branching Process Approach for 2-Sat Thresholds

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2010English

A Fast Counterexample Minimization Approach With Refutation Analysis and Incremental SAT

English

A Translation of Pseudo-Boolean Constraints to SAT

Journal on Satisfiability, Boolean Modeling and Computation
2006English

Three “Quantum” Algorithms to Solve 3-Sat

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2007English

New Tools and Simpler Algorithms for Branchwidth

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Graphs With Branchwidth at Most Three

Journal of Algorithms
1999English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy