Sciweavers

123 search results - page 6 / 25
» Argument graphs and assumption-based argumentation
Sort
View
FOCS
2006
IEEE
14 years 3 months ago
A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
Tomás Feder, Adam Guetz, Milena Mihail, Ami...
ENTCS
2007
101views more  ENTCS 2007»
13 years 9 months ago
Inequational Deduction as Term Graph Rewriting
Multi-algebras allow to model nondeterminism in an algebraic framework by interpreting operators as functions from individual arguments to sets of possible results. We propose a s...
Andrea Corradini, Fabio Gadducci, Wolfram Kahl, Ba...
DAGSTUHL
1993
13 years 11 months ago
Guaranteeing Safe Destructive Updates Through a Type System with Uniqueness Information for Graphs
In this paper we present a type system for graph rewrite systems: uniqueness typing. It employs usage information to deduce whether an object is `unique' at a certain moment,...
Sjaak Smetsers, Erik Barendsen, Marko C. J. D. van...
JAPLL
2006
114views more  JAPLL 2006»
13 years 9 months ago
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
Bruno Courcelle
RELMICS
1997
Springer
14 years 1 months ago
Relational Matching for Graphical Calculi of Relations
In this paper we extend an earlierapproach to graphicalrelationcalculitowards relational matching, thus allowing proofs with fewer auxiliary steps and concentrating more on the es...
Wolfram Kahl