Skip to main content
SpringerLink
Log in

Nested satisfiability

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Lichtenstein, D.: Planar formulæ and their uses. SIAM J. Comput.11, 329–343 (1982).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Stanford University, 94305-2140, Stanford, CA, USA

    Donald E. Knuth

Authors
  1. Donald E. Knuth
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by National Science Foundation grant CCR-8610181.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Knuth, D.E. Nested satisfiability. Acta Informatica 28, 1–6 (1990). https://doi.org/10.1007/BF02983372

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02983372

Keywords

Search

Navigation