The existence of r ‐golf designs

Autor: Xiangqian Li, Yanxun Chang, Junling Zhou

Publikováno v: Journal of Combinatorial Designs. 29:243-266

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bb78287b278016c1c325cc46e0a7a008
https://doi.org/10.1002/jcd.21766

Ontology‐lexicon–based question answering over linked data

Autor: Mehdi Jabalameli, Ahmad Zaeri, Mohammad Ali Nematbakhsh

Publikováno v: ETRI Journal, Vol 42, Iss 2, Pp 239-246 (2020)

Recently, Linked Open Data has become a large set of knowledge bases. Therefore, the need to query Linked Data using question answering (QA) techniques has attracted the attention of many researchers. A QA system translates natural language questions

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8e0297d09eec553d06723976cb016dd0
https://doaj.org/article/fa8bbbc2337d48d7b218e80b5fef9eba

Minkowski sum computation for planar freeform geometric models using $$G^1$$-biarc approximation and interior disk culling

Autor: Seung-Hyun Yoon, Myung Soo Kim, Gershon Elber, Sangjun Han

Publikováno v: The Visual Computer. 35:921-933

We present an efficient algorithm for computing the Minkowski sum of two planar geometric models bounded by B-spline curves. The boundary curves are first approximated by $$G^1$$ -biarc splines within a given error bound $$\epsilon > 0$$ . A superset

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::2c211499c1b29a235892f8e68d35d1e0
https://doi.org/10.1007/s00371-019-01687-6

Escaping geodesics in Riemannian surfaces with variable negative curvature

Autor: María V. Melián, Eva Tourís, José M. Rodríguez

Publikováno v: Advances in Mathematics. 345:928-971

In this paper we give a lower bound for the visual Hausdorff dimension of the geodesics escaping through different ends of Riemannian surfaces with pinched negative curvature. This allows to show that in any Riemannian surface with pinched negative c

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a42d1326d5e2ace2db11b90d3904c434
https://doi.org/10.1016/j.aim.2019.01.032

Inductive Benchmarks for Automated Reasoning

Autor: Johannes Schoisswohl, Marton Hajdu, Petra Hozzová, Laura Kovács, Andrei Voronkov

Publikováno v: Intelligent Computer Mathematics-14th International Conference, CICM 2021, Timisoara, Romania, July 26–31, 2021, Proceedings
Lecture Notes in Computer Science ISBN: 9783030810962
CICM
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Intelligent Computer Mathematics

We present a large set of benchmarks for automated theorem provers that require inductive reasoning. Motivated by the need to compare first-order theorem provers, SMT solvers and inductive theorem provers, the setting of our examples follows the SMT-

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c8f0db16191fea20aad0cf8ed526d6c