Faculty Profile

Paul Tarau

Title
Professor
Department
Computer Science and Engineering
College
College of Engineering

    

Education

PhD, Université de Montreal, 1990.
Major: Computer Science
MS, Université Laval (Quebec), 1986.
Major: Computer Science
BS, University of Bucharest, 1975.
Major: Mathematics

Current Scheduled Teaching*

CSCE 3220.001, Human Computer Interfaces, Fall 2021 Syllabus

* Texas Education Code 51.974 (HB 2504) requires each institution of higher education to make available to the public, a syllabus for undergraduate lecture courses offered for credit by the institution.

Previous Scheduled Teaching*

CSCE 2100.001, Foundations of Computing, Spring 2021 Syllabus SPOT
CSCE 2100.004, Foundations of Computing, Spring 2021 Syllabus SPOT
CSCE 2100.206, Foundations of Computing, Spring 2021 SPOT
CSCE 2100.207, Foundations of Computing, Spring 2021 SPOT
CSCE 2100.282, Foundations of Computing, Spring 2021 SPOT
CSCE 2100.284, Foundations of Computing, Spring 2021 SPOT
CSCE 2100.291, Foundations of Computing, Spring 2021 SPOT
CSCE 2100.293, Foundations of Computing, Spring 2021 SPOT
CSCE 5450.001, Programming Languages, Spring 2021 Syllabus SPOT
CSCE 4999.734, Senior Thesis, Spring 2021
CSCE 5210.001, Fundamentals of Artificial Intelligence, Fall 2020 SPOT
CSCE 5210.008, Fundamentals of Artificial Intelligence, Fall 2020 Syllabus SPOT
CSCE 4430.001, Programming Languages, Fall 2020 Syllabus SPOT
CSCE 4890.734, Directed Study, Spring 2020
CSCE 5450.001, Programming Languages, Spring 2020
CSCE 5450.600, Programming Languages, Spring 2020
CSCE 3110.002, Data Structures and Algorithms, Fall 2019 Syllabus SPOT
CSCE 4430.001, Programming Languages, Fall 2019 Syllabus SPOT
CSCE 5450.001, Programming Languages, Spring 2019 SPOT
CSCE 5450.600, Programming Languages, Spring 2019 SPOT
CSCE 4430.001, Programming Languages, Fall 2018 Syllabus SPOT
CSCE 5450.001, Programming Languages, Spring 2018 SPOT
CSCE 5450.600, Programming Languages, Spring 2018 SPOT
CSCE 5430.001, Software Engineering, Fall 2017 SPOT
CSCE 5430.600, Software Engineering, Fall 2017 SPOT
CSCE 5450.001, Programming Languages, Spring 2017 SPOT
CSCE 6950.734, Doctoral Dissertation, Fall 2016
CSCE 5400.001, Formal Languages, Automata and Computability, Fall 2016 SPOT
CSCE 5400.600, Formal Languages, Automata and Computability, Fall 2016 SPOT
CSCE 4430.002, Programming Languages, Fall 2016 Syllabus SPOT
CSCE 6950.734, Doctoral Dissertation, Summer 10W 2016
CSCE 6950.734, Doctoral Dissertation, Spring 2016
CSCE 6950.734, Doctoral Dissertation, Fall 2015
CSCE 6940.734, Individual Research, Fall 2015
CSCE 6950.734, Doctoral Dissertation, Spring 2015
CSCE 6940.734, Individual Research, Spring 2015
CSCE 3030.001, Parallel Programming, Spring 2015 Syllabus
CSCE 4430.001, Programming Languages, Spring 2015 Syllabus
CSCE 6950.734, Doctoral Dissertation, Fall 2014
CSCE 6940.734, Individual Research, Fall 2014
CSCE 5160.001, Parallel Processing and Algorithms, Fall 2014
CSCE 5450.001, Programming Languages, Fall 2014
CSCE 6940.734, Individual Research, Summer 10W 2014
CSCE 2100.002, Computing Foundations I, Spring 2014 Syllabus
CSCE 6940.734, Individual Research, Spring 2014
CSCE 5450.001, Programming Languages, Spring 2014
CSCE 6933.002, Advanced Topics in Computer Science and Engineering, Fall 2013
CSCE 5150.002, Analysis of Computer Algorithms, Fall 2013
CSCE 6940.734, Individual Research, Fall 2013
CSCE 5290.001, Natural Language Processing, Fall 2013
CSCE 4930.005, Topics in Computer Science and Engineering, Fall 2013 Syllabus
CSCE 6940.734, Individual Research, Spring 2013
CSCE 4430.001, Programming Languages, Spring 2013 Syllabus
CSCE 5450.001, Programming Languages, Spring 2013
CSCE 4444.001, Software Engineering, Spring 2013 Syllabus
CSCE 6933.004, Advanced Topics in Computer Science and Engineering, Fall 2012
CSCE 6940.734, Individual Research, Fall 2012
CSCE 3210.001, Symbolic Processing, Fall 2012 Syllabus
CSCE 6940.734, Individual Research, Summer 5W2 2012
CSCE 6940.734, Individual Research, Summer 3W1 2012
CSCE 4930.021, Topics in Computer Science and Engineering, Summer 3W1 2012
CSCE 5933.021, Topics in Computer Science and Engineering, Summer 3W1 2012
CSCE 5934.734, Directed Study, Spring 2012
CSCE 6940.734, Individual Research, Spring 2012
CSCE 4430.001, Programming Languages, Spring 2012 Syllabus
CSCE 5430.001, Topics in Software Engineering, Spring 2012
CSCE 6933.001, Advanced Topics in Computer Science and Engineering, Fall 2011
CSCE 5950.734, Master's Thesis, Fall 2011
CSCE 5420.001, Software Development, Fall 2011
CSCE 5950.734, Master's Thesis, Summer 10W 2011
CSCE 5170.001, Graph Theory, Spring 2011
CSCE 4430.001, Programming Languages, Spring 2011 Syllabus
CSCE 6933.003, Advanced Topics in Computer Science and Engineering, Fall 2010
CSCE 5934.734, Directed Study, Fall 2010
CSCE 5950.734, Master's Thesis, Fall 2010
CSCE 5450.001, Programming Languages, Fall 2010
CSCE 5950.734, Master's Thesis, Spring 2010
CSCE 3600.002, Principles of Systems Programming, Spring 2010
CSCE 5900.734, Special Problems, Spring 2010
CSCE 5430.001, Topics in Software Engineering, Spring 2010
CSCE 4890.734, Directed Study, Fall 2009
CSCE 5934.734, Directed Study, Fall 2009
CSCE 4430.001, Programming Languages, Fall 2009
CSCE 5450.001, Programming Languages, Fall 2009
CSCE 5420.001, Software Development, Fall 2009
CSCE 5900.734, Special Problems, Fall 2009
CSCE 5934.734, Directed Study, Summer 10W 2009
CSCE 5950.734, Master's Thesis, Summer 10W 2009
CSCE 5934.734, Directed Study, Spring 2009
CSCE 5950.734, Master's Thesis, Spring 2009
CSCE 4430.001, Programming Languages, Spring 2009
CSCE 5450.001, Programming Languages, Spring 2009
CSCE 5430.002, Topics in Software Engineering, Spring 2009
CSCE 4430.001, Programming Languages, Fall 2008
CSCE 5450.001, Programming Languages, Fall 2008
CSCE 5420.001, Software Development, Fall 2008
CSCE 5934.734, Directed Study, Summer 10W 2008
CSCE 5900.734, Special Problems, Summer 10W 2008
CSCE 4430.001, Programming Languages, Spring 2008
CSCE 5450.001, Programming Languages, Spring 2008
CSCE 5430.002, Topics in Software Engineering, Spring 2008
CSCE 4430.001, Programming Languages, Fall 2007
CSCE 5450.001, Programming Languages, Fall 2007
CSCE 5420.001, Software Development, Fall 2007
CSCE 5210.001, Artificial Intelligence, Spring 2006
CSCE 4890.734, Directed Study, Spring 2006
CSCE 5934.734, Directed Study, Spring 2006
CSCE 5450.001, Programming Languages, Spring 2006
CSCE 5934.734, Directed Study, Fall 2005
CSCE 5950.734, Master's Thesis, Fall 2005
CSCE 4430.002, Programming Languages, Fall 2005
CSCE 5450.001, Programming Languages, Fall 2005
CSCE 5900.734, Special Problems, Fall 2005
CSCI 5890.734, Directed Study, Summer 10W 2005
CSCI 5410.001, Artificial Intelligence, Spring 2005
CSCI 4890.734, Directed Study, Spring 2005
CSCI 4300.001, File Organization and Processing, Spring 2005
CSCI 5950.734, Master's Thesis, Spring 2005
CSCI 5890.734, Directed Study, Fall 2004
CSCI 6940.734, Individual Research, Fall 2004
CSCI 4410.002, Introduction to Artificial Intelligence, Fall 2004
CSCI 5950.734, Master's Thesis, Fall 2004
CSCI 6900.734, Special Problems, Fall 2004
CSCI 4250.001, Survey of Computer Languages, Fall 2004

* Texas Education Code 51.974 (HB 2504) requires each institution of higher education to make available to the public, a syllabus for undergraduate lecture courses offered for credit by the institution.

Published Publications

Published Intellectual Contributions

Abstracts and Proceedings
Tarau, P. (2018). Declarative Algorithms for Generation, Counting and Random Sampling of Term Algebras. Proceedings of SAC'18, ACM Symposium on Applied Computing, PL track. 8. ACM. https://dl.acm.org/
Tarau, P. (2009). Computing Ranking and Unranking Functions for BDDs.
Tarau, P. (2008). Declarative Combinatorics in Prolog: ShapeShifting Data Objects with Isomorphisms and Hylomorphisms.
Tarau, P. (2008). Exact combinational logic synthesis and non-standard circuit design.
Tarau, P. (2008). Interactors: Logic Engine Interoperation with Pure Prolog Semantics.
Tarau, P. (2008). Logic Engines as Interactors.
Tarau, P. (2008). Pairing Functions, Boolean Evaluation and Binary Decision Diagrams.
Tarau, P. (2008). Revisiting Exact Combinational Circuit Synthesis.
Tarau, P. (2007). A Logic Programming Framework for Combinational Circuit Synthesis.
Tarau, P. (2007). Semantic Distances As Knowledge Capture Constraints.
Tarau, P. (2005). An Algorithm for Language Independent Single and Multiple Document Summarization.
Tarau, P. (2005). An empirical evaluation of communication effectiveness in autonomous reactive multiagent systems.
Tarau, P. (2005). Multi-Document Summarization with Iterative Graph-based Algorithms.
Tarau, P. (2005). PicNet: Pictorial Representations for Illustrated Semantic Networks.
Tarau, P. (2005). Semantic document engineering with WordNet and PageRank.
Tarau, P. (2004). A Logic Programming Framework for Semantic Interpretation with WordNet and PageRank.
Tarau, P. (2004). Agent Oriented Logic Programming Constructs in Jinni 2004.
Tarau, P. (2004). Assumptive Logic Programming.
Tarau, P. (2004). Conversational Agents as Web Services.
Tarau, P. (2004). Knowledge Assimilation and Web Deployment Techniques for Conversational Agents.
Tarau, P. (2004). Knowledge Based Conversational Agents and Virtual Storytelling.
Tarau, P. (2004). Orthogonal Language Constructs for Agent Oriented Logic Programming.
Tarau, P. (2004). PageRank on Semantic Networks, with application to Word Sense Disambiguation.
Tarau, P. (2004). TextRank: Bringing Order into Texts.
Tarau, P. (2003). Agents and Ambient Intelligence in the Jinni Infrastructure.
Tarau, P. (2003). Garbage Collection Algorithms for Java-Based Prolog Engines.
Tarau, P. (2003). Lexical Inference Mechanisms for Text Understanding and Classification.
Tarau, P. (2003). Story Traces and Projections: Exploring the Patterns of Storytelling.
Tarau, P. (2003). The VISTA Project: An Agent Architecture for Virtual Interactive Storytelling.
Tarau, P. (2002). Object Oriented Logic Programming as an Agent Building Infrastructure.
Tarau, P. (2002). The VISTA Project: An Agent Architecture for Virtual Interactive Storytelling.
Tarau, P. (2001). A Most Specific Method Finding Algorithm for Reflection Based Dynamic Prolog-to-Java Interfaces.
Tarau, P. (2001). Multicast Protocols for Jinni Agents.
Tarau, P. (2000). Assumption Grammars for Generating Dynamic VRML Pages.
Tarau, P. (2000). Deliberative stock market agents using Jinni and defeasible logic programming.
Tarau, P. (2000). Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects.
Tarau, P. (2000). Multicast Protocols for Jinni Agents.
Tarau, P. (1999). A Logic Programming Based Software Architecture for Reactive Intelligent Mobile Agents.
Tarau, P. (1999). A Logic Programming Infrastructure for Internet Programming.
Tarau, P. (1999). A Mobile Agent-Based File System for Distributed Networks.
Tarau, P. (1999). Inference and Computation Mobility with Jinni.
Tarau, P. (1999). Intelligent Mobile Agent Programming at the Intersection of Java and Prolog.
Tarau, P. (1999). Multi-Engine Horn Clause Prolog.
Tarau, P. (1998). A Virtual Environment for Collaborative Learning.
Tarau, P. (1998). An Agent Communication Protocol for the Feature Interaction Problem.
Tarau, P. (1998). Jinni: a Lightweight Java-based Logic Engine for Internet Programming.
Tarau, P. (1998). Logic Programming Based Coordination in Virtual Worlds.
Tarau, P. (1998). Mobile Threads through First Order Continuations.
Tarau, P. (1998). Towards Inference and Computation Mobility: The Jinni Experiment.
Tarau, P. (1998). Towards Logic Programming Based Coordination in Virtual Worlds.
Tarau, P. (1997). A Logic Programming Infrastructure for Remote Execution, Mobile Code and Agents.
Tarau, P. (1997). Assumption grammars for knowledge based systems.
Tarau, P. (1997). Assumption Grammars for Processing Natural Language.
Tarau, P. (1997). Concept-Based Retrieval using Controlled Natural Language.
Tarau, P. (1997). Controlling Virtual Worlds through Extensible Natural Language.
Tarau, P. (1997). Logic Programming Tools for Advanced Internet Programming.
Tarau, P. (1997). Logic Programming Tools for Remote Execution, Mobile Code and Agents.
Tarau, P. (1997). LogiMOO: a Multi-User Virtual World with Agents and Natural Language Programming.
Tarau, P. (1997). On-line Resource Discovery Using Natural Language.
Tarau, P. (1997). Remote Execution, Mobile Code and Agents in BinProlog.
Tarau, P. (1996). A Coordination Logic for Agent Programming in Virtual Worlds.
Tarau, P. (1996). A Hypothetical Reasoning Framework for NL Processing.
Tarau, P. (1996). Backtrackable State with Linear Affine Implication and Assumption Grammars.
Tarau, P. (1996). Logic Programming and Virtual Worlds.
Tarau, P. (1996). LogiMOO: Prolog Technology for Virtual Worlds.
Tarau, P. (1996). Segment Preserving Copying Garbage Collection for WAM based Prolog.
Tarau, P. (1996). Virtual World Brokerage with BinProlog and Netscape.
Tarau, P. (1995). Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars.
Tarau, P. (1995). Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars.
Tarau, P. (1995). Continuation Logic Programming: Theory and Practice.
Tarau, P. (1995). Extending Datalog Grammars.
Tarau, P. (1995). Higher-Order Programming in an OR-intensive Style.
Tarau, P. (1995). Logic Programming with Monads and Comprehensions.
Tarau, P. (1995). Monadic Constructs for Logic Programming.
Tarau, P. (1995). Rejuvenating Future Garbage in WAM.
Tarau, P. (1995). Resolving Co-specification in Contexts.
Tarau, P. (1995). The Power of Partial Translation: an Experiment with the C-ification of Binary Prolog.
Tarau, P. (1995). Treating Coordination with Datalog Grammars.
Tarau, P. (1994). A Novel Term Compression Scheme and Data Representation in the BinWAM.
Tarau, P. (1994). Datalog Grammars.
Tarau, P. (1994). High Performance Continuation Passing Style Prolog-to-C Mapping.
Tarau, P. (1994). Language Embedding by Dual Compilation and State Mirroring.
Tarau, P. (1994). Logic Programming and Logic Grammars with First-order Continuations.
Tarau, P. (1994). Low level Issues in Implementing a High-Performance Continuation Passing Binary Prolog Engine.
Tarau, P. (1994). The Power of Partial Translation: an Experiment with the C-ification of Binary Prolog.
Tarau, P. (1993). An Efficient Specialization of the WAM for Continuation Passing Binary programs.
Tarau, P. (1993). Blackboard Based Logic Programming in BinProlog.
Tarau, P. (1993). Blackboard Communication in Logic Programming.
Tarau, P. (1993). Blackboard-based Extensions for Parallel Programming in BinProlog.
Tarau, P. (1993). Language Issues and Programming Techniques in BinProlog.
Tarau, P. (1993). Memoing with Abstract Answers and Delphi Lemmas.
Tarau, P. (1993). Non-Associative Blackboard Programming.
Tarau, P. (1993). Nonstandard Answers of Elementary Logic Programs.
Tarau, P. (1992). BinProlog: a Continuation Passing Style Prolog Engine.
Tarau, P. (1992). Ecological Memory Management in a Continuation Passing Prolog Engine.
Tarau, P. (1992). Program Transformations and WAM-support for the Compilation of Definite Metaprograms.
Tarau, P. (1991). A Simplified Abstract Machine for the Execution of Binary Metaprograms.
Tarau, P. (1991). Nonstandard Answers of Elementary Logic Programs.
Tarau, P. (1990). A family of logic program transformations and their applications.
Tarau, P. (1990). Conditional and Abstract Solutions of Elementary Logic Programs.
Tarau, P. (1990). Elementary Logic Programs.
Tarau, P. (1989). Prolog Meta-Programming with Soft Databases.
Tarau, P. (1987). A Parser and Text Generation System for Argumentative Discourse.
Tarau, P. (1987). Adding Theories to Prolog.
Tarau, P. (1987). Un environnement de conception de systemes experts pour des applications grand-public.
Book Chapter
Tarau, P., Dahl, V. (1999). Towards a logic programming infrastructure for internet programming. Artificial intelligence today. 431--456. Springer Berlin Heidelberg.
Conference Proceeding
Tarau, P. (2020). Training Neural Networks to do Logic, with Logic. Proceedings of LPOP'20. https://www.info.ucl.ac.be/~pvr/LPOP_2020_proceedings.pdf
Tarau, P. Deriving Theorems in Implicational Linear Logic, Declaratively. Proceedings 36th International Conference on Logic Programming (Technical Communications), {ICLP}.
Tarau, P. Training Neural Networks as Theorem Provers via the Curry-Howard Isomorphism.
Tarau, P., Blanco, E. (2020). Interactive Text Graph Mining with a Prolog-based Dialog Engine. Lecture Notes in Computer Science. (12007), 3-19. Springer. https://doi.org/10.1007/978-3-030-05998-9
Tarau, P., Wielemaker, J., Schrijvers, T. (2019). Lazy Stream Programming in Prolog. 15. https://dblp.org/db/series/eptcs/eptcs306.html
Tarau, P. (2019). Modality definition synthesis for epistemic intuitionistic logic via a theorem prover.. https://www.semsys.aau.at/events/eelp2019/
Tarau, P. (2019). A combinatorial testing framework for intuitionistic propositional theorem provers. Practical Aspects of Declarative Languages - 21th International Symposium, PADL 2019, Lisbon, Portugal, January 14-15, 2019, Springer LNCS 11372. 11372, . Springer, LNCS 11372. https://link.springer.com/book/10.1007%2F978-3-030-05998-9
Tarau, P. (2018). Shaving with Occam's Razor: Deriving Minimalist Theorem Provers for Minimal Logic. Proceedings of the Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion co-located with the Federated Logic Conference, RCRA@FLOC 2018, Oxford, United Kingdom, July 13, 2018.. 2271, 16. Germany: CEUR Workshop Proceedings. CEUR-WS.org
Tarau, P. (2018). On k-colored Lambda Terms and Their Skeletons. International Symposium on Practical Aspects of Declarative Languages. 116--131. Springer, LNCS. https://doi.org/10.1007/978-3-319-73305-0\_8
Bendkowski, M., Grygiel, K., Tarau, P. (2017). Boltzmann samplers for closed simply-typed lambda terms. International Symposium on Practical Aspects of Declarative Languages. 120--135.
Tarau, P. (2017). On lambda-term skeletons, with applications to all-term and random-term generation of simply-typed closed lambda terms.
Tarau, P. (2016). A Hiking Trip Through the Orders of Magnitude: Deriving Efficient Generators for Closed Simply-Typed Lambda Terms and Normal Forms. Other. Springer LNCS, volume 10184.
Tarau, P. (2016). A Size-proportionate Bijective Encoding of Lambda Terms as Catalan Objects endowed with Arithmetic Operations. International Symposium on Practical Aspects of Declarative Languages. 99--116.
Mazidi, K. J., Tarau, P. (2016). Automatic Question Generation: From NLU to NLG. International Conference on Intelligent Tutoring Systems. 23--33.
Tarau, P. (2016). Computing with catalan families, generically. International Symposium on Practical Aspects of Declarative Languages. 117--134.
Hamid, F., Haraburda, D., Tarau, P. (2016). Evaluating Text Summarization Systems with a Fair Baseline from Multiple Reference Summaries. European Conference on Information Retrieval. 351--365.
Mazidi, K. J., Tarau, P. (2016). Infusing NLU into Automatic Question Generation.. INLG. 51--60.
Hamid, F., Tarau, P. (2015). Anti-Summaries: Enhancing Graph-Based Techniques for Summary Extraction with Sentiment Polarity.. CICLing (2). 375--389.
Tarau, P. (2015). On a uniform representation of combinators, arithmetic, Lambda terms and types. Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming. 244--255.
Tarau, P. (2015). On logic programming representations of lambda terms: de Bruijn indices, compression, type inference, combinatorial generation, normalization. International Symposium on Practical Aspects of Declarative Languages. 115--131.
Tarau, P. (2015). On Synergies between Type Inference, Generation and Normalization of SK-Combinator Trees. Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2015 17th International Symposium on. 160--166.
Tarau, P. (2015). On Type-directed Generation of Lambda Terms.. ICLP (Technical Communications).
Tarau, P. (2015). Ranking/unranking of Lambda terms with compressed de Bruijn Indices. Conferences on Intelligent Computer Mathematics. 118--133.
Tarau, P. (2015). The Arithmetic of Even-Odd Trees. Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2015 17th International Symposium on. 90--97.
Tarau, P. (2014). A Declarative Specification of Giant Number Arithmetic. Proceedings of the Sixteenth International Symposium on Practical Aspects of Declarative Languages PADL'14. 120-135. ACM.
Tarau, P., Buckles, B. (2014). Arithmetic Algorithms for Hereditarily Binary Natural Numbers. Proceedings of SAC'14, ACM Symposium on Applied Computing, PL track. ACM.
Tarau, P. (2014). Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers. In PPDP '14 : Proceedings of the 16th international ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming. ACM.
Tarau, P. (2014). Computing with Catalan Families. In Proceedings of Language and Automata Theory and Applications, 8th International Conference, LATA 2014. 564-576. Springer, LNCS.
Tarau, P. (2014). New Arithmetic Algorithms for Hereditarily Binary Natural Numbers. Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2014 16th International Symposium on. 109--116.
Hamid, F., Tarau, P. (2014). Text Summarization as an Assistive Technology. In Proceedings of PETRA 2014, The 7th ACM International Conference on Pervasive Technologies Related to Assistive Environments. ACM.
Tarau, P. (2014). The Arithmetic of Recursively Run-length Compressed Natural Numbers. In Proceedings of 8th International Colloquium on Theoretical Aspects of Computing, ICTAC 2014. Springer, LNCS.
Tarau, P. (2013). A Prolog Specification of Giant Number Arithmetic. Proceedings of the 13th International Colloquium on Implementation of Constraint Logic Programming Systems (CICLOPS 2013).
Tarau, P. (2013). Two Mechanisms for Generating Infinite Families of Pairing Bijections. Proceedings Research in Adaptive and Convergent Systems, RACS'2013. 57-62. ACM.
Tarau, P. (2012). Boolean Evaluation with a Pairing and Unpairing Function, Proceedings of SYNASC 2012.
Tarau, P., Luderman, B. (2012). Boolean evaluation with a pairing and unpairing function. Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2012 14th International Symposium on. 384--390.
Tarau, P. (2012). Computing with Free Algebras, Proceedings of SYNASC 2012, Invited Talk.
Tarau, P. (2012). Declarative Specification of Tree-based Symbolic Arithmetic Computations..
Tarau, P. (2012). On Computing with Types..
Tarau, P. (2011). - Agent Mobility with Weak Local Inheritance and Transactional Remote Logic Invocation.
Tarau, P. (2011). - Concurrent Programming Constructs in Multi-engine Prolog: Parallelism just for the cores (and not more!)..
Tarau, P. (2011). - Emulating Boolean Computations with Pairing and Unpairing Functions..
Tarau, P. (2011). Bijective Term Encodings..
Tarau, P. (2011). Computing with Hereditarily Finite Sequences.
Tarau, P. (2011). Coordination and Concurrency in Multi-engine Prolog.
Tarau, P. (2011). Emulating Primality with Multiset representations of Natural Numbers..
Tarau, P. (2011). Integrated Symbol Table, Engine and Heap Memory Management in Multi-engine Prolog..
Tarau, P. (2010). A Unified Formal Description of Arithmetic and Set Theoretical Data Types..
Tarau, P. (2010). Declarative modeling of finite mathematics.
Tarau, P. (2010). Experimental Mathematics in Haskell: on Pairing/Unpairing Functions and Boolean Evaluation.
Tarau, P. (2010). Hereditarily finite representations of natural numbers and self-delimiting codes..
Tarau, P. (2010). On Arithmetic Computations with Hereditarily Finite Sets, Functions and Types.. ICTAC. 367--381.
Tarau, P. (2010). On Arithmetic Computations with Hereditarily Finite Sets, Functions and Types. .
Tarau, P. (2009). A Groupoid of Isomorphic Data Transformations.
Tarau, P. (2009). An Embedded Declarative Data Transformation Language.
Tarau, P. (2009). Interoperating Logic Engines.
Tarau, P. (2009). Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell.
Mihalcea, R. F., Tarau, P. (2005). A language independent algorithm for single and multiple document summarization. Proceedings of IJCNLP. 5, .
Tarau, P. (2005). Agent oriented logic programming in Jinni 2004. Proceedings of the 2005 ACM symposium on Applied computing. 1427--1428.
Borman, A., Mihalcea, R. F., Tarau, P. (2005). PicNet: Augmenting Semantic Resources with Pictorial Representations.. AAAI Spring Symposium: Knowledge Collection from Volunteer Contributors. 1--7.
Mihalcea, R. F., Tarau, P. (2004). Textrank: Bringing order into text. Proceedings of the 2004 conference on empirical methods in natural language processing.
Tarau, P. (1999). Jinni: Intelligent mobile agent programming at the intersection of java and prolog. Proc. of PAAM. 99, 109--123.
Tarau, P., Dahl, V. (1998). Code Migration with First Order Continuations.. APPIA-GULP-PRODE. 215--226.
Elbadri, G., Geraert, E., Moens, M. (1998). Morphological differences among Radopholus thorne, 1949 populations from ornamentals in Europe (Pratylenchidae: Nematoda). 50th International symposium on Crop Protection. 63(2b), 599--608.
De Bosschere, K., HERMENEGILDO, M., Tarau, P. (1997). ICLP'97 Post-Conference Workshop on Logic Programming Tools for Internet Applications. Proceedings ICLP 97, ELIS, De Bosschere K., Hermenegildo M., Tarau P.(ed.), Leuven, juli pp. 1-148.
Rochefort, Veronica Dahl Andrew Fall Stephen,, Tarau, P. (1996). A Hypothetical Reasoning Based Framework for NL Processing. Proceedings of the. International IEEE Conference on Tools for Artificial Intelligence. 67.
Dahl, V., Fall, A., Rochefort, S., Tarau, P. (1996). A hypothetical reasoning based framework for NL processing. Tools with Artificial Intelligence, 1996., Proceedings Eighth IEEE International Conference on. 67--70.
Demoen, B., Engels, G., Tarau, P. (1996). Segment order preserving copying garbage collection for WAM based Prolog. Proceedings of the 1996 ACM symposium on Applied Computing. 380--386.
Tarau, P., Demsen, B., De Bosschere, K. (1995). Bosschere. The Power of Partial Translation: an Experiment with the C-ification of Binary Prolog. of Binary Prolog. ACM Symposium on Applied Computing.
Ooms, S., De Zutter, Dani\"el, (1995). Extension of the compression approach to include device metalizations in electromagnetic simulations. Antennas and Propagation Society International Symposium, 1995. AP-S. Digest. 2, 1054--1057.
Tarau, P., Demoen, B., De Bosschere, K. (1995). The power of partial tanslation: an experiment with the C-ification of binary Prolog. Proceedings of the 1995 ACM symposium on Applied computing. 152--156.
Verschoore, R., Duquesne, F. (1994). Der Einfluss des Ausgleichgetriebes auf die Fl\"achenleistung. Kurzfassung der Vortr\"age, VDI-Tagung Landtechnik 13/14 Oktober, Stuttgart-Hohenheim, pp 11.1-11.3.
Journal Article
Tarau, P. (2020). Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms. Fundam. Informaticae 177(3-4). (Fundam. Informaticae 177(3-4): 385-415), 30. https://content.iospress.com/articles/fundamenta-informaticae/fi1994
Tarau, P., Blanco, E. (2020). Interactive Text Graph Mining with a Prolog-Based Dialog Engine. Theory and Practice of Logic Programming. 1–20. Cambridge University Press.
Tarau, P. (2018). Introduction to the 34-th international conference on logic programming special issue. Theory and Practice of Logic Programming. 18, 4. Cambridge: Cambridge University Press. https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/introduction-to-the-34th-international-conference-on-logic-programming-special-issue/5ED65FA948132BA6AF6C4519072E6451
Tarau, P. (2018). Random generation of closed simply typed lambda-terms: A synergy between logic programming and Boltzmann samplers. Theory and Practice of Logic Programming. 18(1), 24. Cambridge: Cambridge University Press. https://dblp.org/rec/bib/journals/tplp/BendkowskiGT18
Bendkowski, M., Grygiel, K., Tarau, P. (2017). Random generation of closed simply typed $\lambda$-terms: A synergy between logic programming and Boltzmann samplers. Theory and Practice of Logic Programming. heory and Practice of Logic Programming. 1--23. Cambridge University Press.
Tarau, P. (2014). A generic numbering system based on catalan families of combinatorial objects. Other.
Tarau, P. (2014). Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers, PPDP'14. ACM.
Tarau, P., Hamid, F. (2014). Interclausal Logic Variables. Other.
Tarau, P., Hamid, F. (2014). Interclausal Logic Variables, ICLP'2014. Cambridge Univ. Press.
Tarau, P. (2014). The Arithmetic of Recursively Run-length Compressed Natural Numbers, ICTAC'2014. Springer, LNCS 8687.
Tarau, P. (2014). Towards a generic view of primality through multiset decompositions of natural numbers. Theoretical Computer Science. 537, 105 - 124. Elsevier.
Tarau, P. (2013). Bijective Size-proportionate G\"odel Numberings for Term Algebras. Other.
Tarau, P. (2013). Binary Tree Arithmetic with Generalized Constructors. Other.
Haraburda, D., Tarau, P. (2013). Binary trees as a computational framework. Other. 39(4), 163--181. Pergamon.
Haraburda, D., Tarau, P. (2013). Binary trees as a computational framework, in Computer Languages, Systems & Structures. 39(4), 163-181. Elsevier.
Tarau, P. (2013). Compact Serialization of Prolog Terms (with Catalan Skeletons, Cantor Tupling and Goedel Numberings, in Theory and Practice of Logic Programming, 13:4-5, pp. 847-861. 13(4-5), 847-861. Cambridge Univ. Press.
Tarau, P. (2013). Compact serialization of prolog terms (with Catalan skeletons, Cantor tupling and G\"odel numberings). Theory and Practice of Logic Programming. 13(4-5), 847--861. Cambridge University Press.
Tarau, P. (2013). Modeling Prime Factorization with Bijections between Natural Numbers, Finite Sequences and Multisets.
Tarau, P. (2013). On Two Infinite Families of Pairing Bijections. Other.
Tarau, P. (2013). Tree-based Arithmetic and Compressed Representations of Giant Numbers. Other.
Tarau, P. (2012). A declarative specification of tree-based symbolic arithmetic computations. Other. 273--288. Springer Berlin/Heidelberg.
Tarau, P. (2012). Agent Spaces: a Scalable Architecture for Distributed Logic Agents.
Tarau, P. (2012). Deriving a Fast Inverse of the Generalized Cantor N-tupling Bijection.
Tarau, P. (2011). - The BinProlog Experience: Architecture and Implementation Choices for Continuation Passing Prolog and First-Class Logic Engines.
Tarau, P. (2011). Concurrent programming constructs in multi-engine prolog. Other. 11, .
Tarau, P. (2010). "Everything Is Everything" Revisited: Shapeshifting Data Types with Isomorphisms and Hylomorphisms..
Tarau, P. (2010). Integrated Symbol, Engine Table and Heap Memory Management in Multi-Engine Prolog.
Tarau, P. (2008). Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types in Haskell. Other.
Tarau, P. (2008). Isomorphic Data Encodings in Haskell and their Generalization to Hylomorphisms on Hereditarily Finite Data Types. Other.
Tarau, P. (2008). Pairing Functions, Boolean Evaluation and Binary Decision Diagrams in Prolog. Other.
Tarau, P., Dahl, V. (2007). Towards a Logic Programming Infrastructure for. Other. 431. Springer.
Tarau, P. (2006). BinProlog 2006 version 11. x Professional Edition User Guide. Other.
Figa, E., Tarau, P., Ephraim, J. (2004). Enhancing the virtual storytelling experience with metadata driven voice enabled conversational agents. Proceedings of the Association for Information Science and Technology. 41(1), 403--410. Wiley Subscription Services, Inc., A Wiley Company.
Pankaj, G., Tarau, P. (2002). THE DESIGN AND IMPLEMENTATION OF PROLOG PARSER USING JAVACC..
Tarau, P. (2002). The vista architecture: experiencing stories through virtual storytelling agents.
Tarau, P. (2001). High-Level Networking with Mobile Code and First Order AND-Continuations.
Tarau, P. (1999). A Spanish Interface to LogiMoo- towards multilingual virtual worlds.
Tarau, P. (1999). LogiMOO: an Extensible Multi-User Virtual World with Natural Language Control.
Tarau, P. (1999). Multi-Engine Horn Clause Prolog.
RYAN, C., Vanhaesebrouck, P. (1999). Prenatal and Neonatal Transport in Europe: Report of the European Netwotk for Perinatal Transport (EUROPET). Contribution acknowledged in surveys of Transport practices in European NICU's and Technical aspects of Neonatal transport. Other. 4, 125--129.
Tarau, P. (1998). Assumption Grammars for Knowledge Based Systems.
Tarau, P. (1998). From Assumptions to Meaning.
Govaerts, M., Voet, M., Volckaert, G., Goddeeris, B. (1998). PCR amplification and sequence of the p33 piroplasm surface antigen gene of a Theileria species isolated from cattle in west Java, Indonesia. Annals of the New York Academy of Sciences. 849(1), 126--136. Blackwell Publishing Ltd.
Tarau, P. (1997). On Delphi Lemmas And other Memoing Techniques For Deterministic Logic Programs.
Tarau, P. (1996). Blackboard-based Extensions in Prolog.
Tarau, P. (1996). Partial Translation: Towards a Portable and Efficient Prolog Implementation Technology.
Moerman, P., Desoppere, E. (1996). Thermo-akoestische koeling. Other.
Wauters, N. (1995). Functional Representation of Optical Transport Networks and Survellance Monitoring Techniques. Other.
Vandamme, F. (1995). KIT-watching from Hardware to Contentware.. Other. 9(7), .
SYS, W. (1995). Response of Blade Roots to High Bending Moments. Other.
Tarau, P. (1995). Une machine abstraite optimis\'ee \`a passage de continuations: l'exp\'erience BinProlog. Other. 14(6), 713--731. Lavoisier.
Tarau, P. (1995). Une machine abstraite optimisée à passage de continuations: l'expérience BinProlog.
Tarau, P., De Bosschere, K., Demoen, B. (1994). Improving memoing with abstract answers and Delphi lemmas. Department of Computer Science, KU Leuven, Leuven, Belgium.
COMMERS, R. (1994). Traditie: bron of kerker?, een wijsgerige briefwisseling met Herman De Dijn. Other.
Corlatan, D., Van Den Bossche, J., JACQUET, J., Erwin De Ley, V FERRARA,, Colpaert, C., Maximus, B., De Meyere, A., BERNARDINI, F., Denecker, K., Desmedt, P., others, (1994). UV induced activator excitation in ZnS: Mn thin film electroluminescent devices with probe layers. Other. 100, 250.
Tarau, P., DAHL, V., DE BOSSCHERE, K. (1993). A Logic Programming Infrastructure for Internet Programming, Mobile Code and Agents. Other. 12, 1--199.
Vanderkerken, K., Van Ranst, H., Bouwens, L., Baekeland, M., VAN DEN BERG, K., WISSE, E., ZS BIRO, H. P., VIANA, R., Delaey, J., Van Loock, W., others, (1993). Effect of irradiation on the binding and cytotoxic capacities of hepatic natural killer cells. Other. 100, 250.
Tarau, P., DE BOSSCHERE, K., DAHL, V., ROCHEFORT, S. (1993). LogiMOO: an Extensible Multi-User Virtual World with Natural Language Control. Other. 12, 1--199.
Degryse, K., Parmentier, J. (1993). Maritime Aspects of the Ostend Trade to Mocha, India and China (1715-1732). Other. 139--175.
Other
Mihalcea, R. F., Tarau, P. (2010). Graph-based ranking algorithms for text processing.
Ratau, P., Demoen, B. (1994). Higher-order programming in an OR-intensive style. Katholieke Universiteit Leuven. Departement Computerwetenschappen.
Tarau, P., Universit\'e Laval. D\'epartement d'informatique, (1986). Projet SEUL: environnement de conception de syst\`emes \`a base de connaissances et comportements st\'er\'eotyp\'es. Qu\'ebec: D\'ep. d'informatique, Universit\'e Laval.
Moulin, B., Tarau, P. (1986). Projet SEUL: environnement de conception de syst\`emes \`a base de connaissances et comportements st\'er\'eotyp\'es. D\'ep. d'informatique, Universit\'e Laval.
Hamelin, D., Tarau, P., Universit\'e Laval. D\'epartement d'informatique, (1984). Projet SEUL pour la conception de syst\`emes experts mettant en oeuvre le principe d'autonomie, version vo. 1. Qu\'ebec: D\'ep. d'informatique, Universit\'e Laval.
Ph.D. Thesis
Tarau, P. (2011). Arithmetic Computations and Memory Management Using a Binary Tree Encoding of Natural Numbers. University of North Texas.
Dandala, B. (2010). Graph-based keyphrase extraction using Wikipedia. University of North Texas.
Tarau, P. (2005). An Empirical Evaluation of Communication and Coordination Effectiveness in Autonomous Reactive Multiagent Systems. University of North Texas.
Tarau, P. (2005). PLANNING TECHNIQUES FOR AGENT BASED 3D ANIMATIONS. UNIVERSITY OF NORTH TEXAS.
Tarau, P. (2003). AGENT EXTENSIONS FOR PEER-TO-PEER NETWORKS. UNIVERSITY OF NORTH TEXAS.
Tarau, P. (2003). INTELLIGENT MEMORY MANAGEMENT HEURISTICS. UNIVERSITY OF NORTH TEXAS.
Tarau, P. (2003). MACHINE LEARNING TECHNIQUES FOR CONVERSATIONAL AGENTS. UNIVERSITY OF NORTH TEXAS.
Tarau, P. (1985). Cr\'eation d'un environnement de repr\'esentation de structures conceptuelles. Universit\'e Laval.
Popular Press Article
Tarau, P. (2009). Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types.
Tarau, P. (2008). A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions.
Tarau, P. (2008). Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell.
Tarau, P. (2008). Executable Set Theory and Arithmetic Encodings in Prolog.
Tarau, P. (2008). Logic Engines as Interactors.
Tarau, P. (2008). Pairing Functions, Boolean Evaluation and Binary Decision Diagrams.
Tarau, P. (2008). Ranking and Unranking of Hereditarily Finite Functions and Permutations.
Tarau, P. (2008). Ranking Catamorphisms and Unranking Anamorphisms on Hereditarily Finite Datatypes.
Tarau, P. (2008). The Jinni Prolog Compiler: a fast and flexible Prolog-in-Java.
Tarau, P. (2006). BinProlog 11.x Professional Edition: Advanced BinProlog Programming and Extensions Guide.
Tarau, P. (2006). BinProlog 11.x Professional Edition: BinProlog Interfaces Guide.
Tarau, P. (2006). BinProlog 11.x Professional Edition: Internet Programming Guide.
Tarau, P. (2006). BinProlog 11.x Professional Edition: User Guide.
Tarau, P. (1999). A Framework for Virtual Learning Environments.
Tarau, P. (1998). Generating Internet Based VRML Animations through Natural Language Controlled Partial Order Planners.
Tarau, P. (1997). A Spanish Interface to LogiMoo- towards multilingual virtual worlds.
Tarau, P. (1997). BinProlog 5.75 User Guide.
Tarau, P. (1996). BinProlog 5.25 User Guide.
Tarau, P. (1995). Backtrackable State with Linear Assumptions, Continuations and Hidden Accumulator Grammars.
Tarau, P. (1995). BinProlog 4.00 User Guide.
Tarau, P. (1994). BinProlog 2.20 User Guide.
Tarau, P. (1994). Higher-Order Programming in an OR-intensive Style.
Tarau, P. (1994). Issues in (copying) garbage collection for (Bin)WAM.
Tarau, P. (1993). BinProlog 1.71 User Guide.
Tarau, P. (1993). Compact Representation of Terms and Instructions in the BinWAM.
Tarau, P. (1993). Continuation Passing Style Prolog-to-C Mapping at Native WAM-speed.
Tarau, P. (1992). Ecological Memory Management in a Continuation Passing Prolog engine.
Tarau, P. (1992). WAM-optimizations in BinProlog: Towards a Realistic Continuation Passing Prolog Engine.
Tarau, P. (1990). Transformation de programmes logiques.
Software
Tarau, P. (2004). Development of the Jinni Prolog compiler and the Prolog3D agent based 3D animation software - about 22,000 lines of Java and Prolog code.
Tarau, P. (2004). Kernel Prolog: a Refactoring of ISO-Prolog for Interoperation with Object Oriented Languages.
Tarau, P. (2004). PocketJinni Prolog system for Java-enabled PDAs and Wireless Phones.
Tarau, P. (2004). The jProlog experimental Prolog-to-Java translator.
Tarau, P. (2004). WordNet Prolog based Voice-enbled Conversational Agent.
Tarau, P. (1997). Jinni high performance Java based Prolog compiler.
Tarau, P. (1990). an energy minimization based automatic Tetris player.
Tarau, P. (1990). an OR-parallel binary program evaluator.
Tarau, P. (1990). BinProlog Multi-Threaded Prolog Compiler.
Tarau, P. (1988). an expert system on computer security in Prolog.
Tarau, P. (1987). a Prolog interpreter and compiler in TurboProlog.
Tarau, P. (1985). an expert system with natural language interface in Lisp.
Technical Report
Tarau, P. (1999). BinProlog 7.0 Professional Edition: Internet Programming Guide. Technical report, BinNet Corp., 1998. Available from http://www. binnetcorp. com/BinProlog.
Tarau, P. (1998). The BinProlog Experience: Implementing a High-Performance Continuation Passing Prolog Engine. Technical report, BinNet Corp.

Awarded Grants

Contracts, Grants and Sponsored Research

Grant - Research
Tarau, P. (Principal), "Arithmetic Algorithms and Applications of Hereditarily Binary Numbers," Sponsored by NSF Research Grant, Federal, $253161 Funded. (20142018).
Tarau, P. (Co-Principal), "Keyphrase Extraction in Document Networks," Sponsored by NSF Research Grant, Federal, $324866 Funded. (20142018).
,
Overall
Summative Rating
Challenge and
Engagement Index
Response Rate

out of 5

out of 7
%
of
students responded
  • Overall Summative Rating (median):
    This rating represents the combined responses of students to the four global summative items and is presented to provide an overall index of the class’s quality. Overall summative statements include the following (response options include a Likert scale ranging from 5 = Excellent, 3 = Good, and 1= Very poor):
    • The course as a whole was
    • The course content was
    • The instructor’s contribution to the course was
    • The instructor’s effectiveness in teaching the subject matter was
  • Challenge and Engagement Index:
    This rating combines student responses to several SPOT items relating to how academically challenging students found the course to be and how engaged they were. Challenge and Engagement Index items include the following (response options include a Likert scale ranging from 7 = Much higher, 4 = Average, and 1 = Much lower):
    • Do you expect your grade in this course to be
    • The intellectual challenge presented was
    • The amount of effort you put into this course was
    • The amount of effort to succeed in this course was
    • Your involvement in course (doing assignments, attending classes, etc.) was
CLOSE