Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Gérard Becher"'
Publikováno v:
Aspects de l’itération
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed4fbca67b9f9feb7e6556688c9bf572
https://doi.org/10.3726/978-3-0352-0215-1/2
https://doi.org/10.3726/978-3-0352-0215-1/2
Publikováno v:
Aspects de l’itération
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a42e5b78a24cddda1a890610cdd1a66
https://doi.org/10.3726/978-3-0352-0215-1/6
https://doi.org/10.3726/978-3-0352-0215-1/6
Publikováno v:
Aspects de l’itération
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::188ab60bf7cda772a39c3b4888c3765d
https://doi.org/10.3726/978-3-0352-0215-1/5
https://doi.org/10.3726/978-3-0352-0215-1/5
Publikováno v:
Aspects de l’itération
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76f688cb54c1423ef931d430c8d71e1b
https://doi.org/10.3726/978-3-0352-0215-1/4
https://doi.org/10.3726/978-3-0352-0215-1/4
Publikováno v:
Computational Intelligence. 16:137-168
This paper addresses the problem of granularity in temporal representation in the context of text analysis. In contrast with other fields where granularity levels are essentially quantitative, in natural language the different levels are not always p
Publikováno v:
Aspects de l’itération
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::622efd4448bb82a00c60abaa8abcf882
https://doi.org/10.3726/978-3-0352-0215-1
https://doi.org/10.3726/978-3-0352-0215-1
Publikováno v:
TIME
We propose a model for dealing with time granularity in natural language. In contrast with many other fields where granularity levels are essentially quantitative, in natural language we are confronted with a more subtle and qualitative kind of granu
Autor:
Gérard Becher
Publikováno v:
Theorem Proving with Analytic Tableaux and Related Methods ISBN: 9783540612087
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e675ca588729a9d64cf884be3cb6a5f
https://doi.org/10.1007/3-540-61208-4_6
https://doi.org/10.1007/3-540-61208-4_6
Autor:
Gérard Becher, Uwe Petermann
Publikováno v:
KI-94: Advances in Artificial Intelligence ISBN: 9783540584674
KI
KI
This paper addresses the problem of computing complete sets of rigid-E-unifiers, initially introduced by Gallier, Narendran, Plaisted and Snyder who gave a proof of its NP-completeness. Our algorithm is based on completion and on a variant of basic p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4757eff5f5a5b1fb0cfe8a7a87641377
https://doi.org/10.1007/3-540-58467-6_28
https://doi.org/10.1007/3-540-58467-6_28