Part of the Monographs in Theoretical Computer Science An EATCS Series book series (EATCS)
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.
KeywordsState 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.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 2004