Embedding Properties of Total Recursive Functions. - Winfried Maier; Wolfgang Menzel; Volker Sperschneider (Math. Log. Q., 1982)

Universal Automata with Uniform Bounds on Simulation Time - Wolfgang Menzel; Volker Sperschneider (Inf. Control., 1982)

Recursively enumerable extensions of R1 by finite functions. - Wolfgang Menzel; Volker Sperschneider (Logic and Machines, 1983)

The length-problem. - Volker Sperschneider (Logic and Machines, 1983)

First Steps towards a Theory of Complexity over more General Data Structures. - Volker Sperschneider (Computation Theory and Logic, 1987)

On the Verification of Modules. - Grigoris Antoniou; Volker Sperschneider (CSL, 1989)

Logic - a foundation for computer science. - Volker Sperschneider; Grigoris Antoniou (Addison-Wesley, 1991)

Modularity for Logic Programs. - Grigoris Antoniou; Volker Sperschneider (ALPUK, 1992)

On the Verification of Modular Logical Knowledge Bases. - Grigoris Antoniou; Volker Sperschneider (EUROVAV, 1993)

Computing Extensions of Default Logic - Preliminary Report. - Grigoris Antoniou; Elmar Langetepe; Volker Sperschneider (LPAR, 1993)

Computing Extensions of Nonmonotonic Logics. - Grigoris Antoniou; Volker Sperschneider (SCAI, 1993)

Operational Concepts of Nonmonotonic Logics, Part 1: Default Logic. - Grigoris Antoniou; Volker Sperschneider (Artif. Intell. Rev., 1994)

New Proofs in Default Logic Theory. - Grigoris Antoniou; Elmar Langetepe; Volker Sperschneider (Ann. Math. Artif. Intell., 1994)

Theoretische Informatik - eine problemorientierte Einführung. - Volker Sperschneider; Barbara Hammer (Springer, 1996)

Operational Concepts of Nonmonotonic Logics Part 2: Autoepistemic Logic. - Grigoris Antoniou; Volker Sperschneider (Artif. Intell. Rev., 1998)