Conformant planning as a case study of incremental QBF solving (Q2398267): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: DBLP publication ID (P1635): journals/amai/EglyKLP17, #quickstatements; #temporary_batch_1731468600454
 
(12 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: sQueezeBF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Bloqqer / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Nenofex / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: RAReQS / rank
 
Normal rank
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: semprop / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DepQBF / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Glucose / 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/s10472-016-9501-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2309239751 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59529080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified QBF certification and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of planning and approximate planning in the presence of incompleteness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocked Clause Elimination for QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast planning through planning graph analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Universal Expansion for Preprocessing QBF / 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: Q3457218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2845506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conformant planning as a case study of incremental QBF solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clause Elimination for SAT and QSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Proof System for QBF Preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominant Controllability Check Using QBF-Solver and Netlist Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conformant planning via heuristic forward search: A new approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: On QBF Proofs and Preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving QBF with Counterexample Guided Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expansion-based QBF solving versus Q-resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing Solutions after Blocked Clause Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inprocessing Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of extended resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Out Assumptions to Speed Up MUS Extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhancing Search-Based QBF Solving by Dynamic Blocked Clause Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nenofex: Expanding NNF for QBF Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental QBF Solving by DepQBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification of partial designs using incremental QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ultimately Incremental SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backdoor sets of quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Failed-Literal Preprocessing for Quantified Boolean Formulas / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/amai/EglyKLP17 / rank
 
Normal rank

Latest revision as of 05:03, 13 November 2024

scientific article
Language Label Description Also known as
English
Conformant planning as a case study of incremental QBF solving
scientific article

    Statements

    Conformant planning as a case study of incremental QBF solving (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 August 2017
    0 references
    quantified Boolean formulas (QBFs)
    0 references
    conformant planning
    0 references
    incremental solving
    0 references
    preprocessing
    0 references
    blocked clause elimination
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers