Pages that link to "Item:Q1099168"

The following pages link to On the complexity of the maximum satisfiability problem for Horn formulas (Q1099168):

Displaying 21 items.

• A simplified NP-complete MAXSAT problem (Q293164) (← links)
• Complexity versus stability for classes of propositional formulas (Q293437) (← links)
• An algorithm to compute maximal contractions for Horn clauses (Q543196) (← links)
• Algorithms for the maximum satisfiability problem (Q753502) (← links)
• Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
• Satisfiability of mixed Horn formulas (Q997066) (← links)
• Resolution and the integrality of satisfiability problems (Q1352293) (← links)
• Max Horn SAT and the minimum cut problem in directed hypergraphs (Q1380929) (← links)
• Probability logic and optimization SAT: The PSAT and CPA models (Q1777404) (← links)
• Directed hypergraphs and applications (Q1803674) (← links)
• Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
• Hardness results for approximate pure Horn CNF formulae minimization (Q2254607) (← links)
• Voting on multi-issue domains with conditionally lexicographic preferences (Q2315365) (← links)
• On the complexity of inconsistency measurement (Q2321337) (← links)
• Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap (Q2868930) (← links)
• On the Approximability of Splitting-SAT in 2-CNF Horn Formulas (Q2870016) (← links)
• SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
• Extending time‐to‐target plots to multiple instances (Q4624885) (← links)
• On Tackling Explanation Redundancy in Decision Trees (Q5041018) (← links)
• Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations (Q5044548) (← links)
• Extensions of unification modulo ACUI (Q5139274) (← links)