Pages that link to "Item:Q1356207"
From MaRDI portal
The following pages link to On renamable Horn and generalized Horn functions (Q1356207):
Displaying 15 items.
- Unique Horn renaming and Unique 2-Satisfiability (Q673674) (← links)
- Resolution search (Q674925) (← links)
- Detecting embedded Horn structure in propositional logic (Q1198035) (← links)
- A linear algorithm for renaming a set of clauses as a Horn set (Q1318709) (← links)
- Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← links)
- Hierarchies of polynomially solvable satisfiability problems (Q1380432) (← links)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Recognizing renamable generalized propositional Horn formulas is NP- complete (Q1804878) (← links)
- Testing heuristics: We have it all wrong (Q1922626) (← links)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- Domain permutation reduction for constraint satisfaction problems (Q2389649) (← links)
- Fuzzy logic programs as hypergraphs. Termination results (Q6079415) (← links)
