Zobrazeno 1 - 10
of 180
pro vyhledávání: '"Tarau, Paul"'
Autor:
Tarau, Paul
Dual Horn clauses mirror key properties of Horn clauses. This paper explores the ``other side of the looking glass'' to reveal some expected and unexpected symmetries and their practical uses. We revisit Dual Horn clauses as enablers of a form of con
Externí odkaz:
http://arxiv.org/abs/2407.20413
Autor:
Tarau, Paul
Publikováno v:
EPTCS 385, 2023, pp. 141-154
Driven by expressiveness commonalities of Python and our Python-based embedded logic-based language Natlog, we design high-level interaction patterns between equivalent language constructs and data types on the two sides. By directly connecting gener
Externí odkaz:
http://arxiv.org/abs/2308.15890
Autor:
Tarau, Paul
We automate deep step-by step reasoning in an LLM dialog thread by recursively exploring alternatives (OR-nodes) and expanding details (AND-nodes) up to a given depth. Starting from a single succinct task-specific initiator we steer the automated dia
Externí odkaz:
http://arxiv.org/abs/2306.14077
Autor:
Tarau, Paul
Publikováno v:
EPTCS 364, 2022, pp. 93-106
Graph Neural Networks share with Logic Programming several key relational inference mechanisms. The datasets on which they are trained and evaluated can be seen as database facts containing ground terms. This makes possible modeling their inference m
Externí odkaz:
http://arxiv.org/abs/2208.03093
Autor:
Tarau, Paul
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:
http://arxiv.org/abs/2205.05728
Autor:
Tarau, Paul
Publikováno v:
EPTCS 345, 2021, pp. 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:
http://arxiv.org/abs/2109.08291
Autor:
Tarau, Paul, de Paiva, Valeria
Publikováno v:
EPTCS 325, 2020, pp. 110-123
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:
http://arxiv.org/abs/2009.10241
Autor:
Tarau, Paul, Blanco, Eduardo
Publikováno v:
Theory and Practice of Logic Programming 21 (2021) 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:
http://arxiv.org/abs/2008.00956
Autor:
Tarau, Paul
We develop combinatorial test generation algorithms for progressively more powerful theorem provers, covering formula languages ranging from the implicational fragment of intuitionistic logic to full intuitionistic propositional logic. Our algorithms
Externí odkaz:
http://arxiv.org/abs/1910.01775
Autor:
Tarau, Paul, Blanco, Eduardo
We build a bridge between neural network-based machine learning and graph-based natural language processing and introduce a unified approach to keyphrase, summary and relation extraction by aggregating dependency graphs from links provided by a deep-
Externí odkaz:
http://arxiv.org/abs/1909.09742