Expansion-based QBF solving versus Q-resolution (Q2339467): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(14 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2015.01.048 / rank
Normal rank
 
Property / author
 
Property / author: João P. Marques-Silva / rank
Normal rank
 
Property / author
 
Property / author: João P. Marques-Silva / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QUBE / 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: Nenofex / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QUBOS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Quaffle / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DepQBF / 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.tcs.2015.01.048 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051846104 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q62047279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability, branch-width and Tseitin tautologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified propositional calculi and fragments of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sequent Systems and Resolution for QBFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Practical Quantified Boolean Formula Solving / 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: Q4427904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nenofex: Expanding NNF for QBF Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving QBF with Counterexample Guided Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Universal Expansion for Preprocessing QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3566747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Propositional QBF Expansions and Q-Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3436752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction-Based Algorithm for 2QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unified QBF certification and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear reasoning. A new form of the Herbrand-Gentzen theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Davis-Putnam resolution versus unrestricted resolution / 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: Q3002781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and applications of satisfiability testing -- SAT 2012. 15th international conference, Trento, Italy, June 17--20, 2012. Proceedings / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/JanotaM15 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2015.01.048 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:00, 18 December 2024

scientific article
Language Label Description Also known as
English
Expansion-based QBF solving versus Q-resolution
scientific article

    Statements

    Expansion-based QBF solving versus Q-resolution (English)
    0 references
    0 references
    0 references
    1 April 2015
    0 references
    quantified Boolean formula
    0 references
    proof theory
    0 references
    expansion
    0 references
    Q-resolution
    0 references
    SAT
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers