Sciweavers

Share
BIRTHDAY
2005
Springer
9 years 3 months ago
Observing Reductions in Nominal Calculi Via a Graphical Encoding of Processes
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...
Fabio Gadducci, Ugo Montanari
BIRTHDAY
2005
Springer
9 years 3 months ago
a-logic
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...
Murdoch Gabbay, Michael Gabbay
BIRTHDAY
2005
Springer
9 years 3 months ago
Natural Language Proof Explanation
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...
Armin Fiedler
BIRTHDAY
2005
Springer
9 years 3 months ago
Mathematical Foundations of Answer Set Programming
Paolo Ferraris, Vladimir Lifschitz
BIRTHDAY
2005
Springer
9 years 3 months ago
Simulating Algebraic High-Level Nets by Parallel Attributed Graph Transformation
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 ...
Claudia Ermel, Gabriele Taentzer, Roswitha Bardohl
BIRTHDAY
2005
Springer
9 years 3 months ago
Flexible Interconnection of Graph Transformation Modules
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...
Gregor Engels, Reiko Heckel, Alexey Cherchago
BIRTHDAY
2005
Springer
9 years 3 months ago
Agents with Exact Foreknowledge
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...
Jim Doran
BIRTHDAY
2005
Springer
9 years 3 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
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...
Jürgen Dix, Ugur Kuter, Dana S. Nau
BIRTHDAY
2005
Springer
9 years 3 months ago
Classical Natural Deduction
Marcello D'Agostino
BIRTHDAY
2005
Springer
9 years 3 months ago
Primitive Rewriting
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...
Nachum Dershowitz
books