Sciweavers

1399 search results - page 174 / 280
» Multi-party Finite Computations
Sort
View
CIE
2008
Springer
15 years 6 months ago
An Enhanced Theory of Infinite Time Register Machines
Abstract. Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor step...
Peter Koepke, Russell Miller
CSR
2008
Springer
15 years 6 months ago
The Most General Conservation Law for a Cellular Automaton
Abstract. We study the group-valued and semigroup-valued conservation laws in cellular automata (CA). We provide examples to distinguish between semigroup-valued, group-valued and ...
Enrico Formenti, Jarkko Kari, Siamak Taati
CIE
2010
Springer
15 years 6 months ago
The Limits of Tractability in Resolution-Based Propositional Proof Systems
We study classes of propositional contradictions based on the Least Number Principle (LNP) in the refutation system of Resolution and its generalisations with bounded conjunction, ...
Stefan S. Dantchev, Barnaby Martin
AWPN
2008
232views Algorithms» more  AWPN 2008»
15 years 5 months ago
Synthesis of Petri Nets from Infinite Partial Languages with VipTool
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by ...
Robin Bergenthum, Sebastian Mauser
COMMA
2006
15 years 5 months ago
A dialectic procedure for sceptical, assumption-based argumentation
We present a procedure for computing the sceptical "ideal semantics" for argumentation in assumption-based frameworks. This semantics was first proposed for logic program...
Phan Minh Dung, Paolo Mancarella, Francesca Toni