BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. State-of-the-art proof presentation systems suffer from several deficiencies. First, they simply present the proofs without motivating why the proof is done as it is do...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
The “classical” approach to represent Petri nets by graph transformation systems is to translate each transition of a specific Petri net to a graph rule (behavior rule). This ...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Modularization is a well-known concept to structure software systems as well as their specifications. Modules are equipped with export and import interfaces and thus can be connec...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
BIRTHDAY
2005
Springer
13 years 10 months ago
2005
Springer
Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...