Homomorphisms of conjunctive normal forms.
type: Item
instance of: scholarly article
title: Homomorphisms of conjunctive normal forms.
zbMATH Open document ID: 1033.68095
DOI: 10.1016/S0166-218X(02)00411-0
author: Stefan Szeider
published in: Discrete Applied Mathematics
publication date: 2003-09-15T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 03D99
zbMATH DE Number: 1981514
zbMATH Keywords: \(p\)-simulation
zbMATH Keywords: unsatisfiability
zbMATH Keywords: unsatisfiable formulas
MaRDI profile type: Publication
cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
cites work: Q2721182
cites work: Tractability through symmetries in propositional calculus
cites work: The relative efficiency of propositional proof systems
cites work: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
cites work: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
cites work: A perspective on certain polynomial-time solvable classes of satisfiability
cites work: The intractability of resolution
cites work: Q4263797
cites work: Q4488342
cites work: Short proofs for tricky formulas
cites work: Investigations on autark assignments
cites work: Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
cites work: Theorem-Proving for Computers: Some Results on Resolution and Renaming
cites work: Solving satisfiability in less than \(2^ n\) steps
cites work: The complexity of facets resolved
cites work: Q4539605
cites work: The Complexity of Propositional Proofs
cites work: The symmetry rule in propositional logic
description: scientific article; zbMATH DE number 1981514