Maurice Bruynooghe

From MaRDI portal
Person:582148

Available identifiers

zbMath Open bruynooghe.mauriceWikidataQ102277643 ScholiaQ102277643MaRDI QIDQ582148

List of research outcomes





PublicationDate of PublicationType
Towards systematic treatment of partial functions in knowledge representation2024-05-29Paper
Justifications and a reconstruction of parity game solving algorithms2023-08-17Paper
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory2022-09-30Paper
A freeness and sharing analysis of logic programs based on a pre-interpretation2022-02-16Paper
Improving parity game solvers with justifications2020-08-05Paper
Mining rooted ordered trees under subtree homeomorphism2019-05-03Paper
Symmetric explanation learning: effective dynamic symmetry handling for SAT2017-11-15Paper
Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems withIDP32017-11-09Paper
On local domain symmetry for model expansion2017-11-09Paper
Logic programming revisited2017-06-13Paper
Improved Static Symmetry Breaking for SAT2016-09-05Paper
Constraint Propagation for First-Order Logic and Inductive Definitions2015-09-17Paper
Lazy Model Expansion: Interleaving Grounding with Search2015-03-04Paper
Simulating Dynamic Systems Using Linear Time Calculus Theories2014-11-25Paper
A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics2014-06-26Paper
Detection and exploitation of functional dependencies for model generation2014-02-27Paper
https://portal.mardi4nfdi.de/entity/Q53980392014-02-25Paper
An approximative inference method for solving ∃∀SO satisfiability problems2012-12-03Paper
Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs2012-07-23Paper
The magic of logical inference in probabilistic programming2011-08-16Paper
Answer Set Programming’s Contributions to Classical Logic2011-05-19Paper
ProbLog Technology for Inference in a Probabilistic First Order Logic2011-05-11Paper
Binding-Time Annotations without Binding-Time Analysis2011-05-06Paper
Coherent Composition of Distributed Knowledge-Bases through Abduction2011-05-06Paper
A Fixed Point Semantics for Logic Programs Extended with Cuts2011-03-04Paper
FO(ID) as an extension of DL with rules2010-11-12Paper
A comparison of pruning criteria for probability trees2010-10-07Paper
Embracing Events in Causal Modelling: Interventions and Counterfactuals in CP-Logic2010-10-01Paper
An Approximative Inference Method for Solving ∃ ∀SO Satisfiability Problems2010-10-01Paper
A Transformational Approach for Proving Properties of the CHR Constraint Store2010-05-04Paper
Learning directed probabilistic logical models: Ordering-search versus structure-search2009-09-18Paper
CP-logic: A language of causal probabilistic events and its relation to logic programming2009-08-19Paper
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences2009-06-30Paper
Foundations of Information and Knowledge Systems2009-05-14Paper
Generalized ordering-search for learning directed probabilistic logical models2009-03-31Paper
Learning \((k,l)\)-contextual tree languages for information extraction from web pages2009-03-31Paper
From Monomorphic to Polymorphic Well-Typings and Beyond2009-03-24Paper
Representing Causal Information About a Probabilistic Process2008-10-30Paper
Distance-Based Repairs of Databases2008-10-30Paper
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions2008-05-27Paper
Representation of Partial Knowledge and Query Answering in Locally Complete Databases2008-05-27Paper
Satisfiability Checking for PC(ID)2008-05-27Paper
Learning Directed Probabilistic Logical Models Using Ordering-Search2008-03-28Paper
Learning Relational Options for Inductive Transfer in Relational Reinforcement Learning2008-03-28Paper
Predicate Introduction Under Stable and Well-Founded Semantics2008-03-11Paper
Logic Programming and Nonmonotonic Reasoning2007-11-07Paper
Distance semantics for database repair2007-10-23Paper
Counting integer points in parametric polytopes using Barvinok's rational functions2007-07-19Paper
Well-founded and stable semantics of logic programs with aggregates2007-04-19Paper
Inductive Logic Programming2006-11-01Paper
Static Analysis2006-10-31Paper
Programming Languages and Systems2006-10-20Paper
Computational methods for database repair by signed formulae2006-09-12Paper
Logic Programming and Nonmonotonic Reasoning2006-06-23Paper
Logic Programming and Nonmonotonic Reasoning2006-06-23Paper
https://portal.mardi4nfdi.de/entity/Q57156642006-01-04Paper
Program Development in Computational Logic2005-12-23Paper
Program Development in Computational Logic2005-12-23Paper
Logic Programming2005-08-26Paper
PROGRAMMING PEARL: Enhancing a search algorithm to perform intelligent backtracking2005-04-15Paper
Compact representation of knowledge bases in inductive logic programming2005-01-17Paper
Offline specialisation in Prolog using a hand-written compiler generator2004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q48088122004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47369952004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47365142004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q47365072004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44750992004-08-06Paper
Logic program specialisation through partial deduction: Control issues2004-03-01Paper
https://portal.mardi4nfdi.de/entity/Q44119792003-07-13Paper
https://portal.mardi4nfdi.de/entity/Q44060332003-06-25Paper
https://portal.mardi4nfdi.de/entity/Q47077312003-06-11Paper
https://portal.mardi4nfdi.de/entity/Q27671452002-01-28Paper
https://portal.mardi4nfdi.de/entity/Q44992482001-03-05Paper
https://portal.mardi4nfdi.de/entity/Q45063912000-09-18Paper
https://portal.mardi4nfdi.de/entity/Q43124591999-07-29Paper
Exploiting goal independence in the analysis of logic programs1998-03-16Paper
https://portal.mardi4nfdi.de/entity/Q56888901997-05-25Paper
https://portal.mardi4nfdi.de/entity/Q56888891997-05-25Paper
On the design of a correct freeness analysis for logic programs1997-04-27Paper
Iterative versionspaces1996-02-26Paper
CHICA, An Abductive Planning System Based on Event Calculus1996-02-20Paper
Deriving fold/unfold transformations of logic programs using extended OLDT-based abstract interpretation1994-05-09Paper
A general criterion for avoiding infinite unfolding during partial deduction1993-04-01Paper
Acquiring object-knowledge1993-01-16Paper
Interactive concept-learning and constructive induction by analogy1992-09-27Paper
Deriving descriptions of possible values of program variables by means of abstract interpretation1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39830411992-06-26Paper
A practical framework for theabstract interpretation of logic programs1991-01-01Paper
Compiling bottom-up and mixed derivations into top-down executable logic programs1991-01-01Paper
Compiling control1989-01-01Paper
On the existence of nonterminating queries for a restricted class of PROLOG-clauses1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34909291989-01-01Paper
On the transformation of logic programs with instantiation based computation rules1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34932551989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32017661989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38803181980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39112281980-01-01Paper

Research outcomes over time

This page was built for person: Maurice Bruynooghe