A competitive and cooperative approach to propositional satisfiability (Q860390): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(13 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MiniSat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SATO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PSATO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Walksat / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: zChaff / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DIMACS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Graphplan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GridSAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chaff / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SATLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.04.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983758948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast planning through planning graph analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel SAT-solver -- efficient workload balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: GridSAT: Design and implementation of a computational grid application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(Multi\)-SAT algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating hard satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSATO: A distributed propositional prover and its application to quasigroup problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:04, 25 June 2024

scientific article
Language Label Description Also known as
English
A competitive and cooperative approach to propositional satisfiability
scientific article

    Statements

    A competitive and cooperative approach to propositional satisfiability (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    SAT
    0 references
    SAT solver
    0 references
    parallel execution
    0 references
    planning
    0 references
    job-shop scheduling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references