Sciweavers

208 search results - page 8 / 42
» On an undecidable problem related to difference equations wi...
Sort
View
FOSSACS
2004
Springer
14 years 5 days ago
On the Expressiveness of Infinite Behavior and Name Scoping in Process Calculi
In the literature there are several CCS-like process calculi differing in the constructs for the specification of infinite behavior and in the scoping rules for channel names. In t...
Pablo Giambiagi, Gerardo Schneider, Frank D. Valen...
JAPLL
2010
111views more  JAPLL 2010»
13 years 3 months ago
The complexity of satisfiability for fragments of hybrid logic - Part I
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
Arne Meier, Martin Mundhenk, Thomas Schneider 0002...
IJCAI
2007
13 years 10 months ago
A Theoretical Framework for Learning Bayesian Networks with Parameter Inequality Constraints
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat ...
AUTOMATICA
2010
127views more  AUTOMATICA 2010»
13 years 6 months ago
Partitioning datasets based on equalities among parameters
When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same p...
Riccardo Porreca, Giancarlo Ferrari-Trecate
ICFEM
2010
Springer
13 years 7 months ago
Automating Cut-off for Multi-parameterized Systems
Abstract. Verifying that a parameterized system satisfies certain desired properties amounts to verifying an infinite family of the system instances. This problem is undecidable ...
Youssef Hanna, David Samuelson, Samik Basu, Hrides...