Advertisement

Undecidability

  • Zhou Chaochen
  • Michael R. Hansen
Part of the Monographs in Theoretical Computer Science An EATCS Series book series (EATCS)

Abstract

All the disappointing news comes in this chapter: even for a very restricted subset of DC formulas, it is undecidable whether a formula in the subset is satisfiable.

Keywords

State Expression Initial Configuration Atomic Formula Satisfiability Problem Counter Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Zhou Chaochen
    • 1
  • Michael R. Hansen
    • 2
  1. 1.Institute of SoftwareChinese Academy of SciencesBeijingChina
  2. 2.Informatics and Mathematical ModellingTechnical University DenmarkLyngbyDenmark

Personalised recommendations