Maurice Bruynooghe

According to our database1, Maurice Bruynooghe
  • authored at least 233 papers between 1980 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

2016
On local domain symmetry for model expansion.
TPLP, 2016

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

Mining rooted ordered trees under subtree homeomorphism.
Data Min. Knowl. Discov., 2016

A MIP Backend for the IDP System.
CoRR, 2016

On Local Domain Symmetry for Model Expansion.
CoRR, 2016

First Order Logic with Inductive Definitions for Model-Based Problem Solving.
AI Magazine, 2016

Improved Static Symmetry Breaking for SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015
Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3.
TPLP, 2015

Lazy Model Expansion: Interleaving Grounding with Search.
J. Artif. Intell. Res., 2015

2014
Simulating Dynamic Systems Using Linear Time Calculus Theories.
TPLP, 2014

Mining Rooted Ordered Trees under Homeomorphism.
CoRR, 2014

Lazy Model Expansion: Interleaving Grounding with Search.
CoRR, 2014

Predicate Logic as a Modelling Language: The IDP System.
CoRR, 2014

Simulating dynamic systems using Linear Time Calculus theories.
CoRR, 2014

2013
Detection and exploitation of functional dependencies for model generation.
TPLP, 2013

Constraint Propagation for First-Order Logic and Inductive Definitions.
ACM Trans. Comput. Log., 2013

Predicate Logic as a Modeling Language: Modeling and Solving some Machine Learning and Data Mining Problems with IDP3.
CoRR, 2013

A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics.
Ann. Math. Artif. Intell., 2013

Guided Monte Carlo Tree Search for Planning in Learned Environments.
Proceedings of the Asian Conference on Machine Learning, 2013

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

An approximative inference method for solving ∃∀SO satisfiability problems.
J. Artif. Intell. Res., 2012

Ordered Epistemic Logic: Semantics, Complexity and Applications.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

Modeling Machine Learning and Data Mining Problems with FO(·).
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs.
Proceedings of the Correct Reasoning, 2012

2011
The magic of logical inference in probabilistic programming.
TPLP, 2011

Computerized prediction of intensive care unit discharge after cardiac surgery: development and validation of a Gaussian processes model.
BMC Med. Inf. & Decision Making, 2011

The Magic of Logical Inference in Probabilistic Programming
CoRR, 2011

Coherent Integration of Databases by Abductive Logic Programming
CoRR, 2011

Answer Set Programming's Contributions to Classical Logic - An Analysis of ASP Methodology.
Proceedings of the Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 2011

2010
Towards a logical reconstruction of a theory for locally closed databases.
ACM Trans. Database Syst., 2010

A comparison of pruning criteria for probability trees.
Machine Learning, 2010

Prediction of Clinical Conditions after Coronary Bypass Surgery using Dynamic Data Analysis.
J. Medical Systems, 2010

Experience with Widening Based Equivalence Checking in Realistic Multimedia Systems.
J. Electronic Testing, 2010

Constraint Propagation for Extended First-Order Logic
CoRR, 2010

FO(ID) as an extension of DL with rules.
Ann. Math. Artif. Intell., 2010

An Approximative Inference Method for Solving THERE EXISTS FOR ALL SO Satisfiability Problems.
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

Embracing Events in Causal Modelling: Interventions and Counterfactuals in CP-Logic.
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

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

2009
CP-logic: A language of causal probabilistic events and its relation to logic programming.
TPLP, 2009

CP-logic: A Language of Causal Probabilistic Events and Its Relation to Logic Programming
CoRR, 2009

Dynamic Data Analysis and Data Mining for Prediction of Clinical Stability.
Proceedings of the Medical Informatics in a United and Healthy Europe - Proceedings of MIE 2009, The XXIInd International Congress of the European Federation for Medical Informatics, Sarajevo, Bosnia and Herzegovina, Agust 30, 2009

A Transformational Approach for Proving Properties of the CHR Constraint Store.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2009

Experience with widening based equivalence checking in realistic multimedia systems.
Proceedings of the IEEE International High Level Design Validation and Test Workshop, 2009

Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences.
Proceedings of the Computer Aided Verification, 21st International Conference, 2009

2008
Generalized ordering-search for learning directed probabilistic logical models.
Machine Learning, 2008

Learning ( k , l )-contextual tree languages for information extraction from web pages.
Machine Learning, 2008

Learning directed probabilistic logical models: ordering-search versus structure-search.
Ann. Math. Artif. Intell., 2008

SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions.
Proceedings of the Theory and Applications of Satisfiability Testing, 2008

From Monomorphic to Polymorphic Well-Typings and Beyond.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2008

Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Algorithms for Weighted Counting over Parametric Polytopes: A Survey and a Practical Comparison.
Proceedings of the 2008 International Conference on Information Theory and Statistical Learning, 2008

Sub Node Extraction with Tree Based Wrappers.
Proceedings of the ECAI 2008, 2008

An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules.
Proceedings of the Discovery Science, 11th International Conference, 2008

2007
Well-founded and stable semantics of logic programs with aggregates.
TPLP, 2007

Termination analysis of logic programs through combination of type-based norms.
ACM Trans. Program. Lang. Syst., 2007

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

Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code
CoRR, 2007

Distance semantics for database repair.
Ann. Math. Artif. Intell., 2007

Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions.
Algorithmica, 2007

Mining data from intensive care patients.
Advanced Engineering Informatics, 2007

A Polynomial-time Metric for Outerplanar Graphs.
Proceedings of the Mining and Learning with Graphs, 2007

Learning Directed Probabilistic Logical Models Using Ordering-Search.
Proceedings of the Inductive Logic Programming, 17th International Conference, 2007

Learning Relational Options for Inductive Transfer in Relational Reinforcement Learning.
Proceedings of the Inductive Logic Programming, 17th International Conference, 2007

Online Learning and Exploiting Relational Models in Reinforcement Learning.
Proceedings of the IJCAI 2007, 2007

Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-Search.
Proceedings of the Machine Learning: ECML 2007, 2007

Approximate Query Answering in Locally Closed Databases.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Information extraction from structured documents using k-testable tree automaton inference.
Data Knowl. Eng., 2006

Computational methods for database repair by signed formulae.
Ann. Math. Artif. Intell., 2006

Polymorphic algebraic data type reconstruction.
Proceedings of the 8th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2006

Representation of Partial Knowledge and Query Answering in Locally Complete Databases.
Proceedings of the Logic for Programming, 2006

Representing Causal Information About a Probabilistic Process.
Proceedings of the Logics in Artificial Intelligence, 10th European Conference, 2006

Distance-Based Repairs of Databases.
Proceedings of the Logics in Artificial Intelligence, 10th European Conference, 2006

Generalized Ordering-Search for Learning Directed Probabilistic Logical Models.
Proceedings of the Inductive Logic Programming, 16th International Conference, 2006

Predicate Introduction Under Stable and Well-Founded Semantics.
Proceedings of the Logic Programming, 22nd International Conference, 2006

2005
Well-founded and Stable Semantics of Logic Programs with Aggregates
CoRR, 2005

Inference of Well-Typings for Logic Programs with Application to Termination Analysis.
Proceedings of the Static Analysis, 12th International Symposium, 2005

An ID-Logic Formalization of the Composition of Autonomous Databases.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2005

On the Local Closed-World Assumption of Data-Sources.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2005

Satisfiability Checking for PC(ID).
Proceedings of the Logic for Programming, 2005

Multi-agent Relational Reinforcement Learning.
Proceedings of the Learning and Adaption in Multi-Agent Systems, 2005

Logical Bayesian Networks and Their Relation to Other Probabilistic Logical Models.
Proceedings of the Inductive Logic Programming, 15th International Conference, 2005

Learning (k, l)-Contextual Tree Languages for Information Extraction.
Proceedings of the Machine Learning: ECML 2005, 2005

A Comparison of Approaches for Learning Probability Trees.
Proceedings of the Machine Learning: ECML 2005, 2005

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

Experiences with Enumeration of Integer Projections of Parametric Polytopes.
Proceedings of the Compiler Construction, 14th International Conference, 2005

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

Logical Bayesian Networks and Their Relation to Other Probabilistic Logical Models.
Proceedings of the BNAIC 2005, 2005

On the Local Closed-World Assumption of Data-Sources.
Proceedings of the BNAIC 2005, 2005

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

2004
Offline specialisation in Prolog using a hand-written compiler generator.
TPLP, 2004

Enhancing a search algorithm to perform intelligent backtracking.
TPLP, 2004

Compact Representation of Knowledge Bases in Inductive Logic Programming.
Machine Learning, 2004

Coherent Integration of Databases by Abductive Logic Programming.
J. Artif. Intell. Res., 2004

Logic programs with annotated disjunctions.
Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

Partial Stable Models for Logic Programs with Aggregates.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

Binding-Time Analysis for Mercury.
Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004

Specialising Interpreters Using Offline Partial Deduction.
Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004

Logic Programs with Annotated Disjunctions.
Proceedings of the Logic Programming, 20th International Conference, 2004

Database Repair by Signed Formulae.
Proceedings of the Foundations of Information and Knowledge Systems, 2004

Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations.
Proceedings of the 2004 International Conference on Compilers, 2004

Data Integration Using ID-Logic.
Proceedings of the Advanced Information Systems Engineering, 16th International Conference, 2004

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

Enhancing a Search Algorithm to Perform Intelligent Backtracking
CoRR, 2003

Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference.
Proceedings of the IJCAI-03, 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

Translation of Aggregate Programs to Normal Logic Programs.
Proceedings of the Answer Set Programming, 2003

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

2002
Logic program specialisation through partial deduction: Control issues.
TPLP, 2002

Special Issue on Program Development, Guest Editors' Introduction.
TPLP, 2002

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

Offline Specialisation in Prolog Using a Hand-Written Compiler Generator
CoRR, 2002

Logic program specialisation through partial deduction: Control issues
CoRR, 2002

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

Reuse of Results in Termination Analysis of Typed Logic Programs.
Proceedings of the Static Analysis, 9th International Symposium, 2002

Information Extraction in Structured Documents Using Tree Automata Induction.
Proceedings of the Principles of Data Mining and Knowledge Discovery, 2002

Repairing Inconsistent Databases: A Model-Theoretic Approach and Abductive Reasoning.
Proceedings of the Paraconsistent Computational Logic, 2002

A Fixed Point Semantics for Logic Programs Extended with Cuts.
Proceedings of the Logic Based Program Synthesis and Tranformation, 2002

On the Transformation of Object-Oriented Conceptual Models to Logical Theories.
Proceedings of the Conceptual Modeling, 2002

A Portrait of a Scientist as a Computational Logician.
Proceedings of the Computational Logic: Logic Programming and Beyond, 2002

2001
Logic programming revisited: Logic programs as inductive definitions.
ACM Trans. Comput. Log., 2001

Practical Aspects for a Working Compile Time Garbage Collection System for Mercury
CoRR, 2001

A polynomial time computable metric between point sets.
Acta Inf., 2001

Binding-Time Annotations Without Binding-Time Analysis.
Proceedings of the Logic for Programming, 2001

Coherent Composition of Distributed Knowledge-Bases Through Abduction.
Proceedings of the Logic for Programming, 2001

When Size Does Matter.
Proceedings of the Logic Based Program Synthesis and Transformation, 2001

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

Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates.
Proceedings of the Logic Programming, 17th International Conference, 2001

Pos(T): Analyzing Dependencies in Typed Logic Programs.
Proceedings of the Perspectives of System Informatics, 2001

2000
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction
CoRR, 2000

Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog
CoRR, 2000

Detecting Unsolvable Queries for Definite Logic Programs
CoRR, 2000

A Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems
CoRR, 2000

Logic Programming for Describing and Solving Planning Problems
CoRR, 2000

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

Benelog.
AI Commun., 2000

Extending constraint logic programming with open functions.
PPDP, 2000

Towards a modular binding-time analysis for higher-order Mercury.
Proceedings of the Extended Abstracts of the 10th International Workshop on Logic-based Program Synthesis and Transformation, 2000

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

1999
Towards Modular Binding-Time Analysis for First-order Mercury.
Electr. Notes Theor. Comput. Sci., 1999

Detecting Unsolvable Queries for Definite Logic Programs
Journal of Functional and Logic Programming, 1999

Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog.
Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

Binding-time Analysis for Mercury.
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

1998
Detecting Unsolvable Queries for Definite Logic Programs.
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

A Framework for Defining Distances Between First-Order Logic Objects.
Proceedings of the Inductive Logic Programming, 8th International Workshop, 1998

A Polyvariant Binding-Time Analysis for Off-line Partial Deduction.
Proceedings of the Programming Languages and Systems - ESOP'98, 7th European Symposium on Programming, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'98, Lisbon, Portugal, March 28, 1998

1997
Exploiting Goal Independence in the Analysis of Logic Programs.
J. Log. Program., 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

On the Design of a Correct Freeness Analysis for Logic Programs.
J. Log. Program., 1996

A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation.
Proceedings of the Static Analysis, Third International Symposium, 1996

1995
Improving Abstract Interpretations by Combining Domains.
ACM Trans. Program. Lang. Syst., 1995

Declarative Bias for Specific-to-General ILP Systems.
Machine Learning, 1995

CHICA, an Abductive Planning System Based on Event Calculus.
J. Log. Comput., 1995

Guest Editors' Introduction: Special Section: Ten Years of Logic Programming.
J. Log. Program., 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

Abstracting Unification: A Key Step in the Design of Logic Program Analyses.
Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994
Live-Structure Dataflow Analysis for Prolog.
ACM Trans. Program. Lang. Syst., 1994

Guest Editor's Introduction.
J. Log. Program., 1994

Iterative Versionspaces.
Artif. Intell., 1994

A Systematic Construction of Abstract Domains
Proceedings of the Static Analysis, First International Static Analysis Symposium, 1994

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

Abstracting s-semantincs Using A Model-Theoretic Approach.
Proceedings of the Programming Language Implementation and Logic Programming, 1994

Goal Dependent versus Goal Independent Analysis of Logic Programs.
Proceedings of the Logic Programming and Automated Reasoning, 5th International Conference, 1994

Using Call/Exit Analysis for Logic Program Transformation.
Proceedings of the Logic Programming Synthesis and Transformation, 1994

Abstract Unification for a Composite Domain Deriving Sharing and Freeness Properties of Program Variables.
Proceedings of the ICLP 1994 Workshop W2: Verification and Analysis of (Concurrent) Logic Languages, 1994

Abstract Domains: a Model-Theoretic approach.
Proceedings of the ICLP 1994 Workshop W2: Verification and Analysis of (Concurrent) Logic Languages, 1994

1993
Deriving Fold/Unfold Transformations of Logic Programs Using Extended OLDT-Based Abstract Interpretation.
J. Symb. Comput., 1993

Freeness, Sharing, Linearity and Correctness - All at Once.
Proceedings of the Static Analysis, Third International Workshop, 1993

Improving Abstract Interpretations by Combining Domains.
Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, 1993

Abstract Interpretation for (Constraint) Logic Programming.
Proceedings of the Constraint Programming, 1993

Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic Programs.
Proceedings of the 5th Workshop on Logic Programming Environments (LPE 1993), 1993

Using Abstract Interpretation for Goal Replacement.
Proceedings of the Logic Program Synthesis and Transformation, 1993

A Theory of Clausal Discovery.
Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

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

Freeness Analysis for Logic Programs - And Correctness?
Proceedings of the Logic Programming, 1993

1992
A General Criterion for Avoiding Infinite Unfolding during Partial Deduction.
New Generation Comput., 1992

Interactive Concept-Learning and Constructive Induction by Analogy.
Machine Learning, 1992

A unifying framework for concept-learning algorithms.
Knowledge Eng. Review, 1992

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

Acquiring object-knowledge.
J. Exp. Theor. Artif. Intell., 1992

Belief Updating from Integrity Constraints and Queries.
Artif. Intell., 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

Deriving Transformations for Logic Programs Using Abstract Interpretation.
Proceedings of the Logic Program Synthesis and Transformation, 1992

Abstract interpretation for constraint logic programming.
Proceedings of the JFPL'92, 1992

A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns.
FGCS, 1992

Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures.
FGCS, 1992

Temporal Reasoning with Abductive Event Calculus.
ECAI, 1992

Inverse Resolution in an Integrated Inductive-Deductive Learning System.
ECAI, 1992

1991
The Derivation of an Algorithm for Program Specialisation.
New Generation Comput., 1991

A Practical Framework for the Abstract Interpretation of Logic Programs.
J. Log. Program., 1991

Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs.
J. Autom. Reasoning, 1991

A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs.
Proceedings of the Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28, 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

Integrity Constraints and Interactive Concept-Learning.
Proceedings of the Eighth International Workshop (ML91), 1991

Acquiring Object-Knowledge for Learning Systems.
Proceedings of the Machine Learning, 1991

Intelligent Backtracking Revisted.
Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

1990
On the Automatic Generation of Events in Delta Prolog.
Proceedings of the Programming Language Implementation and Logic Programming, 1990

Generation and Compilation of Efficient Computation Rules.
Proceedings of the Logic Programming, 1990

A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs.
Proceedings of the Logic Programming, 1990

Analysis of Shared Data Structures for Compile-Time Garbage.
Proceedings of the Logic Programming, 1990

The Derivation of an Algorithm for Program Specialisation.
Proceedings of the Logic Programming, 1990

Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism.
Proceedings of the ESOP'90, 1990

On Negation and Three-Valued Logic in Interactive Concept-Learning.
ECAI, 1990

1989
On the Transformation of Logic Programs with Instantiation Based Computation Rules.
J. Symb. Comput., 1989

Compiling Control.
J. Log. Program., 1989

On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-Clauses.
Artif. Intell., 1989

Towards Friendly Concept-Learners.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

Explanation Based Program Transformation.
Proceedings of the 11th International Joint Conference on Artificial Intelligence. Detroit, 1989

Constructive Induction by Analogy.
Proceedings of the Sixth International Workshop on Machine Learning (ML 1989), 1989

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

Generalizing Multiple Examples in Explanation Based Learning.
Proceedings of the Analogical and Inductive Inference, 1989

Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-based Learning.
Proceedings of the Analogical and Inductive Inference, 1989

1988
An Application of Abstract Interpretation in Source Level Program Transformation.
Proceedings of the Programming Language Implementation and Logic Programming, 1988

The Compilation of Forward Checking Regimes through Meta-Interpretation and Transformation.
META, 1988

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

On Implementing Logic Programming Languages on a Dataflow Architecture.
Proceedings of the ESOP '88, 1988

Integrity Constraint Checking in Deductive Databases Using a Rule/Goal Graph.
Expert Database Conf., 1988

On Interactive Concept-Learning and Assimilation.
Proceedings of the Third European Working Session on Learning, 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

1986
Compiling Control.
Proceedings of the 1986 Symposium on Logic Programming, 1986

Empirical Study of some Constraints Satisfaction Algorithms.
Proceedings of the Artificial Intelligence II: Methodology, Systems, Applications, 1986

Is Logic Programming "Real" Programming?
Proceedings of the Artificial Intelligence II: Methodology, Systems, Applications, 1986

1985
The Centralized Scheduler vs. the Distributed Specialists: Towards a Flexible Controller in Prolog for Expert Systems.
Proceedings of the Wissensbasierte Systeme, 1985

Towards a Real-Time Garbage Collector for Prolog.
Proceedings of the 1985 Symposium on Logic Programming, 1985

1984
Deduction Revision by Intelligent Backtracking.
Implementations of Prolog, 1984

Garbage Collection in Prolog Interpreters.
Implementations of Prolog, 1984

1982
Adding Redundancy to Obtain more Reliable and Readable Prolog Programs.
Proceedings of the First International Logic Programming Conference, 1982

A Note on Garbage-Collection in Prolog Interpreters.
Proceedings of the First International Logic Programming Conference, 1982

1981
Solving Combinatorial Search Problems by Intelligent Backtracking.
Inf. Process. Lett., 1981

1980
Analysis of Dependencies to Improve the Behaviour of Logic Programs.
Proceedings of the 5th Conference on Automated Deduction, 1980


  Loading...