644 search results - page 76 / 129 » Precedence Automata and Languages |
154
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
157
click to vote
AAAI
2007
15 years 7 months ago
2007
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
143
Voted
ICML
2009
IEEE
15 years 11 months ago
2009
IEEE
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...
155
Voted
STOC
2010
ACM
16 years 1 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
148
click to vote
ICGI
2004
Springer
15 years 10 months ago
2004
Springer
We present a method for modeling user navigation on a web site using grammatical inference of stochastic regular grammars. With this method we achieve better models than the previo...