Amanote Research

Amanote Research

    RegisterSign In

Smten With Satisfiability-Based Search

doi 10.1145/2660193.2660208
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2014

Authors
Richard UhlerNirav Dave
Publisher

ACM Press


Related search

Grasp—A New Search Algorithm for Satisfiability

2003English

Boolean Satisfiability With Transitivity Constraints

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2002English

Automated Design Debugging With Maximum Satisfiability

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
2010English

CCEHC: An Efficient Local Search Algorithm for Weighted Partial Maximum Satisfiability (Extended Abstract)

2017English

Hypergraph-Based Wikipedia Search With Semantics

International Journal of Web Science
2013English

On Using Satisfiability-Based Pruning Techniques in Covering Algorithms

English

Satisfiability and Feasibility in a Relationship-Based Workflow Authorization Model

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Model-Based Diagnosis of Hybrid Systems Using Satisfiability Modulo Theory

Proceedings of the AAAI Conference on Artificial Intelligence
2019English

A Logical Deduction Based Clause Learning Algorithm for Boolean Satisfiability Problems

International Journal of Computational Intelligence Systems
Computational MathematicsComputer Science
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy