default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Tarau
Person information
- affiliation: University of North Texas, Denton, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c118]Paul Tarau
:
System Description: DeepLLM, Casting Dialog Threads into Logic Programs. FLOPS 2024: 117-134- [c117]Paul Tarau:
On Teaching Logic Programming in the Era of Generative AI. ICLP Workshops 2024 - [i33]Paul Tarau:
Through the Looking Glass, and what Horn Clause Programs Found There. CoRR abs/2407.20413 (2024) - 2023
- [c116]Paul Tarau:
Natlog: Embedding Logic Programming into the Python Deep-Learning Ecosystem. ICLP 2023: 141-154 - [p3]Paul Tarau:
Reflections on Automation, Learnability and Expressiveness in Logic-Based Programming Languages. Prolog: The Next 50 Years 2023: 359-371 - [i32]Paul Tarau:
Full Automation of Goal-driven LLM Dialog Threads with And-Or Recursors and Refiner Oracles. CoRR abs/2306.14077 (2023) - 2022
- [j17]Paul Tarau:
Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis. Theory Pract. Log. Program. 22(5): 693-707 (2022) - [c115]Yifan Guo, David Brock, Alicia Lin, Tam Doan, Ali Khan, Paul Tarau:
Dependency Graphs for Summarization and Keyphrase Extraction: We present a real-time long document summarization and key-phrase extraction algorithm that utilizes a unified dependency graph. NLPIR 2022: 181-186 - [c114]Paul Tarau:
A Gaze into the Internal Logic of Graph Neural Networks, with Logic. ICLP Technical Communications / Doctoral Consortium 2022: 93-106 - [i31]Paul Tarau:
Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis. CoRR abs/2205.05728 (2022) - 2021
- [j16]Paul Tarau, Eduardo Blanco:
Interactive Text Graph Mining with a Prolog-Based Dialog Engine. Theory Pract. Log. Program. 21(2): 244-263 (2021) - [c113]Yifan Guo, Weilun Sun, Ali Khan, Tam Doan, Paul Tarau:
DocTalk: Combining Dependency-Based Text Graphs and Deep Learning into a Practical Dialog Engine. FQAS 2021: 182-195 - [c112]Paul Tarau:
A Family of Unification-Oblivious Program Transformations and Their Applications. PADL 2021: 3-19 - [c111]Paul Tarau:
Natlog: a Lightweight Logic Programming Language with a Neuro-symbolic Touch. ICLP Technical Communications 2021: 141-154 - 2020
- [j15]Paul Tarau:
Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms. Fundam. Informaticae 177(3-4): 385-415 (2020) - [c110]Paul Tarau:
Synthesis of Modality Definitions and a Theorem Prover for Epistemic Intuitionistic Logic. LOPSTR 2020: 329-344 - [c109]Paul Tarau, Eduardo Blanco:
Interactive Text Graph Mining with a Prolog-based Dialog Engine. PADL 2020: 3-19 - [c108]Paul Tarau, Valeria de Paiva:
Deriving Theorems in Implicational Linear Logic, Declaratively. ICLP Technical Communications 2020: 110-123 - [i30]Paul Tarau, Eduardo Blanco:
Interactive Text Graph Mining with a Prolog-based Dialog Engine. CoRR abs/2008.00956 (2020)
2010 – 2019
- 2019
- [c107]Paul Tarau:
A Combinatorial Testing Framework for Intuitionistic Propositional Theorem Provers. PADL 2019: 115-132 - [c106]Paul Tarau, Jan Wielemaker, Tom Schrijvers:
Lazy Stream Programming in Prolog. ICLP Technical Communications 2019: 224-237 - [i29]Paul Tarau:
Modality Definition Synthesis for Epistemic Intuitionistic Logic via a Theorem Prover. CoRR abs/1907.11838 (2019) - [i28]Paul Tarau, Eduardo Blanco:
Dependency-based Text Graphs for Keyphrase and Summary Extraction with Applications to Interactive Content Retrieval. CoRR abs/1909.09742 (2019) - [i27]Paul Tarau:
Formula Transformers and Combinatorial Test Generators for Propositional Intuitionistic Theorem Provers. CoRR abs/1910.01775 (2019) - 2018
- [j14]Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau:
Random generation of closed simply typed λ-terms: A synergy between logic programming and Boltzmann samplers. Theory Pract. Log. Program. 18(1): 97-119 (2018) - [j13]Alessandro Dal Palù, Paul Tarau:
Introduction to the 34-th international conference on logic programming special issue. Theory Pract. Log. Program. 18(3-4): 296-300 (2018) - [c105]Paul Tarau:
On k-colored Lambda Terms and Their Skeletons. PADL 2018: 116-131 - [c104]Paul Tarau:
Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic. RCRA@FLoC 2018 - [c103]Paul Tarau:
Declarative algorithms for generation, counting and random sampling of term algebras. SAC 2018: 1203-1210 - [e3]Alessandro Dal Palù, Paul Tarau, Neda Saeedloei, Paul Fodor:
Technical Communications of the 34th International Conference on Logic Programming, ICLP 2018, July 14-17, 2018, Oxford, United Kingdom. OASIcs 64, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-090-3 [contents] - 2017
- [c102]Paul Tarau:
A Hitchhiker's Guide to Reinventing a Prolog Machine. ICLP (Technical Communications) 2017: 10:1-10:16 - [c101]Olivier Bodini, Paul Tarau:
On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms. LOPSTR 2017: 252-268 - [c100]Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau:
Boltzmann Samplers for Closed Simply-Typed Lambda Terms. PADL 2017: 120-135 - [i26]Olivier Bodini, Paul Tarau:
On Uniquely Closable and Uniquely Typable Skeletons of Lambda Terms. CoRR abs/1709.04302 (2017) - 2016
- [c99]Fahmida Hamid, David Haraburda, Paul Tarau:
Evaluating Text Summarization Systems with a Fair Baseline from Multiple Reference Summaries. ECIR 2016: 351-365 - [c98]Karen Mazidi, Paul Tarau:
Infusing NLU into Automatic Question Generation. INLG 2016: 51-60 - [c97]Karen Mazidi, Paul Tarau:
Automatic Question Generation: From NLU to NLG. ITS 2016: 23-33 - [c96]Paul Tarau:
A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms. LOPSTR 2016: 240-255 - [c95]Paul Tarau:
A Size-Proportionate Bijective Encoding of Lambda Terms as Catalan Objects Endowed with Arithmetic Operations. PADL 2016: 99-116 - [c94]Paul Tarau:
Computing with Catalan Families, Generically. PADL 2016: 117-134 - [i25]Paul Tarau:
A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms. CoRR abs/1608.03912 (2016) - [i24]Maciej Bendkowski, Katarzyna Grygiel, Paul Tarau:
Random generation of closed simply-typed $λ$-terms: a synergy between logic programming and Boltzmann samplers. CoRR abs/1612.07682 (2016) - 2015
- [c93]Fahmida Hamid, Paul Tarau:
Anti-Summaries: Enhancing Graph-Based Techniques for Summary Extraction with Sentiment Polarity. CICLing (2) 2015: 375-389 - [c92]Paul Tarau:
On Type-directed Generation of Lambda Terms. ICLP (Technical Communications) 2015 - [c91]Paul Tarau:
Ranking/Unranking of Lambda Terms with Compressed de Bruijn Indices. CICM 2015: 118-133 - [c90]Paul Tarau:
On Logic Programming Representations of Lambda Terms: de Bruijn Indices, Compression, Type Inference, Combinatorial Generation, Normalization. PADL 2015: 115-131 - [c89]Paul Tarau:
On a uniform representation of combinators, arithmetic, lambda terms and types. PPDP 2015: 244-255 - [c88]Paul Tarau:
The Arithmetic of Even-Odd Trees. SYNASC 2015: 90-97 - [c87]Paul Tarau:
On Synergies between Type Inference, Generation and Normalization of SK-Combinator Trees. SYNASC 2015: 160-166 - [i23]Paul Tarau:
A Logic Programming Playground for Lambda Terms, Combinators, Types and Tree-based Arithmetic Computations. CoRR abs/1507.06944 (2015) - 2014
- [j12]Paul Tarau:
Arithmetic and Boolean Operations on Recursively Run-Length Compressed Natural Numbers. Sci. Ann. Comput. Sci. 24(2): 287-323 (2014) - [j11]Paul Tarau:
Towards a generic view of primality through multiset decompositions of natural numbers. Theor. Comput. Sci. 537: 105-124 (2014) - [c86]Paul Tarau:
The Arithmetic of Recursively Run-Length Compressed Natural Numbers. ICTAC 2014: 406-423 - [c85]Paul Tarau:
Computing with Catalan Families. LATA 2014: 565-575 - [c84]Paul Tarau:
A Declarative Specification of Giant Number Arithmetic. PADL 2014: 120-135 - [c83]Fahmida Hamid, Paul Tarau:
Text summarization as an assistive technology. PETRA 2014: 60:1-60:4 - [c82]Paul Tarau:
Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers. PPDP 2014: 31-42 - [c81]Paul Tarau, Bill P. Buckles:
Arithmetic algorithms for hereditarily binary natural numbers. SAC 2014: 1593-1600 - [c80]Paul Tarau:
New Arithmetic Algorithms for Hereditarily Binary Natural Numbers. SYNASC 2014: 109-116 - [i22]Paul Tarau, Fahmida Hamid:
Interclausal Logic Variables. CoRR abs/1406.1393 (2014) - [i21]Paul Tarau:
A Generic Numbering System based on Catalan Families of Combinatorial Objects. CoRR abs/1406.1796 (2014) - 2013
- [j10]David Haraburda, Paul Tarau:
Binary trees as a computational framework. Comput. Lang. Syst. Struct. 39(4): 163-181 (2013) - [j9]Paul Tarau:
Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and Gödel numberings). Theory Pract. Log. Program. 13(4-5): 847-861 (2013) - [c79]Paul Tarau:
Two mechanisms for generating infinite families of pairing bijections. RACS 2013: 57-62 - [i20]Paul Tarau:
Tree-based Arithmetic and Compressed Representations of Giant Numbers. CoRR abs/1301.0114 (2013) - [i19]Paul Tarau:
Binary Tree Arithmetic with Generalized Constructors. CoRR abs/1301.0128 (2013) - [i18]Paul Tarau:
On Two Infinite Families of Pairing Bijections. CoRR abs/1301.0129 (2013) - [i17]Paul Tarau:
Arithmetic Algorithms for Hereditarily Binary Natural Numbers. CoRR abs/1306.1128 (2013) - [i16]Paul Tarau:
A Prolog Specification of Giant Number Arithmetic. CoRR abs/1307.4642 (2013) - 2012
- [j8]Paul Tarau:
The BinProlog experience: Architecture and implementation choices for continuation passing Prolog and first-class logic engines. Theory Pract. Log. Program. 12(1-2): 97-126 (2012) - [c78]Paul Tarau:
Deriving a Fast Inverse of the Generalized Cantor N-tupling Bijection. ICLP (Technical Communications) 2012: 312-322 - [c77]Paul Tarau:
A Declarative Specification of Tree-Based Symbolic Arithmetic Computations. PADL 2012: 273-288 - [c76]Paul Tarau, Arun K. Majumdar, Paulo Moura:
Agent spaces: a scalable architecture for distributed logic agents. RACS 2012: 263-268 - [c75]Paul Tarau, Brenda Luderman:
Symbolic modeling of a universal reconfigurable logic gate and its applications to circuit synthesis. RACS 2012: 389-394 - [c74]Paul Tarau, David Haraburda:
On computing with types. SAC 2012: 1889-1896 - [c73]Paul Tarau:
Computing with Free Algebras. SYNASC 2012: 15-22 - [c72]Paul Tarau, Brenda Luderman:
Boolean Evaluation with a Pairing and Unpairing Function. SYNASC 2012: 384-390 - 2011
- [c71]Paul Tarau:
Coordination and Concurrency in Multi-engine Prolog. COORDINATION 2011: 157-171 - [c70]Paul Tarau:
Emulating Primality with Multiset Representations of Natural Numbers. ICTAC 2011: 218-238 - [c69]Paul Tarau:
Integrated symbol table, engine and heap memory management in multi-engine prolog. ISMM 2011: 129-138 - [c68]Paul Tarau:
Concurrent programming constructs in multi-engine prolog: parallelism just for the cores (and not more!). DAMP 2011: 55-64 - [i15]Paul Tarau:
The BinProlog Experience: Architecture and Implementation Choices for Continuation Passing Prolog and First-Class Logic Engines. CoRR abs/1102.1178 (2011) - [i14]Paul Tarau:
Computing with Hereditarily Finite Sequences. CoRR abs/1112.3782 (2011) - [i13]Paul Tarau:
Bijective Term Encodings. CoRR abs/1112.3788 (2011) - 2010
- [j7]Paul Tarau:
"Everything Is Everything" Revisited: Shapeshifting Data Types with Isomorphisms and Hylomorphisms. Complex Syst. 18(4) (2010) - [c67]Paul Tarau:
A Unified Formal Description of Arithmetic and Set Theoretical Data Types. AISC/MKM/Calculemus 2010: 247-261 - [c66]Paul Tarau:
Hereditarily Finite Representations of Natural Numbers and Self-Delimiting Codes. MSFP@ICFP 2010: 11-18 - [c65]Paul Tarau:
On Arithmetic Computations with Hereditarily Finite Sets, Functions and Types. ICTAC 2010: 367-381 - [c64]Paul Tarau:
Declarative modeling of finite mathematics. PPDP 2010: 131-142 - [i12]Paul Tarau:
A Unified Formal Description of Arithmetic and Set Theoretical Data Types. CoRR abs/1006.5768 (2010)
2000 – 2009
- 2009
- [c63]Paul Tarau:
A Groupoid of Isomorphic Data Transformations. Calculemus/MKM 2009: 170-185 - [c62]Paul Tarau, Arun K. Majumdar:
Interoperating Logic Engines. PADL 2009: 137-151 - [c61]Paul Tarau:
An embedded declarative data transformation language. PPDP 2009: 171-182 - [c60]Paul Tarau:
Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell. SAC 2009: 1898-1902 - 2008
- [c59]Paul Tarau, Brenda Luderman:
Exact combinational logic synthesis and non-standard circuit design. Conf. Computing Frontiers 2008: 179-188 - [c58]Paul Tarau:
Logic Engines as Interactors. ICLP 2008: 703-707 - [c57]Paul Tarau, Brenda Luderman:
Revisiting exact combinational circuit synthesis. SAC 2008: 1758-1759 - [i11]Paul Tarau, Brenda Luderman:
A Logic Programming Framework for Combinational Circuit Synthesis. CoRR abs/0804.2095 (2008) - [i10]Paul Tarau:
Executable Set Theory and Arithmetic Encodings in Prolog. CoRR abs/0808.0540 (2008) - [i9]Paul Tarau:
Ranking and Unranking of Hereditarily Finite Functions and Permutations. CoRR abs/0808.0554 (2008) - [i8]Paul Tarau:
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams. CoRR abs/0808.0555 (2008) - [i7]Paul Tarau:
Logic Engines as Interactors. CoRR abs/0808.0556 (2008) - [i6]Paul Tarau:
Ranking Catamorphisms and Unranking Anamorphisms on Hereditarily Finite Datatypes. CoRR abs/0808.0753 (2008) - [i5]Paul Tarau:
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions. CoRR abs/0808.0754 (2008) - [i4]Paul Tarau:
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell. CoRR abs/0808.0760 (2008) - [i3]Paul Tarau:
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell. CoRR abs/0808.2953 (2008) - 2007
- [c56]Paul Tarau, Brenda Luderman:
A Logic Programming Framework for Combinational Circuit Synthesis. ICLP 2007: 180-194 - 2005
- [c55]Andy Borman, Rada Mihalcea, Paul Tarau:
PicNet: Augmenting Semantic Resources with Pictorial Representations. AAAI Spring Symposium: Knowledge Collection from Volunteer Contributors 2005: 1-7 - [c54]Rada Mihalcea, Paul Tarau:
A Language Independent Algorithm for Single and Multiple Document Summarization. IJCNLP (companion) 2005 - [c53]David Hurt, Paul Tarau:
An empirical evaluation of communication effectiveness in autonomous reactive multiagent systems. SAC 2005: 74-78 - [c52]Paul Tarau, Rada Mihalcea, Elizabeth Figa:
Semantic document engineering with WordNet and PageRank. SAC 2005: 782-786 - [c51]Paul Tarau:
Agent oriented logic programming in Jinni 2004. SAC 2005: 1427-1428 - 2004
- [c50]Elizabeth Figa, Paul Tarau, Jesse Ephraim:
Enhancing the virtual storytelling experience with metadata driven voice enabled conversational agents. ASIST 2004: 403-410 - [c49]Rada Mihalcea, Paul Tarau, Elizabeth Figa:
PageRank on Semantic Networks, with Application to Word Sense Disambiguation. COLING 2004 - [c48]Rada Mihalcea, Paul Tarau:
TextRank: Bringing Order into Text. EMNLP 2004: 404-411 - [c47]Elizabeth Figa, Paul Tarau:
Conversational Agents as Web Services. International Conference on Internet Computing 2004: 773-782 - [c46]Paul Tarau:
Agent Oriented Logic Programming Constructs in Jinni 2004. ICLP 2004: 477-478 - [c45]Paul Tarau, Elizabeth Figa:
Knowledge-based conversational agents and virtual storytelling. SAC 2004: 39-44 - [i2]Paul Tarau, Verónica Dahl:
High-Level Networking With Mobile Code And First Order AND-Continuations. CoRR cs.PL/0405088 (2004) - 2003
- [c44]Elizabeth Figa, Paul Tarau:
Lexical inference mechanisms for text understanding and classification. ASIST 2003: 165-173 - [c43]Qinan Zhou, Paul Tarau:
Garbage Collection Algorithms for Java-Based Prolog Engines. PADL 2003: 304-319 - 2001
- [j6]Paul Tarau, Verónica Dahl:
High-Level Networking with Mobile Code and First Order AND-Continuations. Theory Pract. Log. Program. 1(3): 359-380 (2001) - [c42]Satyam Tyagi, Paul Tarau, Armin R. Mikler:
Multicast Protocols for Jinni Agents. IICS 2001: 1-18 - [c41]Anima Gupta, Paul Tarau:
Logic Programming Techniques for Dynamic VRML Web Content Generation. PADL 2001: 93-107 - [c40]Satyam Tyagi, Paul Tarau:
A Most Specific Method Finding Algorithm for Reflection Based Dynamic Prolog-to-Java Interfaces. PADL 2001: 322-336 - 2000
- [c39]Paul Tarau:
Fluents: A Refactoring of Prolog for Uniform Reflection an Interoperation with External Objects. Computational Logic 2000: 1225-1239
1990 – 1999
- 1999
- [j5]Verónica Dahl, Stephen Rochefort, Marius Scurtescu, Paul Tarau:
A Spanish Interface To LogiMoo: Towards Multilingual Virtual Worlds. Informatica (Slovenia) 23(4) (1999) - [j4]Paul Tarau, Koenraad De Bosschere, Verónica Dahl, Stephen Rochefort:
LogiMOO: An Extensible Multi-user Virtual World with Natural Language Control. J. Log. Program. 38(3): 331-353 (1999) - [c38]Paul Tarau:
Multi-engine Horn Clause Prolog. Parallelism and Implementation Technology for (Constraint) Logic Programming@ICLP 1999: 143 - [p2]Paul Tarau:
Inference and Computation Mobility with Jinni. The Logic Programming Paradigm 1999: 33-52 - [p1]Paul Tarau, Verónica Dahl:
Towards a Logic Programming Infrastructure for Internet Programming. Artificial Intelligence Today 1999: 431-457 - 1998
- [c37]Paul Tarau, Verónica Dahl:
Code Migration with First Order Continuations. APPIA-GULP-PRODE 1998: 215-226 - [c36]Paul Tarau, Verónica Dahl, Koen De Bosschere:
Towards Logic Programming Based Coordination in Virtual Worlds. HICSS (7) 1998: 236-244 - [c35]Paul Tarau:
Jinni: a Lightweight Java-based Logic Engine for Internet Programming. Implementation Technology for Programming Languages based on Logic 1998: 1-15 - [c34]Paul Tarau:
Towards Inference and Computation Mobility: The Jinni Experiment. JELIA 1998: 385-390 - 1997
- [j3]Paul Tarau, Koenraad De Bosschere, Bart Demoen:
On Delphi Lemmas and other Memoing Techniques for Deterministic Logic Programs. J. Log. Program. 30(2): 145-163 (1997) - [c33]Paul Tarau, Verónica Dahl, Stephen Rochefort, Koenraad De Bosschere:
LogiMOO: A Multi-User Virtual World with Agents and Natural Language Programming. CHI Extended Abstracts 1997: 323-324 - [c32]Verónica Dahl, Paul Tarau, Renwei Li:
Assumption Grammars for Processing Natural Language. ICLP 1997: 256-270 - [c31]Osma R. Zaine, Andrew Fall, Stephen Rochefort, Verónica Dahl, Paul Tarau:
On-Une Resource Discovery Using Natural Language. RIAO 1997: 336-355 - [c30]Paul Tarau:
Logic Programming Tools for Advanced Internet Programming (Abstract). ILPS 1997: 33-34 - [c29]Paul Tarau, Verónica Dahl, Koenraad De Bosschere:
A Logic Programming Infrastructure for Remote Execution, Mobile Code and Agents. WETICE 1997: 106-112 - 1996
- [j2]Paul Tarau, Koenraad De Bosschere, Bart Demoen:
Partial Translation: Towards a Portable and Efficient Prolog Implementation Technology. J. Log. Program. 29(1-3): 65-83 (1996) - [j1]Koenraad De Bosschere, Paul Tarau:
Blackboard-based Extensions in Prolog. Softw. Pract. Exp. 26(1): 49-69 (1996) - [c28]Paul Tarau, Verónica Dahl, Koenraad De Bosschere:
Towards Logic Programming Based Coordination in Virtual Worlds. Coordination Technology for Collaborative Applications 1996: 49-62 - [c27]Paul Tarau, Verónica Dahl, Andrew Fall:
Backtrackable State with Linear Affine Implication and Assumption Grammars. ASIAN 1996: 53-63 - [c26]Verónica Dahl, Andrew Fall, Stephen Rochefort, Paul Tarau:
A Hypothetical Reasoning-based Framework for NL Processing. ICTAI 1996: 67-70 - [c25]Bart Demoen, Geert Engels, Paul Tarau:
Segment order preserving copying garbage collection for WAM based Prolog. SAC 1996: 380-386 - 1995
- [c24]Yves Bekkers, Paul Tarau:
Logic Programming with Monads and Comprehensions. JFPLC 1995: 161-171 - [c23]Verónica Dahl, Paul Tarau:
Extending Datalog Grammars. NLDB 1995 - [c22]Paul Tarau, Bart Demoen, Koenraad De Bosschere:
The power of partial tanslation: an experiment with the C-ification of binary Prolog. SAC 1995: 152-156 - [c21]Yves Bekkers, Paul Tarau:
Monadic Constructs for Logic Programming. ILPS 1995: 51-65 - [c20]Paul Tarau, Verónica Dahl, Andrew Fall:
Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars. ILPS 1995: 642 - [i1]Verónica Dahl, Paul Tarau, Lidia Moreno, Manuel Palomar:
Treating Coordination with Datalog Grammars. CoRR cmp-lg/9505006 (1995) - 1994
- [c19]Verónica Dahl, Paul Tarau, Yan-Nong Huang:
Datalog Grammars. GULP-PRODE (2) 1994: 268-282 - [c18]Paul Tarau, Bart Demoen:
Language Embedding by Dual Compilation and State Mirroring. LPE 1994 - [c17]Paul Tarau:
Low-level issues in implementing a high-performance continuation passing Binary Prolog engine. JFPLC 1994: 287- - [c16]Paul Tarau, Verónica Dahl:
Logic Programming and Logic Grammars with First-Order Continuations. LOPSTR 1994: 215-230 - [c15]Paul Tarau, Ulrich Neumerkel:
A Novel Term Compression Scheme and Data Representation in the BinWAM. PLILP 1994: 73-87 - [c14]Koenraad De Bosschere, Paul Tarau:
High performance continuation passing style Prolog-to-C mapping. SAC 1994: 383-387 - [e2]Koenraad De Bosschere, Bart Demoen, Paul Tarau:
ILPS 1994, Workshop 4: Implementation Techniques for Logic Programming Languages, Ithaca, New York, USA, November 17, 1994. 1994 [contents] - 1993
- [c13]Paul Tarau:
Language Issues and Programming Techniques in BinProlog. GULP 1993: 173-188 - [c12]Koenraad De Bosschere, Paul Tarau:
Some Issues in the Implementation of a Unix-based Blackboard. ICLP Workshop on Blackboard-Based Logic Programming 1993 - [c11]Paul Tarau, Koenraad De Bosschere:
Non-Associative Blackboard Programming. ICLP Workshop on Blackboard-Based Logic Programming 1993 - [c10]Paul Tarau, Koenraad De Bosschere:
Memoing with Abstract Answers and Delphi Lemmas. LOPSTR 1993: 196-209 - [c9]Koen De Bosschere, Paul Tarau:
Blackboard Communication in Logic Programming. PARCO 1993: 257-264 - [c8]Paul Tarau:
An Efficient Specialization of the WAM for Continuation Passing Binary Programs. ILPS 1993: 652 - [c7]Koenraad De Bosschere, Paul Tarau:
Blackboard-based Extensions for Parallel Programming in BinProlog. ILPS 1993: 664 - [e1]Koen De Bosschere, Jean-Marie Jacquet, Paul Tarau:
Proceedings of the ICLP'93 Post-Conference Workshop on Blackboard-Based Logic Programming, Budapest, Hungary, June 24, 1993. 1993 [contents] - 1992
- [c6]Paul Tarau:
Ecological Memory Management in a Continuation Passing Prolog Engine. IWMM 1992: 344-356 - [c5]Paul Tarau:
BinProlog: a Continuation Passing Style Prolog Engine. PLILP 1992: 479-480 - 1991
- [c4]Paul Tarau, Michel Boyer:
Nonstandard Answers of Elementary Logic Programs. ICLP Workshop on Construction of Logic Programs 1991: 279-300 - [c3]Paul Tarau:
Program Transformations and WAM-Support for the Compilation of Definite Metaprograms. RCLP 1991: 462-473 - 1990
- [c2]Paul Tarau, Michel Boyer:
Elementary Logic Programs. PLILP 1990: 159-173
1980 – 1989
- 1988
- [c1]Paul Tarau, Michel Boyer:
Prolog Meta-Programming with Soft Databases. META 1988: 365-381
Coauthor Index
Koen De Bosschere
aka: Koenraad De Bosschere
aka: Koenraad De Bosschere
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 21:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
