| Publication | Date of Publication | Type |
|---|
Loop checking and the well-founded semantics
Logic Programming and Nonmonotonic Reasoning | 2022-08-30 | Paper |
A transformation of propositional Prolog programs into classical logic
Logic Programming and Nonmonotonic Reasoning | 2022-08-30 | Paper |
Abstract State Machines 2004. Advances in Theory and Practice
Lecture Notes in Computer Science | 2009-04-30 | Paper |
Abstract State Machines 2004. Advances in Theory and Practice
Lecture Notes in Computer Science | 2009-04-30 | Paper |
Information algebras and consequence operators
Logica Universalis | 2007-04-10 | Paper |
Formal specification and verification of the C\(\#\) thread model
Theoretical Computer Science | 2005-11-01 | Paper |
Formal Methods for Components and Objects
Lecture Notes in Computer Science | 2005-08-22 | Paper |
A high-level modular definition of the semantics of C\(_{\sharp}\)
Theoretical Computer Science | 2005-06-10 | Paper |
A logic for secure memory access of abstract state machines
Theoretical Computer Science | 2005-06-10 | Paper |
Axioms for strict and lazy functional programs
Annals of Pure and Applied Logic | 2005-04-21 | Paper |
| Abstract State Machines | 2003-10-01 | Paper |
Completeness of a bytecode verifier and a certifying Java-to-JVM compiler
Journal of Automated Reasoning | 2003-09-09 | Paper |
| scientific article; zbMATH DE number 1951194 (Why is no real title available?) | 2003-07-21 | Paper |
| scientific article; zbMATH DE number 1841822 (Why is no real title available?) | 2002-12-04 | Paper |
| scientific article; zbMATH DE number 1650458 (Why is no real title available?) | 2001-09-23 | Paper |
| scientific article; zbMATH DE number 1354156 (Why is no real title available?) | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1354157 (Why is no real title available?) | 1999-10-28 | Paper |
Why the constant ‘undefined’? Logics of partial terms for strict and non-strict functional programming languages
Journal of Functional Programming | 1999-08-08 | Paper |
The theoretical foundations of LPTP (a logic program theorem prover)
The Journal of Logic Programming | 1999-04-19 | Paper |
| scientific article; zbMATH DE number 1215501 (Why is no real title available?) | 1998-10-26 | Paper |
Multi-valued autoepistemic logic
Annals of Mathematics and Artificial Intelligence | 1998-03-04 | Paper |
| scientific article; zbMATH DE number 1086682 (Why is no real title available?) | 1997-11-13 | Paper |
| scientific article; zbMATH DE number 956484 (Why is no real title available?) | 1996-12-11 | Paper |
| scientific article; zbMATH DE number 922631 (Why is no real title available?) | 1996-09-01 | Paper |
CUT-PROPERTY AND NEGATION AS FAILURE
International Journal of Foundations of Computer Science | 1995-07-11 | Paper |
First-order theories for pure Prolog programs with negation
Archive for Mathematical Logic | 1995-07-05 | Paper |
Input/Output Dependencies of Normal Logic Programs
Journal Of Logic And Computation | 1994-10-10 | Paper |
| scientific article; zbMATH DE number 512988 (Why is no real title available?) | 1994-03-10 | Paper |
| scientific article; zbMATH DE number 515746 (Why is no real title available?) | 1994-03-10 | Paper |
The defining power of stratified and hierarchical logic programs
The Journal of Logic Programming | 1993-05-16 | Paper |
A Complete Axiomatization of the Three valued Completion of Logic Programs
Journal Of Logic And Computation | 1992-06-28 | Paper |
