𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nested satisfiability

✍ Scribed by Donald E. Knuth


Publisher
Springer-Verlag
Year
1990
Tongue
English
Weight
260 KB
Volume
28
Category
Article
ISSN
0001-5903

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Satisfiability of co-nested formulas
✍ Jan KratochvΓ­l; Mirko KΕ™ivΓ‘nek πŸ“‚ Article πŸ“… 1993 πŸ› Springer-Verlag 🌐 English βš– 337 KB
Probabilistic satisfiability
✍ George Georgakopoulos; Dimitris Kavvadias; Christos H Papadimitriou πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 683 KB
Satisfiability on hypergraphs
✍ Adam Kolany πŸ“‚ Article πŸ“… 1993 πŸ› Springer Netherlands 🌐 English βš– 557 KB
LTL satisfiability checking
✍ Kristin Y. Rozier; Moshe Y. Vardi πŸ“‚ Article πŸ“… 2010 πŸ› Springer 🌐 English βš– 888 KB
Generating hard satisfiability problems
✍ Bart Selman; David G. Mitchell; Hector J. Levesque πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 975 KB

We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to