Sciweavers

Share
4 search results - page 1 / 1
» nil 1991
Sort
View
NIL
1991
9 years 10 months ago
Normal Form Results for Default Logic
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.
V. Wiktor Marek, Miroslaw Truszczynski
NIL
1991
9 years 10 months ago
Deduction with Supernormal Defaults
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...
Stefan Brass
MFCS
1991
Springer
9 years 10 months ago
CCS Dynamic Bisimulation is Progressing
Weak Observational Congruence (woc) defined on CCS agents is not a bisimulation since it does not require two states reached by bisimilar computations of woc agents to be still w...
Ugo Montanari, Vladimiro Sassone
ITA
2007
153views Communications» more  ITA 2007»
9 years 7 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
books