Boolean Satisfiability With Transitivity Constraints

ACM Transactions on Computational Logic - United States
doi 10.1145/566385.566390
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Association for Computing Machinery (ACM)

Related search

Boolean Satisfiability in Quantum Compilation

Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
MathematicsEngineeringAstronomyPhysics
2019English

Shatter: Efficient Symmetry-Breaking for Boolean Satisfiability

English

Nonmonotonic Reasoning With Quantified Boolean Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

On Generic Np-Completeness of the Boolean Satisfiability Problem

Prikladnaya Diskretnaya Matematika
Signal ProcessingCombinatoricsApplied MathematicsMathematicsDiscrete MathematicsComputational TheoryTheoretical Computer Science
2017English

A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems

International Journal of Computational Intelligence Systems
Computational MathematicsComputer Science
2017English

Bi-Decomposing Large Boolean Functions via Interpolation and Satisfiability Solving

2008English

Pattern Backtracking Algorithm for the Workflow Satisfiability Problem With User-Independent Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Dominance Constraints With Boolean Connectives: A Model-Eliminative Treatment

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2003English

Exact Minimum Factoring of Incompletely Specified Logic Functions via Quantified Boolean Satisfiability

IPSJ Transactions on System LSI Design Methodology
Electronic EngineeringComputer Science ApplicationsElectrical
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy