Sciweavers

1146 search results - page 143 / 230
» Finite cupping sets
Sort
View
CIE
2010
Springer
13 years 11 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
FOSSACS
2008
Springer
13 years 11 months ago
Symbolic Semantics Revisited
Abstract. Symbolic bisimulations were introduced as a mean to define value-passing process calculi using smaller, possibly finite labelled transition systems, equipped with symboli...
Filippo Bonchi, Ugo Montanari
AWPN
2008
232views Algorithms» more  AWPN 2008»
13 years 11 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
DAGSTUHL
2008
13 years 11 months ago
Transfinite Interpolation for Well-Definition in Error Analysis in Solid Modelling
An overall approach to the problem of error analysis in the context of solid modelling, analogous to the standard forward/backward error analysis of Numerical Analysis, was describ...
Neil F. Stewart, Malika Zidani
NIPS
2008
13 years 11 months ago
Particle Filter-based Policy Gradient in POMDPs
Our setting is a Partially Observable Markov Decision Process with continuous state, observation and action spaces. Decisions are based on a Particle Filter for estimating the bel...
Pierre-Arnaud Coquelin, Romain Deguest, Rém...