Robert F. Stärk

Publication Activity (10 Years)

Years Active: 1989-2012
Publications (10 Years): 0

Top Topics

Inference In Bayesian Networks

Structure Learning

Geospatial Data

Top Venues

Publications

Robert F. Stärk, Arthur Wollocko, Michael Borys, Megan Kierstead, Michael Farry
Visualizing large scale patterns and anomalies in geospatial data: VAST 2012 Mini Challenge #1 award: Honorable mention for good visual design. IEEE VAST (2012)
Robert F. Stärk, Michael Farry, Jonathan D. Pfautz
Mixed-initiative data mining with Bayesian networks. CogSIMA (2012)
Jürg Kohlas, Robert F. Stärk
Information Algebras and Consequence Operators. Logica Universalis 1 (1) (2007)
Robert F. Stärk
Formal specification and verification of the C# thread model. Theor. Comput. Sci. 343 (3) (2005)
Robert F. Stärk
Axioms for strict and lazy functional programs. Ann. Pure Appl. Log. 133 (1-3) (2005)
Egon Börger, Nicu G. Fruja, Vincenzo Gervasi, Robert F. Stärk
A high-level modular definition of the semantics of C#. Theor. Comput. Sci. 336 (2-3) (2005)
Stanislas Nanchen, Robert F. Stärk
A logic for secure memory access of abstract state machines. Theor. Comput. Sci. 336 (2-3) (2005)
Stanislas Nanchen, Robert F. Stärk
A Security Logic for Abstract State Machines. Abstract State Machines (2004)
Robert F. Stärk, Egon Börger
An ASM Specification of C# Threads and the .NET Memory Model. Abstract State Machines (2004)
Egon Börger, Robert F. Stärk
Exploiting Abstraction for Specification Reuse. The Java/C# Case Study. FMCO (2003)
Robert F. Stärk, Joachim Schmid
Completeness of a Bytecode Verifier and a Certifying Java-to-JVM Compiler. J. Autom. Reason. 30 (3-4) (2003)
Nicu G. Fruja, Robert F. Stärk
The Hidden Computation Stepsof Turbo Abstract State Machines. Abstract State Machines (2003)
Robert F. Stärk, Stanislas Nanchen
A Logic for Abstract State Machines. J. Univers. Comput. Sci. 7 (11) (2001)
Robert F. Stärk, Stanislas Nanchen
A Logic for Abstract State Machines. CSL (2001)
Robert F. Stärk
A Direct Proof of the Completeness of SLDNF-Resolution. J. Log. Comput. 9 (1) (1999)
Robert F. Stärk
The Theoretical Foundations of LPTP (A Logic Program Theorem Prover). J. Log. Program. 36 (3) (1998)
Robert F. Stärk
Why the Constant 'Undefined'? Logics of Partial Terms for Strict and Non-Strict Functional Programming Languages. J. Funct. Program. 8 (2) (1998)
Robert F. Stärk
Formal Verification of Logic Programs: Foundations and Implementation. LFCS (1997)
Robert F. Stärk
Call-by-Value, Call-by-Name and the Logic of Values. CSL (1996)
Robert F. Stärk
Multi-Valued Autoepistemic Logic. Ann. Math. Artif. Intell. 18 (2-4) (1996)
Robert F. Stärk
Total Correctness of Logic Programs: A Formal Approach. ELP (1996)
Robert F. Stärk
First-order theories for pure Prolog programs with negation. Arch. Math. Log. 34 (2) (1995)
Robert F. Stärk
A Transformation of Propositional Prolog Programs into Classical Logic. LPNMR (1995)
Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk
Loop Checking and the Wll-Founded Semantics. LPNMR (1995)
Robert F. Stärk
Input/Output Dependencies of Normal Logic Programs. J. Log. Comput. 4 (3) (1994)
Robert F. Stärk
The Declarative Semantics of the Prolog Selection Rule LICS (1994)
Robert F. Stärk
Cut-Property and Negation as Failure. Int. J. Found. Comput. Sci. 5 (2) (1994)
Gerhard Jäger, Robert F. Stärk
The Defining Power of Stratified and Hierarchical Logic Programs. J. Log. Program. 15 (1&2) (1993)
Robert F. Stärk
Negation-Complete Logic Programs. CSL (1992)
Robert F. Stärk
A Complete Axiomatization of the Three-Valued Completion of Logic Programs. J. Log. Comput. 1 (6) (1991)
Robert F. Stärk
On the Existence of Fixpoints in Moore's Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle. CSL (1990)
Robert F. Stärk
A Quantifier-Free Completion of Logic Programs. CSL (1989)
Robert F. Stärk
A Direct Proof for the Completeness of SLD-Resolution. CSL (1989)