Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Paul Tarau"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 306, Iss Proc. ICLP 2019, Pp 224-237 (2019)
In recent years, stream processing has become a prominent approach for incrementally handling large amounts of data, with special support and libraries in many programming languages. Unfortunately, support in Prolog has so far been lacking and most e
Externí odkaz:
https://doaj.org/article/996cc3f57d7540a0a068e90b570a989b
Autor:
Paul Tarau
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 345:141-154
We introduce Natlog, a lightweight Logic Programming language, sharing Prolog's unification-driven execution model, but with a simplified syntax and semantics. Our proof-of-concept Natlog implementation is tightly embedded in the Python-based deep-le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c1546b88c34795c1ce3a7959dee4ffc
https://doi.org/10.4204/eptcs.345.27
https://doi.org/10.4204/eptcs.345.27
Autor:
PAUL TARAU
With help of a compact Prolog-based theorem prover for Intuitionistic Propositional Logic, we synthesize minimal assumptions under which a given formula formula becomes a theorem. After applying our synthesis algorithm to cover basic abductive reason
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f4526f1896e56182d894bae439477e0f
http://arxiv.org/abs/2205.05728
http://arxiv.org/abs/2205.05728
Autor:
Paul Tarau
Publikováno v:
Fundamenta Informaticae. 177:385-415
Contrary to several other families of lambda terms, no closed formula or generating function is known and none of the sophisticated techniques devised in analytic combinatorics can currently help with counting or generating the set of simply-typed cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::469031796cca9da45a8c21a832d50cd7
https://doi.org/10.3233/fi-2020-1994
https://doi.org/10.3233/fi-2020-1994
Autor:
Eduardo Blanco, Paul Tarau
Publikováno v:
Theory and Practice of Logic Programming. 21:244-263
On top of a neural network-based dependency parser and a graph-based natural language processing module we design a Prolog-based dialog engine that explores interactively a ranked fact database extracted from a text document. We reorganize dependency
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ddeb3efcf747a5e57ba79b66005af88
https://doi.org/10.1017/s1471068420000137
https://doi.org/10.1017/s1471068420000137
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 306, Iss Proc. ICLP 2019, Pp 224-237 (2019)
In recent years, stream processing has become a prominent approach for incrementally handling large amounts of data, with special support and libraries in many programming languages. Unfortunately, support in Prolog has so far been lacking and most e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c85f3d6e07f6b004aa8da45e112786f3
https://doaj.org/article/996cc3f57d7540a0a068e90b570a989b
https://doaj.org/article/996cc3f57d7540a0a068e90b570a989b
Autor:
Paul Tarau
Publikováno v:
Logic-Based Program Synthesis and Transformation ISBN: 9783030684457
LOPSTR
LOPSTR
We propose a mechanism for automating discovery of definitions, that, when added to a logic system for which we have a theorem prover, extends it to support an embedding of a new logic system into it. As a result, the synthesized definitions, when ad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c025af0e4349c3eb4a517946d0b67780
https://doi.org/10.1007/978-3-030-68446-4_17
https://doi.org/10.1007/978-3-030-68446-4_17
Autor:
Paul Tarau
Publikováno v:
Practical Aspects of Declarative Languages ISBN: 9783030674373
PADL
PADL
We describe a family of program transformations that compile a Horn Clause program into equivalent programs of a simpler and more regular structure.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c87bc4686a92638bb82b02bb36ff0318
https://doi.org/10.1007/978-3-030-67438-0_1
https://doi.org/10.1007/978-3-030-67438-0_1
Publikováno v:
Flexible Query Answering Systems ISBN: 9783030869663
FQAS
FQAS
Today’s deep learning dominates the field of natural language processing (NLP) with text graph-based approaches being another promising approach. However, both have inherent weaknesses. We present our system called DocTalk that brings together a mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50d799b11dac7420e436140c9e81ae2c
https://doi.org/10.1007/978-3-030-86967-0_14
https://doi.org/10.1007/978-3-030-86967-0_14
Autor:
Paul Tarau, Valeria de Paiva
The problem we want to solve is how to generate all theorems of a given size in the implicational fragment of propositional intuitionistic linear logic. We start by filtering for linearity the proof terms associated by our Prolog-based theorem prover
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b9e12750a380f5a609471991540f3e97
http://arxiv.org/abs/2009.10241
http://arxiv.org/abs/2009.10241