Sciweavers

1343 search results - page 81 / 269
» Learning Weighted Automata
Sort
View
LATA
2010
Springer
14 years 6 months ago
Using Sums-of-Products for Non-standard Reasoning
Abstract. An important portion of the current research in Description Logics is devoted to the expansion of the reasoning services and the developement of algorithms that can adequ...
Rafael Peñaloza
ECAI
2004
Springer
14 years 4 months ago
Reasoning in Description Logics with a Concrete Domain in the Framework of Resolution
In description logics, concrete domains are used to model concrete properties such as weight, name, or age, having concrete values such as integers or strings, with built-in predic...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
DSD
2005
IEEE
96views Hardware» more  DSD 2005»
14 years 1 months ago
Improvement of the Fault Coverage of the Pseudo-Random Phase in Column-Matching BIST
Several methods improving the fault coverage in mixed-mode BIST are presented in this paper. The test is divided into two phases: the pseudo-random and deterministic. Maximum of f...
Peter Filter, Hana Kubatova
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 11 months ago
Simulation vs. Equivalence
For several semirings S, two weighted finite automata with multiplicities in S are equivalent if and only if they can be connected by a chain of simulations. Such a semiring S is c...
Zoltán Ésik, Andreas Maletti
ENTCS
2006
99views more  ENTCS 2006»
13 years 11 months ago
Metrics for Action-labelled Quantitative Transition Systems
This paper defines action-labelled quantitative transition systems as a general framework for combining qualitative and quantitative analysis. We define state-metrics as a natural...
Yuxin Deng, Tom Chothia, Catuscia Palamidessi, Jun...