Amanote Research

Amanote Research

    RegisterSign In

A Max-Sat Solver With Lazy Data Structures

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-540-30498-2_34
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2004

Authors
Teresa AlsinetFelip ManyàJordi Planes
Publisher

Springer Berlin Heidelberg


Related search

MiniMaxSAT: An Efficient Weighted Max-Sat Solver

Journal of Artificial Intelligence Research
Artificial Intelligence
2008English

Versat: A Verified Modern SAT Solver

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

SAT-Based Compositional Verification Using Lazy Learning

English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

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

Parametric RBAC Maintenance via Max-Sat

2018English

An Approximation Algorithm for MAX-2-SAT With Cardinality Constraint

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy