Gerda Janssens

According to our database1, Gerda Janssens authored at least 76 papers between 1987 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Knowledge representation analysis of graph mining.
Ann. Math. Artif. Intell., 2019

SOGrounder: Modelling and Solving Second-Order Logic.
Proceedings of the 31st Benelux Conference on Artificial Intelligence (BNAIC 2019) and the 28th Belgian Dutch Conference on Machine Learning (Benelearn 2019), 2019

2018
FMS: Functional Programming as a Modelling Language.
Proceedings of the Functional and Constraint Logic Programming, 2018

Predicate logic as a modeling language: the IDP system.
Proceedings of the Declarative Logic Programming: Theory, Systems, and Applications, 2018

2017
The KB paradigm and its application to interactive configuration.
Theory Pract. Log. Program., 2017

2016
Bootstrapping Inference in the IDP Knowledge Base System.
New Gener. Comput., 2016

Implementing a Relevance Tracker Module.
CoRR, 2016

Knowledge Representation Analysis of Graph Mining.
CoRR, 2016

Combining DMN and the Knowledge Base Paradigm for Flexible Decision Enactment.
Proceedings of the Supplementary Proceedings of the RuleML 2016 Challenge, 2016

Relevance for SAT(ID).
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

A Compositional Typed Higher-Order Logic with Definitions.
Proceedings of the Technical Communications of the 32nd International Conference on Logic Programming, 2016

2015
Inference and learning in probabilistic logic programs using weighted Boolean formulas.
Theory Pract. Log. Program., 2015

Semantics of templates in a compositional framework for building logics.
Theory Pract. Log. Program., 2015

A web-based IDE for IDP.
CoRR, 2015

Crucial components in probabilistic inference pipelines.
Proceedings of the 30th Annual ACM Symposium on Applied Computing, 2015

Implementation and Performance of Probabilistic Inference Pipelines.
Proceedings of the Practical Aspects of Declarative Languages, 2015

Compacting Boolean Formulae for Inference in Probabilistic Logic Programming.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2015

2014
Analyzing the efficiency of context-based grouping on collaboration in VANETs with large-scale simulation.
J. Ambient Intell. Humaniz. Comput., 2014

Experimental Evaluation of a State-Of-The-Art Grounder.
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014

The Most Probable Explanation for Probabilistic Logic Programs with Annotated Disjunctions.
Proceedings of the Inductive Logic Programming - 24th International Conference, 2014

2013
Pattern-Based Compaction for ProbLog Inference.
Theory Pract. Log. Program., 2013

Region-based memory management for Mercury programs.
Theory Pract. Log. Program., 2013

Compiling Input* FO(·) inductive definitions into tabled prolog rules for IDP3.
Theory Pract. Log. Program., 2013

2012
Equivalence checking of static affine programs using widening to handle recurrences.
ACM Trans. Program. Lang. Syst., 2012

2011
Nesting Probabilistic Inference
CoRR, 2011

Analysing a Publish/Subscribe System for Mobile Ad Hoc Networks with ProbLog.
Proceedings of the Practical Aspects of Declarative Languages, 2011

2010
Experience with Widening Based Equivalence Checking in Realistic Multimedia Systems.
J. Electron. Test., 2010

DNF Sampling for ProbLog Inference
CoRR, 2010

Variable Compression in ProbLog.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Preprocessing Boolean Formulae for BDDs in a Probabilistic Context.
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

Dedicated Tabling for a Probabilistic Setting.
Proceedings of the Technical Communications of the 26th International Conference on Logic Programming, 2010

ProbLog Technology for Inference in a Probabilistic First Order Logic.
Proceedings of the ECAI 2010, 2010

2009
Path-sensitive region analysis for mercury programs.
Proceedings of the 11th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2009

2008
Runtime support for region-based memory management in Mercury.
Proceedings of the 7th International Symposium on Memory Management, 2008

2007
Fast Frequent Querying with Lazy Control Flow Compilation.
Theory Pract. Log. Program., 2007

A practical dynamic single assignment transformation.
ACM Trans. Design Autom. Electr. Syst., 2007

A Delta Debugger for ILP Query Execution
CoRR, 2007

Static Region Analysis for Mercury.
Proceedings of the Logic Programming, 23rd International Conference, 2007

2006
Towards Region-Based Memory Management for Mercury Programs.
Proceedings of the Logic Programming, 22nd International Conference, 2006

2005
Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code.
Proceedings of the 2005 Design, 2005

Verification of Source Code Transformations by Program Equivalence Checking.
Proceedings of the Compiler Construction, 14th International Conference, 2005

Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis.
Proceedings of the Programming Languages and Systems, Third Asian Symposium, 2005

Analyzing & debugging ILP data mining query execution.
Proceedings of the Sixth International Workshop on Automated Debugging, 2005

2004
Fast Query Evaluation with (Lazy) Control Flow Compilation.
Proceedings of the Logic Programming, 20th International Conference, 2004

2003
An Open Ended Tree.
Theory Pract. Log. Program., 2003

An Automatic Verification Technique for Loop and Data Reuse Transformations based on Geometric Modeling of Programs.
J. Univers. Comput. Sci., 2003

Query Transformations for Improving the Efficiency of ILP Systems.
J. Mach. Learn. Res., 2003

Automatic functional verification of memory oriented global source code transformations.
Proceedings of the Eighth IEEE International High-Level Design Validation and Test Workshop 2003, 2003

Multi-dimentsional Incremetal Loops Fusion for Data Locality.
Proceedings of the 14th IEEE International Conference on Application-Specific Systems, 2003

2002
Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs.
J. Artif. Intell. Res., 2002

Geometric Model Checking: An Automatic Verification Technique for Loop and Data Reuse Transformations.
Electron. Notes Theor. Comput. Sci., 2002

Storage Size Reduction by In-place Mapping of Arrays.
Proceedings of the Verification, 2002

Collecting Potential Optimisations.
Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

2001
Practical Aspects for a Working Compile Time Garbage Collection System for Mercury.
Proceedings of the Logic Programming, 17th International Conference, 2001

2000
Project Report on LP<sup>+</sup>: A Second Generation Logic Programming Language.
AI Commun., 2000

Two Advanced Transormations for Improving the Efficiency of an ILP system.
Proceedings of the Inductive Logic Programming, 10th International Conference, 2000

Executing Query Packs in ILP.
Proceedings of the Inductive Logic Programming, 10th International Conference, 2000

A Module Based Analysis for Memory Reuse in Mercury.
Proceedings of the Computational Logic, 2000

1999
A Finite Domain CLP Solver on Top of Mercury.
Proceedings of the New Trends in Contraints, 1999

1998
On the Use of Tabling for Abstract Interpretation: An Experiment with Abstract Equation Systems.
Proceedings of the 1st Workshop on Tabulation in Parsing and Deduction, 1998

1997
Live-Structure Analysis for Logic Programming Languages with Declarations.
Proceedings of the Logic Programming, 1997

1996
Global Analysis of Constraint Logic Programs.
ACM Trans. Program. Lang. Syst., 1996

1995
A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs.
Proceedings of the Logic Programming, 1995

On the Practicality of Abstract Equation Systems.
Proceedings of the Logic Programming, 1995

1994
Abstracting Numerical Values in CLP(H, N).
Proceedings of the Programming Language Implementation and Logic Programming, 1994

Towards a Practical Full Mode Inference System for CLP(H, N).
Proceedings of the Logic Programming, 1994

On the Implementation of Abstract Interpretation Systems for (Constraint) Logic Programs.
Proceedings of the Compiler Construction, 5th International Conference, 1994

1993
Freeness Analysis in the Presence of Numerical Constraints.
Proceedings of the Logic Programming, 1993

1992
Deriving Descriptions of Possible Values of Program Variables by Means of Abstract Interpretation.
J. Log. Program., 1992

Propagation: A New Operation in a Framework for Abstract Interpretation of Logic Programs.
Proceedings of the Meta-Programming in Logic, 3rd International Workshop, 1992

1991
Improving the Efficiency of Constraint Logic Programming Languages by Deriving Specialized Versions.
Proceedings of the Processing Declarative Knowledge, 1991

On Abstracting the Procedural Behaviour of Logic Programs.
Proceedings of the Logic Programming, First Russian Conference on Logic Programming, Irkutsk, Russia, September 14-18, 1990, 1991

1989
The Impact of Abstract Interpretation: An Experiment in Code Generation.
Proceedings of the Logic Programming, 1989

1988
Improving the Register Allocation of WAM by Recording Unification.
Proceedings of the Logic Programming, 1988

An Instance of Abstract Interpretation Integrating Type and Mode Inferencing.
Proceedings of the Logic Programming, 1988

1987
Abstract Interpretation: Towards the Global Optimization of Prolog Programs.
Proceedings of the 1987 Symposium on Logic Programming, San Francisco, California, USA, August 31, 1987


  Loading...