Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas (Q3655211): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LIBSVM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: C4.5 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: sKizzo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Quantor / 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.1007/978-3-642-04222-5_22 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1566051759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Deduction – CADE-20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-adaptive multi-engine solver for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backjumping for quantified Boolean logic satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution versus search: Two strategies for SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of structural CSP decomposition methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for finding tree-decompositions of small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5312442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary Clause Reasoning in QBF / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:52, 2 July 2024

scientific article
Language Label Description Also known as
English
Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas
scientific article

    Statements

    Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas (English)
    0 references
    0 references
    0 references
    7 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references