A Direct Proof for the Completeness of SLD-Resolution. - Robert F. Stärk (CSL, 1989)

A Quantifier-Free Completion of Logic Programs. - Robert F. Stärk (CSL, 1989)

On the Existence of Fixpoints in Moore's Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle. - Robert F. Stärk (CSL, 1990)

A Complete Axiomatization of the Three-Valued Completion of Logic Programs. - Robert F. Stärk (J. Log. Comput., 1991)

Negation-Complete Logic Programs. - Robert F. Stärk (CSL, 1992)

The Defining Power of Stratified and Hierarchical Logic Programs. - Gerhard Jäger; Robert F. Stärk (J. Log. Program., 1993)

The Declarative Semantics of the Prolog Selection Rule - Robert F. Stärk (LICS, 1994)

Cut-Property and Negation as Failure. - Robert F. Stärk (Int. J. Found. Comput. Sci., 1994)

Input/Output Dependencies of Normal Logic Programs. - Robert F. Stärk (J. Log. Comput., 1994)

Loop Checking and the Wll-Founded Semantics. - Vladimir Lifschitz; Norman McCain; Teodor C. Przymusinski; Robert F. Stärk (LPNMR, 1995)

A Transformation of Propositional Prolog Programs into Classical Logic. - Robert F. Stärk (LPNMR, 1995)

First-order theories for pure Prolog programs with negation. - Robert F. Stärk (Arch. Math. Log., 1995)

Call-by-Value, Call-by-Name and the Logic of Values. - Robert F. Stärk (CSL, 1996)

Total Correctness of Logic Programs: A Formal Approach. - Robert F. Stärk (ELP, 1996)

Multi-Valued Autoepistemic Logic. - Robert F. Stärk (Ann. Math. Artif. Intell., 1996)

Formal Verification of Logic Programs: Foundations and Implementation. - Robert F. Stärk (LFCS, 1997)

Why the Constant 'Undefined'? Logics of Partial Terms for Strict and Non-Strict Functional Programming Languages. - Robert F. Stärk (J. Funct. Program., 1998)

The Theoretical Foundations of LPTP (A Logic Program Theorem Prover). - Robert F. Stärk (J. Log. Program., 1998)

A Direct Proof of the Completeness of SLDNF-Resolution. - Robert F. Stärk (J. Log. Comput., 1999)

Java and the Java Virtual Machine: Definition, Verification, Validation - Robert F. Stärk; Joachim Schmid 001; Egon Börger (Springer, 2001)

A Logic for Abstract State Machines. - Robert F. Stärk; Stanislas Nanchen (J. Univers. Comput. Sci., 2001)

Abstract State Machines. A Method for High-Level System Design and Analysis - Egon Börger; Robert F. Stärk (Springer, 2003)

The Hidden Computation Stepsof Turbo Abstract State Machines. - Nicu G. Fruja; Robert F. Stärk (Abstract State Machines, 2003)

Exploiting Abstraction for Specification Reuse. The Java/C# Case Study. - Egon Börger; Robert F. Stärk (FMCO, 2003)

Completeness of a Bytecode Verifier and a Certifying Java-to-JVM Compiler. - Robert F. Stärk; Joachim Schmid 001 (J. Autom. Reason., 2003)

A Security Logic for Abstract State Machines. - Stanislas Nanchen; Robert F. Stärk (Abstract State Machines, 2004)

An ASM Specification of C# Threads and the .NET Memory Model. - Robert F. Stärk; Egon Börger (Abstract State Machines, 2004)

Axioms for strict and lazy functional programs. - Robert F. Stärk (Ann. Pure Appl. Log., 2005)

A high-level modular definition of the semantics of C#. - Egon Börger; Nicu G. Fruja; Vincenzo Gervasi; Robert F. Stärk (Theor. Comput. Sci., 2005)

A logic for secure memory access of abstract state machines. - Stanislas Nanchen; Robert F. Stärk (Theor. Comput. Sci., 2005)

Formal specification and verification of the C# thread model. - Robert F. Stärk (Theor. Comput. Sci., 2005)

Information Algebras and Consequence Operators. - Jürg Kohlas; Robert F. Stärk (Logica Universalis, 2007)

Mixed-initiative data mining with Bayesian networks. - Robert F. Stärk; Michael Farry; Jonathan D. Pfautz (CogSIMA, 2012)

Visualizing large scale patterns and anomalies in geospatial data: VAST 2012 Mini Challenge #1 award: Honorable mention for good visual design. - Robert F. Stärk; Arthur Wollocko; Michael Borys; Megan Kierstead; Michael Farry (IEEE VAST, 2012)