default search action
Robert F. Stärk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
- [c17]Robert F. Stärk, Michael Farry, Jonathan D. Pfautz:
Mixed-initiative data mining with Bayesian networks. CogSIMA 2012: 107-110 - [c16]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: 271-272
2000 – 2009
- 2007
- [j16]Jürg Kohlas, Robert F. Stärk:
Information Algebras and Consequence Operators. Logica Universalis 1(1): 139-165 (2007) - 2005
- [j15]Robert F. Stärk:
Axioms for strict and lazy functional programs. Ann. Pure Appl. Log. 133(1-3): 293-318 (2005) - [j14]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): 235-284 (2005) - [j13]Stanislas Nanchen, Robert F. Stärk:
A logic for secure memory access of abstract state machines. Theor. Comput. Sci. 336(2-3): 343-365 (2005) - [j12]Robert F. Stärk:
Formal specification and verification of the C# thread model. Theor. Comput. Sci. 343(3): 482-508 (2005) - 2004
- [c15]Robert F. Stärk, Egon Börger:
An ASM Specification of C# Threads and the .NET Memory Model. Abstract State Machines 2004: 38-60 - [c14]Stanislas Nanchen, Robert F. Stärk:
A Security Logic for Abstract State Machines. Abstract State Machines 2004: 169-185 - 2003
- [b2]Egon Börger, Robert F. Stärk:
Abstract State Machines. A Method for High-Level System Design and Analysis. Springer 2003, ISBN 3540007024, pp. I-X, 1-438 - [j11]Robert F. Stärk, Joachim Schmid:
Completeness of a Bytecode Verifier and a Certifying Java-to-JVM Compiler. J. Autom. Reason. 30(3-4): 323-361 (2003) - [c13]Nicu G. Fruja, Robert F. Stärk:
The Hidden Computation Stepsof Turbo Abstract State Machines. Abstract State Machines 2003: 244-262 - [c12]Egon Börger, Robert F. Stärk:
Exploiting Abstraction for Specification Reuse. The Java/C# Case Study. FMCO 2003: 42-76 - 2001
- [b1]Robert F. Stärk, Joachim Schmid, Egon Börger:
Java and the Java Virtual Machine: Definition, Verification, Validation. Springer 2001 - [j10]Robert F. Stärk, Stanislas Nanchen:
A Logic for Abstract State Machines. J. Univers. Comput. Sci. 7(11): 980-1005 (2001) - [c11]Robert F. Stärk, Stanislas Nanchen:
A Logic for Abstract State Machines. CSL 2001: 217-231 - [e1]Reinhard Kahle, Peter Schroeder-Heister, Robert F. Stärk:
Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings. Lecture Notes in Computer Science 2183, Springer 2001, ISBN 3-540-42752-X [contents]
1990 – 1999
- 1999
- [j9]Robert F. Stärk:
A Direct Proof of the Completeness of SLDNF-Resolution. J. Log. Comput. 9(1): 47-61 (1999) - 1998
- [j8]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): 97-129 (1998) - [j7]Robert F. Stärk:
The Theoretical Foundations of LPTP (A Logic Program Theorem Prover). J. Log. Program. 36(3): 241-269 (1998) - 1997
- [c10]Robert F. Stärk:
Formal Verification of Logic Programs: Foundations and Implementation. LFCS 1997: 354-368 - 1996
- [j6]Robert F. Stärk:
Multi-Valued Autoepistemic Logic. Ann. Math. Artif. Intell. 18(2-4): 159-174 (1996) - [c9]Robert F. Stärk:
Call-by-Value, Call-by-Name and the Logic of Values. CSL 1996: 431-445 - [c8]Robert F. Stärk:
Total Correctness of Logic Programs: A Formal Approach. ELP 1996: 237-254 - 1995
- [j5]Robert F. Stärk:
First-order theories for pure Prolog programs with negation. Arch. Math. Log. 34(2): 113-144 (1995) - [c7]Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk:
Loop Checking and the Wll-Founded Semantics. LPNMR 1995: 127-142 - [c6]Robert F. Stärk:
A Transformation of Propositional Prolog Programs into Classical Logic. LPNMR 1995: 302-315 - 1994
- [j4]Robert F. Stärk:
Cut-Property and Negation as Failure. Int. J. Found. Comput. Sci. 5(2): 129-164 (1994) - [j3]Robert F. Stärk:
Input/Output Dependencies of Normal Logic Programs. J. Log. Comput. 4(3): 249-262 (1994) - [c5]Robert F. Stärk:
The Declarative Semantics of the Prolog Selection Rule. LICS 1994: 252-261 - 1993
- [j2]Gerhard Jäger, Robert F. Stärk:
The Defining Power of Stratified and Hierarchical Logic Programs. J. Log. Program. 15(1&2): 55-77 (1993) - 1992
- [c4]Robert F. Stärk:
Negation-Complete Logic Programs. CSL 1992: 403-409 - 1991
- [j1]Robert F. Stärk:
A Complete Axiomatization of the Three-Valued Completion of Logic Programs. J. Log. Comput. 1(6): 811-834 (1991) - 1990
- [c3]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: 354-365
1980 – 1989
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint