Redundancy in logic. II: 2CNF and Horn propositional formulae (Q2389621): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.artint.2007.06.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046879559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Representation of Directed Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimal unsatisfiable subformulae by means of adaptive core search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension and equivalence problems for clause minimal formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Witnesses for Unsatisfiable 2CNFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removing redundancy from a clause / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal compression of propositional Horn knowledge bases: Complexity and approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimization Problem for Boolean Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating all maximal models of a Boolean expression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Minimum Equivalent Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The even-path problem for graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in logic. I: CNF propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in logic. III: Non-monotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Covers in Relational Database Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cores and Prime Implicants of Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving exact algorithms for MAX-2-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2729669 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:45, 1 July 2024

scientific article
Language Label Description Also known as
English
Redundancy in logic. II: 2CNF and Horn propositional formulae
scientific article

    Statements

    Redundancy in logic. II: 2CNF and Horn propositional formulae (English)
    0 references
    0 references
    17 July 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    propositional logic
    0 references
    computational complexity
    0 references
    redundancy
    0 references
    0 references