( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Demonstration of a Natural Language Query Interface to an Event-Based Semantic Web Triplestore.

, , , , и . ESWC (Satellite Events), том 8798 из Lecture Notes in Computer Science, стр. 343-348. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Richard A Marquard

Richard A Himmelmann

Richard A Beth

Richard A Taylor

Richard A Hürzeler

 

Другие публикации лиц с тем же именем

A New Approach for Processing Natural-Language Queries to Semantic Web Triplestores., и . WEBIST (Revised Selected Papers), том 399 из Lecture Notes in Business Information Processing, стр. 168-194. Springer, (2019)An Event-Driven Approach for Querying Graph-Structured Data Using Natural Language., , , и . EDBT/ICDT Workshops, том 1133 из CEUR Workshop Proceedings, стр. 192-199. CEUR-WS.org, (2014)An Event Based Denotational Semantics for Natural Language Queries to Data Represented in Triple Stores., , и . ICSC, стр. 142-145. IEEE Computer Society, (2013)An Efficient Denotational Semantics for Natural Language Database Queries., и . NLDB, том 4592 из Lecture Notes in Computer Science, стр. 12-24. Springer, (2007)A Natural-Language Speech Interface Constructed Entirely as a Set of Executable Specifications.. AAAI/IAAI, стр. 908-909. AAAI Press / The MIT Press, (1999)Accommodating Negation in an Efficient Event-based Natural Language Query Interface to the Semantic Web., и . WEBIST, стр. 83-92. SCITEPRESS, (2020)Supporting the Attribute Grammar Programming Paradigm in a Lazy Funciontal Programming Language., и . Functional Programming, Concurrency, Simulation and Automated Reasoning, том 693 из Lecture Notes in Computer Science, стр. 278-295. Springer, (1993)Constructing programs in a calculus of lazy interpreters.. Formal Methods in Software Development, стр. 30-41. ACM, (1990)Using Memoization to Achieve Polynomial Complexity of Purely Functional Executable Specifications of Non-Deterministic Top-Down Parsers.. ACM SIGPLAN Notices, 29 (4): 23-30 (1994)Application programming as the construction of language interpreters.. ACM SIGPLAN Notices, 24 (9): 142-151 (1989)