| A Gaze into the Internal Logic of Graph Neural Networks, with Logic. | 0 | 0.34 | 2022 |
| Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis | 0 | 0.34 | 2022 |
| Natlog: a Lightweight Logic Programming Language with a Neuro-symbolic Touch. | 0 | 0.34 | 2021 |
| Synthesis of Modality Definitions and a Theorem Prover for Epistemic Intuitionistic Logic. | 0 | 0.34 | 2020 |
| Deriving Efficient Sequential And Parallel Generators For Closed Simply-Typed Lambda Terms And Normal Forms | 0 | 0.34 | 2020 |
| Declarative algorithms for generation, counting and random sampling of term algebras. | 1 | 0.35 | 2018 |
| Shaving with Occam's Razor - Deriving Minimalist Theorem Provers for Minimal Logic. | 0 | 0.34 | 2018 |
| Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers. | 1 | 0.35 | 2018 |
| Introduction to the 34-th international conference on logic programming special issue. | 0 | 0.34 | 2018 |
| A Hitchhiker's Guide to Reinventing a Prolog Machine. | 0 | 0.34 | 2017 |
| On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms. | 0 | 0.34 | 2017 |
| Boltzmann Samplers For Closed Simply-Typed Lambda Terms | 4 | 0.47 | 2017 |
| Evaluating Text Summarization Systems with a Fair Baseline from Multiple Reference Summaries. | 0 | 0.34 | 2016 |
| Automatic Question Generation: From NLU to NLG. | 1 | 0.35 | 2016 |
| Infusing NLU into Automatic Question Generation. | 1 | 0.36 | 2016 |
| A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms. | 1 | 0.35 | 2016 |
| Random generation of closed simply-typed $λ$-terms: a synergy between logic programming and Boltzmann samplers. | 0 | 0.34 | 2016 |
| Anti-Summaries: Enhancing Graph-Based Techniques For Summary Extraction With Sentiment Polarity | 0 | 0.34 | 2015 |
| On Synergies between Type Inference, Generation and Normalization of SK-Combinator Trees. | 0 | 0.34 | 2015 |
| A Logic Programming Playground for Lambda Terms, Combinators, Types and Tree-based Arithmetic Computations | 1 | 0.36 | 2015 |
| On Type-directed Generation of Lambda Terms. | 4 | 0.47 | 2015 |
| On Logic Programming Representations of Lambda Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization | 5 | 0.50 | 2015 |
| On a uniform representation of combinators, arithmetic, lambda terms and types | 5 | 0.50 | 2015 |
| Arithmetic And Boolean Operations On Recursively Run-Length Compressed Natural Numbers | 2 | 0.39 | 2014 |
| Interclausal Logic Variables. | 0 | 0.34 | 2014 |
| Text summarization as an assistive technology | 1 | 0.35 | 2014 |
| A Generic Numbering System based on Catalan Families of Combinatorial Objects. | 4 | 0.47 | 2014 |
| A Declarative Specification of Giant Number Arithmetic | 0 | 0.34 | 2014 |
| The Arithmetic of Recursively Run-Length Compressed Natural Numbers. | 2 | 0.46 | 2014 |
| Computing with Catalan Families. | 2 | 0.42 | 2014 |
| Binary trees as a computational framework | 2 | 0.41 | 2013 |
| Tree-based Arithmetic and Compressed Representations of Giant Numbers | 0 | 0.34 | 2013 |
| Two mechanisms for generating infinite families of pairing bijections | 0 | 0.34 | 2013 |
| Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings). | 3 | 0.41 | 2013 |
| Binary Tree Arithmetic with Generalized Constructors | 0 | 0.34 | 2013 |
| Computing with Free Algebras | 1 | 0.37 | 2012 |
| A declarative specification of tree-based symbolic arithmetic computations | 0 | 0.34 | 2012 |
| On computing with types | 7 | 0.74 | 2012 |
| Deriving a Fast Inverse of the Generalized Cantor N-tupling Bijection. | 0 | 0.34 | 2012 |
| Symbolic modeling of a universal reconfigurable logic gate and its applications to circuit synthesis | 0 | 0.34 | 2012 |
| Boolean Evaluation with a Pairing and Unpairing Function | 2 | 0.38 | 2012 |
| Bijective Term Encodings | 0 | 0.34 | 2011 |
| Coordination and concurrency in multi-engine prolog | 4 | 0.40 | 2011 |
| Integrated symbol table, engine and heap memory management in multi-engine prolog | 2 | 0.37 | 2011 |
| Computing with Hereditarily Finite Sequences | 0 | 0.34 | 2011 |
| Emulating primality with multiset representations of natural numbers | 1 | 0.36 | 2011 |
| The binprolog experience: Architecture and implementation choices for continuation passing prolog and first-class logic engines | 1 | 0.36 | 2011 |
| Declarative modeling of finite mathematics | 11 | 0.84 | 2010 |
| On arithmetic computations with hereditarily finite sets, functions and types | 1 | 0.38 | 2010 |
| A unified formal description of arithmetic and set theoretical data types | 2 | 0.45 | 2010 |
