Amanote Research

Amanote Research

    RegisterSign In

Binary Clause Reasoning in QBF

Lecture Notes in Computer Science - Germany
doi 10.1007/11814948_33
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2006

Authors
Horst SamulowitzFahiem Bacchus
Publisher

Springer Berlin Heidelberg


Related search

Dependency Learning for QBF

Journal of Artificial Intelligence Research
Artificial Intelligence
2019English

Functional Semantics for Non-Prenex QBF

2014English

Leveraging Dominators for Preprocessing QBF

2010English

Clause Linking in Japhug

Linguistics of the Tibeto-Burman Area
LinguisticsLanguage
2014English

A Unified Proof System for QBF Preprocessing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Parallel QBF Solving With Advanced Knowledge Sharing

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2011English

Clause Compromissoire

Les Cahiers de droit
1969English

Blocked Clause Elimination

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Small Clause Results

Lingua
LinguisticsLanguage
1988English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy