SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-88387-6_14
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A SAT Approach to Branchwidth

2017English

From Parallel SAT to Distributed SAT

English

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

2008English

A Hybrid Learnt Clause Evaluation Algorithm for SAT Problem

International Journal of Computational Intelligence Systems
Computational MathematicsComputer Science
2018English

Branching Process Approach for 2-Sat Thresholds

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2010English

Set-Based SAT-solving

Facta universitatis - series: Electronics and Energetics
2007English

Formalization of Abstract State Transition Systems for SAT

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Three “Quantum” Algorithms to Solve 3-Sat

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2007English

Learn With SAT to Minimize Büchi Automata

Electronic Proceedings in Theoretical Computer Science, EPTCS
Software
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy