Solving quantified constraint satisfaction problems (Q2389634): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.artint.2007.11.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046194288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reusing CSP Propagators for QCSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal coarse-grained arc consistency algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic for Programming, Artificial Intelligence, and Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to evaluate quantified Boolean formulae and its experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local and global relational consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backjumping for quantified Boolean logic satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient solving of quantified inequality constraints over the real numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: BlockSolve: A Bottom-Up Approach for Solving Quantified CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473043 / rank
 
Normal rank

Latest revision as of 18:45, 1 July 2024

scientific article
Language Label Description Also known as
English
Solving quantified constraint satisfaction problems
scientific article

    Statements

    Solving quantified constraint satisfaction problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 July 2009
    0 references
    quantified constraint satisfaction problems
    0 references
    quantified Boolean formulas
    0 references
    arc consistency
    0 references
    search algorithms
    0 references
    random problems
    0 references
    0 references
    0 references

    Identifiers