Sciweavers

1194 search results - page 143 / 239
» A Calculus for Predicative Programming
Sort
View
ICLP
1997
Springer
15 years 4 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
AAAI
1996
15 years 1 months ago
Formalizing Narratives Using Nested Circumscription
The representation of narratives of actions and observations is a current issue in Knowledge Representation, where traditional plan-oriented treatments of action seem to fall shor...
Chitta Baral, Alfredo Gabaldon, Alessandro Provett...
ACSD
2005
IEEE
153views Hardware» more  ACSD 2005»
15 years 5 months ago
BoPi - A Distributed Machine for Experimenting Web Services Technologies
BoPi is a programming language with a runtime support that allows the distribution and the execution of programs over the network. The language is a process calculus with XML valu...
Samuele Carpineti, Cosimo Laneve, Paolo Milazzo
77
Voted
ICALP
2010
Springer
15 years 4 months ago
Model Checking Succinct and Parametric One-Counter Automata
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
Stefan Göller, Christoph Haase, Joël Oua...
ICALP
2010
Springer
15 years 4 months ago
On Bisimilarity and Substitution in Presence of Replication
Abstract. We prove a new congruence result for the π-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level r...
Daniel Hirschkoff, Damien Pous