scientific article; zbMATH DE number 3325539

Cited in

(72)

Efficiently checking propositional refutations in HOL theorem provers
A lower bound for tree resolution
Empirical analysis of algorithms for the shortest negative cost cycle problem
Conflict-driven answer set solving: from theory to practice
Investigations on autark assignments
On the complexity of choosing the branching literal in DPLL
Feasibly constructive proofs of succinct weak circuit lower bounds
Non-clausal redundancy properties
DiMo -- discrete modelling using propositional logic
Automated generation of exam sheets for automated deduction
Verifying the conversion into CNF in dafny
Simulating strong practical proof systems with extended resolution
Strong extension-free proof systems
Solving QBF with counterexample guided refinement
An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
Craig interpolation with clausal first-order tableaux
On the restricted equivalence for subclasses of propositional logic
Lower bounds for the size of nondeterministic circuits
Diverse Palindromic Factorization Is NP-complete
Regular and General Resolution: An Improved Separation
Towards NP-P via proof complexity and search
scientific article; zbMATH DE number 6970794 (Why is no real title available?)
Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases
Diverse Palindromic Factorization is NP-Complete
Using merging variables-based local search to solve special variants of MaxSAT problem
Boolean satisfiability in quantum compilation
The (D)QBF preprocessor HQSpre -- underlying theory and its implementation
CAQE and QuAbS: Abstraction Based QBF Solvers
A Logical Autobiography
On black-box optimization in divide-and-conquer SAT solving
scientific article; zbMATH DE number 7199588 (Why is no real title available?)
Mass customization and ``forecasting options' penetration rates problem
scientific article; zbMATH DE number 7300350 (Why is no real title available?)
scientific article; zbMATH DE number 7301717 (Why is no real title available?)
Technology for translating combinatorial problems into Boolean equations
A Recursive Inclusion Checker for Recursively Defined Subtypes
Characterizing Tseitin-Formulas with Short Regular Resolution Refutations
The power of the binary value principle
Number of Variables for Graph Differentiation and the Resolution of Graph Isomorphism Formulas
Boolean functional synthesis: from under the hood of solvers
A comparison of ASP-based and SAT-based algorithms for the contension inconsistency measure
A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation
Gregory Samuilovich Tseytin (obituary)
Partial quantifier elimination and property generation
Range-restricted and Horn interpolation through clausal tableaux
The MaxSAT problem in the real-valued MV-algebra
Verified AIG algorithms in ACL2
Consistency, acyclicity, and positive Semirings
Tractable representations for Boolean functional synthesis
CNF encodings of symmetric functions
On enumerating short projected models
Comparing and extending satisfiability solution methods for the resource-constrained project scheduling problem
Improved decision procedures for multi-modal tense logic using CEGAR-tableaux
Towards universally accessible SAT technology
Clausal congruence closure
The relative strength of \#SAT proof systems
Entailment vs. verification for partial-assignment satisfiability and enumeration
AxSAT -- bringing axioms to SAT planning
Proving unsatisfiability with hitting formulas
Techniques for measuring the inferential strength of forgetting policies
Consistency of relations over monoids
The power of the binary value principle
Feasibly constructive proofs and the propositional calculus (preliminary version)
The relative efficiency of propositional proof systems
SAT and lattice reduction for integer factorization
Tropical proof systems: between R(CP) and resolution
Separation between Walksat and DPLL
The relative strength of \#SAT proof systems
Computer-aided proof of Erdős discrepancy properties
Learning Boolean specifications
The NP-hardness of finding a directed acyclic graph for regular resolution
A new 3-CNF transformation by parallel-serial graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5604434)