On the complexity of the maximum satisfiability problem for Horn formulas
From MaRDI portal
(Redirected from Publication:1099168)
Recommendations
Cites work
- scientific article; zbMATH DE number 3874667 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Minimum cuts and related problems
- Network Flow and Testing Graph Connectivity
- Some simplified NP-complete graph problems
- The complexity of theorem-proving procedures
Cited in
(29)- Satisfiability of mixed Horn formulas
- Compactly generating all satisfying truth assignments of a Horn formula
- Max Horn SAT and the minimum cut problem in directed hypergraphs
- Resolution and the integrality of satisfiability problems
- Generating all maximal models of a Boolean expression
- Theory and Applications of Satisfiability Testing
- Probabilistic bounds and algorithms for the maximum satisfiability problem
- Simple but hard mixed Horn formulas
- Propositional proof systems based on maximum satisfiability
- A simplified NP-complete MAXSAT problem
- Complexity versus stability for classes of propositional formulas
- Directed hypergraphs and applications
- On Tackling Explanation Redundancy in Decision Trees
- Hardness results for approximate pure Horn CNF formulae minimization
- On the Approximability of Splitting-SAT in 2-CNF Horn Formulas
- On the complexity of inconsistency measurement
- Extending time-to-target plots to multiple instances
- Extensions of unification modulo ACUI
- Detecting embedded Horn structure in propositional logic
- Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations
- Voting on multi-issue domains with conditionally lexicographic preferences
- An algorithm to compute maximal contractions for Horn clauses
- SAT-Based Horn Least Upper Bounds
- On-line algorithms for satisfiability problems with uncertainty
- On Some Aspects of Mixed Horn Formulas
- Algorithms for the maximum satisfiability problem
- Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap
- Complexity of the problem of being equivalent to Horn formulas. II
- Probability logic and optimization SAT: The PSAT and CPA models
This page was built for publication: On the complexity of the maximum satisfiability problem for Horn formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099168)
