Sciweavers

3239 search results - page 105 / 648
» A Logical Process Calculus
Sort
View
110
Voted
DLOG
2006
15 years 4 months ago
DL Actions with GCIs: a Pragmatic Approach
We recently proposed action formalisms based on description logics (DLs) as decidable fragments of well-established action theories such as the Situation Calculus and the Fluent C...
Hongkai Liu, Carsten Lutz, Maja Milicic, Frank Wol...
JAPLL
2006
87views more  JAPLL 2006»
15 years 3 months ago
Is ZF a hack?: Comparing the complexity of some (formalist interpretations of) foundational systems for mathematics
This paper presents Automath encodings (which also are valid in LF/P) of various kinds of foundations of mathematics. Then it compares these encodings according to their size, to f...
Freek Wiedijk
ENTCS
2002
129views more  ENTCS 2002»
15 years 3 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
139
Voted
ENTCS
2008
100views more  ENTCS 2008»
15 years 3 months ago
A Calculus for Team Automata
Team automata are a formalism for the component-based specification of reactive, distributed systems. Their main feature is a flexible technique for specifying coordination patter...
Maurice H. ter Beek, Fabio Gadducci, Dirk Janssens
TGC
2005
Springer
15 years 8 months ago
A General Name Binding Mechanism
We study fusion and binding mechanisms in name passing process calculi. To this purpose, we introduce the U-Calculus, a process calculus with no I/O polarities and a unique form of...
Michele Boreale, Maria Grazia Buscemi, Ugo Montana...