Skip to main content
SpringerLink
Log in

Proof of the interval satisfiability conjecture

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

In their study of algorithms for reasoning about intervals, Golumbic and Shamir conjectured that a certain class of interval inference problems is intractable (Golumbic and Shamir, J. ACM 40(1993)1108-1133). The conjecture is correct; this paper proves the NP-completeness of the interval satisfiability (ISAT) problem for the domain of relations known as Δ5.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. M.C. Golumbic and R. Shamir, Complexity and algorithms for reasoning about time: A graphtheoretic approach, J. ACM 40(1993)1108–1133.

    Google Scholar 

  2. T.J. Schaefer, The complexity of satisfiability problems,Proc. 10th Ann. ACM Symp. on Theory of Computing (ACM, 1978) pp. 216–226.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Western Illinois University, 61455, Macomb, IL, USA

    Adam Brooks Webber

Authors
  1. Adam Brooks Webber
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Webber, A.B. Proof of the interval satisfiability conjecture. Ann Math Artif Intell 15, 231–238 (1995). https://doi.org/10.1007/BF01534456

Download citation

  • Issue Date:

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

Keywords

Search

Navigation