Compiling problem specifications into SAT (Q2457689): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Semantics of Predicate Logic as a Programming Language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-SPEC: an executable specification language for solving all problems in NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4058132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating hard satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscribing DATALOG: expressive power and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4195901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling sport tournaments using constraint logic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic programs with stable model semantics as a constraint programming paradigm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475673 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Problems and Channelling Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to evaluate quantified Boolean formulae and its experimental evaluation / rank
 
Normal rank

Revision as of 10:42, 27 June 2024

scientific article
Language Label Description Also known as
English
Compiling problem specifications into SAT
scientific article

    Statements

    Compiling problem specifications into SAT (English)
    0 references
    0 references
    0 references
    23 October 2007
    0 references
    automatic generation of problem reformulation
    0 references
    executable specifications
    0 references
    SAT problem
    0 references
    NP-complete problems
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references