A Verified SAT Solver Framework With Learn, Forget, Restart, and Incrementality

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-40229-1_4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Versat: A Verified Modern SAT Solver

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

A Max-Sat Solver With Lazy Data Structures

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Efficient Verified (UN)SAT Certificate Checking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Learn With SAT to Minimize Büchi Automata

Electronic Proceedings in Theoretical Computer Science, EPTCS
Software
2012English

DSatz: A Directional SAT Solver for Planning

English

Improving SAT Solver Performance With Structure-Based Preferential Bumping

English

Tts: A SAT-Solver for Small, Difficult Instances

Journal on Satisfiability, Boolean Modeling and Computation
2008English

Unsatisfiability Proofs for Parallel SAT Solver Portfolios With Clause Sharing and Inprocessing

English

MiniMaxSAT: An Efficient Weighted Max-Sat Solver

Journal of Artificial Intelligence Research
Artificial Intelligence
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy