PLILP
1994
Springer
14 years 1 months ago
1994
Springer
We present a strategy to derive an efficient reference count garbage collector for any applicative program by only modifying it on the source code level. The key to the approach is...
TPHOL
1991
IEEE
14 years 1 months ago
1991
IEEE
D ABSTRACT) Ramayya Kumar, Thomas Kropf, Klaus Schneider University of Karlsruhe,Institute of ComputerDesign and Fault Tolerance (Prof.Dr.D. Schmid) P.O. Box 6980, W-7500 Karlsruhe...
PLILP
1991
Springer
14 years 1 months ago
1991
Springer
PLILP
1991
Springer
14 years 1 months ago
1991
Springer
PLILP
1991
Springer
14 years 1 months ago
1991
Springer
NIL
1991
14 years 1 months ago
1991
In this paper we continue investigations of proof theory of default logic. It turns out that, similarly to classical logic, default theories can be represented in normal forms.
NIL
1991
14 years 1 months ago
1991
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
LPNMR
1991
Springer
14 years 1 months ago
1991
Springer
LPAR
1991
Springer
14 years 1 months ago
1991
Springer
LICS
1991
IEEE
14 years 1 months ago
1991
IEEE
Starting from a logic which speci es how to make deductions from a set of sentences (a ` at theory'), a way to generalise this toa partiallyordered bag ofsentences (a `struct...