Travelled to:1 × Italy
1 × The Netherlands
2 × France
2 × Germany
Collaborated with:∅ S.Nanchen
Talks about:logic (6) complet (3) program (2) valu (2) call (2) autoepistem (1) quantifi (1) fixpoint (1) abstract (1) resolut (1)
Person: Robert F. Stärk
DBLP: St=auml=rk:Robert_F=
Contributed to:
20011996
1994199219901989Wrote 7 papers:
- CSL-2001-StarkN #logic #state machine
- A Logic for Abstract State Machines (RFS, SN), pp. 217–231.
- CSL-1996-Stark #call-by #logic
- Call-by-Value, Call-by-Name and the Logic of Values (RFS), pp. 431–445.
- LICS-1994-Stark #declarative #prolog #semantics
- The Declarative Semantics of the Prolog Selection Rule (RFS), pp. 252–261.
- CSL-1992-Stark #logic programming #source code
- Negation-Complete Logic Programs (RFS), pp. 403–409.
- CSL-1990-Stark #fixpoint #logic #on the
- On the Existence of Fixpoints in Moore’s Autoepistemic Logic and the Non-Monotonic Logic of McDermott and Doyle (RFS), pp. 354–365.
- CSL-1989-Stark #proving
- A Direct Proof for the Completeness of SLD-Resolution (RFS), pp. 382–383.
- CSL-1989-Stark89a #logic programming #quantifier #source code
- A Quantifier-Free Completion of Logic Programs (RFS), pp. 384–395.