Pages that link to "Item:Q3826123"
From MaRDI portal
The following pages link to Algorithms for testing the satisfiability of propositional formulae (Q3826123):
Displaying 25 items.
- Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- Logic applied to integer programming and integer programming applied to logic (Q1130078) (← links)
- An efficient algorithm for the 3-satisfiability problem (Q1200758) (← links)
- On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees (Q1296806) (← links)
- New methods for computing inferences in first order logic (Q1309900) (← links)
- Resolving contradictions: A plausible semantics for inconsistent systems (Q1332637) (← links)
- Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← links)
- Embedding complex decision procedures inside an interactive theorem prover. (Q1353946) (← links)
- Variable and term removal from Boolean formulae (Q1363769) (← links)
- Backtracking tactics in the backtrack method for SAT (Q1596804) (← links)
- Directed hypergraphs and applications (Q1803674) (← links)
- Partitioning methods for satisfiability testing on large formulas (Q1854377) (← links)
- A new algorithm for the propositional satisfiability problem (Q1894360) (← links)
- Branching rules for satisfiability (Q1904401) (← links)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- Some pitfalls for experimenters with random SAT (Q2674180) (← links)
- An artificial neural network satisfiability tester (Q4329689) (← links)
- Approximate reasoning with credible subsets (Q4371295) (← links)
- Partitioning methods for satisfiability testing on large formulas (Q4647562) (← links)
- Explaining by evidence (Q4779486) (← links)
- Exploiting data dependencies in many-valued logics (Q4868234) (← links)
- Propositional calculus problems in CHIP (Q5096196) (← links)
- Towards the Use of Hypergraphs in Multi-adjoint Logic Programming (Q5215753) (← links)
- Fuzzy logic programs as hypergraphs. Termination results (Q6079415) (← links)