Maurice Bruynooghe - researchr profile publications

researchr

explore
calendar
search

You are not signed in
Sign in
Sign up

Publications with a 'Maurice Bruynooghe' as author, editor, or advisor:

Justifications and a Reconstruction of Parity Game Solving AlgorithmsRuben Lapauw, Maurice Bruynooghe, Marc Denecker. BIRTHDAY 2023: 170-187 [doi]
On the Design of a Correct Freeness Analysis for Logic ProgramsMichael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe. jlp, 28(3):181-206, 1996.
Project Report on LP:::+:::: A Second Generation Logic Programming LanguageDanny De Schreye, Maurice Bruynooghe, Bart Demoen, Marc Denecker, Gerda Janssens, Bern Martens. aicom, 13(1):13-18, 2000.
An Efficiently Computable Graph-Based Metric for the Classification of Small MoleculesLeander Schietgat, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel. dis 2008: 197-209 [doi]
Improved Static Symmetry Breaking for SATJo Devriendt, Bart Bogaerts 0001, Maurice Bruynooghe, Marc Denecker. sat 2016: 104-122 [doi]
Solving Combinatorial Search Problems by Intelligent BacktrackingMaurice Bruynooghe. ipl, 12(1):36-39, 1981.
A Note on Garbage-Collection in Prolog InterpretersMaurice Bruynooghe. ICLP 1982: 52-55
Global Analysis of Constraint Logic ProgramsMaria J. García de la Banda, Manuel V. Hermenegildo, Maurice Bruynooghe, Veroniek Dumortier, Gerda Janssens, Wim Simoens. TOPLAS, 18(5):564-614, 1996. [doi]
Towards Systematic Treatment of Partial Functions in Knowledge RepresentationDjordje Markovic, Maurice Bruynooghe, Marc Denecker. jelia 2023: 756-770 [doi]
A Transformational Approach for Proving Properties of the CHR Constraint StorePaolo Pilozzi, Tom Schrijvers, Maurice Bruynooghe. LOPSTR 2010: 22-36 [doi]
On the Automatic Generation of Events in Delta PrologVeroniek Dumortier, Maurice Bruynooghe. plilp 1990: 324-339
Acquiring Object-Knowledge for Learning SystemsLuc De Raedt, Johan Feyaerts, Maurice Bruynooghe. ecml 1991: 245-264
Is Logic Programming Real Programming?Maurice Bruynooghe. aimsa 1986: 81-91
Generalized Ordering-Search for Learning Directed Probabilistic Logical ModelsJan Ramon, Tom Croonenborghs, Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe. ilp 2007: 40-42 [doi]
Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program DevelopmentMaurice Bruynooghe, Kung-Kiu Lau, editors, Volume 3049 of Lecture Notes in Computer Science, Springer, 2004.
On the Local Closed-World Assumption of Data-SourcesAlvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Bert Van Nuffelen, Maurice Bruynooghe. bnaic 2005: 333-334
Prediction of Clinical Conditions after Coronary Bypass Surgery using Dynamic Data AnalysisKristien Van Loon, Fabián Güiza, Geert Meyfroidt, Jean-Marie Aerts, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe, Greta Van den Berghe, Daniel Berckmans. jms, 34(3):229-239, 2010. [doi]
An Instance of Abstract Interpretation Integrating Type and Mode InferencingMaurice Bruynooghe, Gerda Janssens. ICLP 1988: 669-683
The Centralized Scheduler vs. the Distributed Specialists: Towards a Flexible Controller in Prolog for Expert SystemsRaf Venken, Maurice Bruynooghe, Luc Dekeyser, Bruno Krekels. wi 1985: 370-383
Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-based LearningMaurice Bruynooghe, Danny De Schreye. aii 1989: 60-77
A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted GraphsDanny De Schreye, Kristof Verschaetse, Maurice Bruynooghe. ICLP 1990: 649-663
A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call PatternsDanny De Schreye, Kristof Verschaetse, Maurice Bruynooghe. fgcs 1992: 481-488
Experience with Widening Based Equivalence Checking in Realistic Multimedia SystemsSven Verdoolaege, Martin Palkovic, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor. et, 26(2):279-292, 2010. [doi]
Proving Failure of Queries for Definite Logic Programs Using XSB-PrologNikolay Pelov, Maurice Bruynooghe. lpar 1999: 358-375
Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic ProgramsDanny De Schreye, Bern Martens, Gunther Sablon, Maurice Bruynooghe. JAR, 7(3):337-358, 1991.
Acquiring object-knowledgeLuc De Raedt, Johan Feyaerts, Maurice Bruynooghe. jetai, 4(3):213-232, 1992.
BenelogMaurice Bruynooghe. aicom, 13(1):7-8, 2000.
Inverse Resolution in an Integrated Inductive-Deductive Learning SystemHilde Adé, Luc De Raedt, Maurice Bruynooghe. ecai 1992: 456-457
Integrity Constraints and Interactive Concept-LearningLuc De Raedt, Maurice Bruynooghe, Bern Martens. icml 1991: 394-398
The Derivation of an Algorithm for Program SpecialisationJohn P. Gallagher, Maurice Bruynooghe. ICLP 1990: 732-746
Explanation Based Program TransformationMaurice Bruynooghe, Luc De Raedt, Danny De Schreye. IJCAI 1989: 407-412
Deriving Fold/Unfold Transformations of Logic Programs Using Extended OLDT-Based Abstract InterpretationDmitri Boulanger, Maurice Bruynooghe. JSC, 15(5/6):495-521, 1993.
Translation of Aggregate Programs to Normal Logic ProgramsNikolay Pelov, Marc Denecker, Maurice Bruynooghe. asp 2003: [doi]
Partial Stable Models for Logic Programs with AggregatesNikolay Pelov, Marc Denecker, Maurice Bruynooghe. lpnmr 2004: 207-219 [doi]
Repairing Inconsistent Databases: A Model-Theoretic Approach and Abductive ReasoningOfer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe. pcl 2002: 51-65 [doi]
On Implementing Logic Programming Languages on a Dataflow ArchitecturePatrick Weemeeuw, Maurice Bruynooghe, Marleen De Haondt. ESOP 1988: 359-372
Guided Monte Carlo Tree Search for Planning in Learned EnvironmentsJelle Van Eyck, Jan Ramon, Fabián Güiza, Geert Meyfroidt, Maurice Bruynooghe, Greet Vanden Berghe. acml 2013: 33-47 [doi]
Experiences with Enumeration of Integer Projections of Parametric PolytopesSven Verdoolaege, Kristof Beyls, Maurice Bruynooghe, Francky Catthoor. CC 2005: 91-105 [doi]
Interactive Concept-Learning and Constructive Induction by AnalogyLuc De Raedt, Maurice Bruynooghe. ml, 8:107-150, 1992.
Sound and Complete Partial Deduction with Unfolding Based on Well-Founded MeasuresBern Martens, Danny De Schreye, Maurice Bruynooghe. fgcs 1992: 473-480
Abstracting Unification: A Key Step in the Design of Logic Program AnalysesMaurice Bruynooghe, Michael Codish, Anne Mulkers. In Jan van Leeuwen, editor, Computer Science Today: Recent Trends and Developments. Volume 1000 of Lecture Notes in Computer Science, pages 406-425, Springer, 1995.
Ordered Epistemic Logic: Semantics, Complexity and ApplicationsHanne Vlaeminck, Joost Vennekens, Maurice Bruynooghe, Marc Denecker. kr 2012: [doi]
Empirical Study of some Constraints Satisfaction AlgorithmsWillem Rosiers, Maurice Bruynooghe. aimsa 1986: 173-180
Exploiting Goal Independence in the Analysis of Logic ProgramsMichael Codish, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo. jlp, 32(3):247-261, 1997.
Garbage Collection in Prolog InterpretersMaurice Bruynooghe. In Implementations of Prolog. pages 259-267, 1984.
Coherent Integration of Databases by Abductive Logic ProgrammingOfer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe. jair, 21:245-286, 2004. [doi]
Improving the Efficiency of Constraint Logic Programming Languages by Deriving Specialized VersionsMaurice Bruynooghe, Veroniek Dumortier, Gerda Janssens. pdk 1991: 309-317
Information Extraction in Structured Documents Using Tree Automata InductionRaymond Kosala, Jan Van den Bussche, Maurice Bruynooghe, Hendrik Blockeel. pkdd 2002: 299-310 [doi]
Learning Relational Options for Inductive Transfer in Relational Reinforcement LearningTom Croonenborghs, Kurt Driessens, Maurice Bruynooghe. ilp 2008: 88-97 [doi]
On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-ClausesDanny De Schreye, Maurice Bruynooghe, Kristof Verschaetse. ai, 41(2):237-248, 1989.
Improving Parity Game Solvers with JustificationsRuben Lapauw, Maurice Bruynooghe, Marc Denecker. vmcai 2020: 449-470 [doi]
A practical dynamic single assignment transformationPeter Vanbroekhoven, Gerda Janssens, Maurice Bruynooghe, Francky Catthoor. todaes, 12(4):40, 2007. [doi]
Counting Integer Points in Parametric Polytopes Using Barvinok s Rational FunctionsSven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe. algorithmica, 48(1):37-66, 2007. [doi]
Pos(T): Analyzing Dependencies in Typed Logic ProgramsMaurice Bruynooghe, Wim Vanhoof, Michael Codish. ershov 2001: 406-420 [doi]
Logic Programs with Annotated DisjunctionsJoost Vennekens, Sofie Verbaeten, Maurice Bruynooghe. ICLP 2004: 431-445 [doi]
Polymorphic algebraic data type reconstructionTom Schrijvers, Maurice Bruynooghe. ppdp 2006: 85-96 [doi]
Logic program specialisation through partial deduction: Control issuesMichael Leuschel, Maurice Bruynooghe. tplp, 2(4-5):461-515, 2002.
Ultimate Well-Founded and Stable Semantics for Logic Programs with AggregatesMarc Denecker, Nikolay Pelov, Maurice Bruynooghe. ICLP 2001: 212-226 [doi]
Compiling ControlMaurice Bruynooghe, Danny De Schreye, Bruno Krekels. jlp, 6(1&2):135-162, 1989.
A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformaticsLeander Schietgat, Jan Ramon, Maurice Bruynooghe. AMAI, 69(4):343-376, 2013. [doi]
Iterative VersionspacesGunther Sablon, Luc De Raedt, Maurice Bruynooghe. ai, 69(1-2):393-409, 1994.
On Interactive Concept-Learning and AssimilationLuc De Raedt, Maurice Bruynooghe. ecml 1988: 167-176
Detection and exploitation of functional dependencies for model generationBroes de Cat, Maurice Bruynooghe. tplp, 13(4-5):471-485, 2013. [doi]
Abstracting Numerical Values in CLP(H, N)Gerda Janssens, Maurice Bruynooghe, Vincent Englebert. plilp 1994: 400-414
An ID-Logic Formalization of the Composition of Autonomous DatabasesBert Van Nuffelen, Ofer Arieli, Alvaro Cortés-Calabuig, Maurice Bruynooghe. lpnmr 2005: 132-144 [doi]
Learning directed probabilistic logical models: ordering-search versus structure-searchDaan Fierens, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel. AMAI, 54(1-3):99-133, 2008. [doi]
A unifying framework for concept-learning algorithmsLuc De Raedt, Maurice Bruynooghe. ker, 7(3):251-269, 1992. [doi]
The Derivation of an Algorithm for Program SpecialisationJohn P. Gallagher, Maurice Bruynooghe. ngc, 9(3/4):305-334, 1991.
Constraint Propagation for First-Order Logic and Inductive DefinitionsJohan Wittocx, Marc Denecker, Maurice Bruynooghe. tocl, 14(3):17, 2013. [doi]
Freeness, Sharing, Linearity and Correctness - All at OnceMaurice Bruynooghe, Michael Codish. SAS 1993: 153-164
Belief Updating from Integrity Constraints and QueriesLuc De Raedt, Maurice Bruynooghe. ai, 53(2-3):291-307, 1992.
Abstract Domains: a Model-Theoretic approachDmitri Boulanger, Maurice Bruynooghe. ICLP 1994:
Multi-dimentsional Incremetal Loops Fusion for Data LocalitySven Verdoolaege, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor. asap 2003: 17-27 [doi]
Termination analysis of logic programs through combination of type-based normsMaurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, Wim Vanhoof. TOPLAS, 29(2):10, 2007. [doi]
On local domain symmetry for model expansionJo Devriendt, Bart Bogaerts 0001, Maurice Bruynooghe, Marc Denecker. tplp, 16(5-6):636-652, 2016. [doi]
The magic of logical inference in probabilistic programmingBernd Gutmann, Ingo Thon, Angelika Kimmig, Maurice Bruynooghe, Luc De Raedt. tplp, 11(4-5):663-680, 2011. [doi]
An Approximative Inference Method for Solving THERE EXISTS FOR ALL SO Satisfiability ProblemsHanne Vlaeminck, Johan Wittocx, Joost Vennekens, Marc Denecker, Maurice Bruynooghe. jelia 2010: 326-338 [doi]
Enhancing a search algorithm to perform intelligent backtrackingMaurice Bruynooghe. tplp, 4(3):371-380, 2004.
Equivalence checking of static affine programs using widening to handle recurrencesSven Verdoolaege, Gerda Janssens, Maurice Bruynooghe. TOPLAS, 34(3):11, 2012. [doi]
Deriving Transformations for Logic Programs Using Abstract InterpretationDmitri Boulanger, Maurice Bruynooghe. LOPSTR 1992: 99-117
Towards a modular binding-time analysis for higher-order MercuryWim Vanhoof, Maurice Bruynooghe. LOPSTR 2001: [doi]
Learning (k, l)-Contextual Tree Languages for Information ExtractionStefan Raeymaekers, Maurice Bruynooghe, Jan Van den Bussche. ecml 2005: 305-316 [doi]
Embracing Events in Causal Modelling: Interventions and Counterfactuals in CP-LogicJoost Vennekens, Maurice Bruynooghe, Marc Denecker. jelia 2010: 313-325 [doi]
Freeness Analysis for Logic Programs - And Correctness?Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe. ICLP 1993: 116-131
Analysis of Dependencies to Improve the Behaviour of Logic ProgramsMaurice Bruynooghe. cade 1980: 293-305
Abstract Interpretation: Towards the Global Optimization of Prolog ProgramsMaurice Bruynooghe, Gerda Janssens, Alain Callebaut, Bart Demoen. SLP 1987: 192-204
Improving Abstract Interpretations by Combining DomainsMichael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo. TOPLAS, 17(1):28-44, 1995. [doi]
Computational methods for database repair by signed formulaeOfer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe. AMAI, 46(1-2):4-37, 2006. [doi]
Computerized prediction of intensive care unit discharge after cardiac surgery: development and validation of a Gaussian processes modelGeert Meyfroidt, Fabián Güiza, Dominiek Cottem, Wilfried De Becker, Kristien Van Loon, Jean-Marie Aerts, Daniel Berckmans, Jan Ramon, Maurice Bruynooghe, Greet Vanden Berghe. midm, 11:64, 2011. [doi]
Mining data from intensive care patientsJan Ramon, Daan Fierens, Fabián Güiza, Geert Meyfroidt, Hendrik Blockeel, Maurice Bruynooghe, Greet Vanden Berghe. aei, 21(3):243-256, 2007. [doi]
Logic programming revisited: Logic programs as inductive definitionsMarc Denecker, Maurice Bruynooghe, V. Wiktor Marek. tocl, 2(4):623-654, 2001. [doi]
Online Learning and Exploiting Relational Models in Reinforcement LearningTom Croonenborghs, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe. IJCAI 2007: 726-731 [doi]
A Systematic Construction of Abstract DomainsDmitri Boulanger, Maurice Bruynooghe. SAS 1994: 61-77
Guest Editors Introduction: Special Section: Ten Years of Logic ProgrammingMaurice Bruynooghe, Saumya K. Debray, Manuel V. Hermenegildo, Michael J. Maher. jlp, 23(2):87-88, 1995.
Abstract Unification for a Composite Domain Deriving Sharing and Freeness Properties of Program VariablesMaurice Bruynooghe, Michael Codish, Anne Mulkers. ICLP 1994:
A Polyvariant Binding-Time Analysis for Off-line Partial DeductionMaurice Bruynooghe, Michael Leuschel, Konstantinos F. Sagonas. ESOP 1998: 27-41 [doi]
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive DefinitionsMaarten Mariën, Johan Wittocx, Marc Denecker, Maurice Bruynooghe. sat 2008: 211-224 [doi]
Predicate Introduction Under Stable and Well-Founded SemanticsJohan Wittocx, Joost Vennekens, Maarten Mariën, Marc Denecker, Maurice Bruynooghe. ICLP 2006: 242-256 [doi]
Bootstrapping Inference in the IDP Knowledge Base SystemBart Bogaerts 0001, Joachim Jansen, Broes de Cat, Gerda Janssens, Maurice Bruynooghe, Marc Denecker. ngc, 34(3):193-220, 2016. [doi]
Representing Causal Information About a Probabilistic ProcessJoost Vennekens, Marc Denecker, Maurice Bruynooghe. jelia 2006: 452-464 [doi]
Detecting Unsolvable Queries for Definite Logic ProgramsMaurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker. plilp 1998: 118-133 [doi]
CHICA, an Abductive Planning System Based on Event CalculusLode Missiaen, Maurice Bruynooghe, Marc Denecker. logcom, 5(5):579-602, 1995.
Equivalence Checking of Static Affine Programs Using Widening to Handle RecurrencesSven Verdoolaege, Gerda Janssens, Maurice Bruynooghe. cav 2009: 599-613 [doi]
Towards Modular Binding-Time Analysis for First-order MercuryWim Vanhoof, Maurice Bruynooghe. TCS, 30(2):189-198, 1999. [doi]
Practical Aspects for a Working Compile Time Garbage Collection System for MercuryNancy Mazur, Peter Ross, Gerda Janssens, Maurice Bruynooghe. ICLP 2001: 105-119 [doi]
ProbLog Technology for Inference in a Probabilistic First Order LogicMaurice Bruynooghe, Theofrastos Mantadelis, Angelika Kimmig, Bernd Gutmann, Joost Vennekens, Gerda Janssens, Luc De Raedt. ecai 2010: 719-724 [doi]
Deriving Descriptions of Possible Values of Program Variables by Means of Abstract InterpretationG. Janssen, Maurice Bruynooghe. jlp, 13(2&3):205-258, 1992.
Guest Editor s IntroductionMaurice Bruynooghe, Saumya K. Debray, Manuel V. Hermenegildo, Michael J. Maher. jlp, 19/20:1-3, 1994.
Well-founded and stable semantics of logic programs with aggregatesNikolay Pelov, Marc Denecker, Maurice Bruynooghe. tplp, 7(3):301-353, 2007. [doi]
Programming Language Implementation and Logic Programming, 5th International Symposium, PLILP 93, Tallinn, Estonia, August 25-27, 1993, ProceedingsMaurice Bruynooghe, Jaan Penjam, editors, Volume 714 of Lecture Notes in Computer Science, Springer, 1993.
Information extraction from structured documents using ::::k::::-testable tree automaton inferenceRaymond Kosala, Hendrik Blockeel, Maurice Bruynooghe, Jan Van den Bussche. DKE, 58(2):129-158, 2006. [doi]
Answer Set Programming's Contributions to Classical Logic - An Analysis of ASP MethodologyMarc Denecker, Joost Vennekens, Hanne Vlaeminck, Johan Wittocx, Maurice Bruynooghe. BIRTHDAY 2011: 12-32 [doi]
Storage Size Reduction by In-place Mapping of ArraysRemko Tronçon, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor. vmcai 2002: 167-181 [doi]
Binding-Time Annotations Without Binding-Time AnalysisWim Vanhoof, Maurice Bruynooghe. lpar 2001: 707-722 [doi]
Approximate Query Answering in Locally Closed DatabasesAlvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe. AAAI 2007: 397-402
Representation of Partial Knowledge and Query Answering in Locally Complete DatabasesAlvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe. lpar 2006: 407-421 [doi]
Binding-Time Analysis for MercuryWim Vanhoof, Maurice Bruynooghe, Michael Leuschel. LOPSTR 2004: 189-232 [doi]
Deduction Revision by Intelligent BacktrackingMaurice Bruynooghe, Luís Moniz Pereira. In Implementations of Prolog. pages 194-215, 1984.
Generation and Compilation of Efficient Computation RulesKristof Verschaetse, Danny De Schreye, Maurice Bruynooghe. ICLP 1990: 700-714
Logic Programming, Proceedings of the 1994 International Symposium, Ithaca, New York, USA, November 13-17, 1994Maurice Bruynooghe, editor, MIT Press, 1994.
A Module Based Analysis for Memory Reuse in MercuryNancy Mazur, Gerda Janssens, Maurice Bruynooghe. cl 2000: 1255-1269 [doi]
Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-SearchDaan Fierens, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel. ecml 2007: 567-574 [doi]
Improving Abstract Interpretations by Combining DomainsMichael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo. PEPM 1993: 194-205
On Negation and Three-Valued Logic in Interactive Concept-LearningLuc De Raedt, Maurice Bruynooghe. ecai 1990: 207-212
Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanismDanny De Schreye, Dirk Pollet, Johan Ronsyn, Maurice Bruynooghe. ESOP 1990: 106-117
Learning Directed Probabilistic Logical Models Using Ordering-SearchDaan Fierens, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel. ilp 2008: 24 [doi]
A Polynomial-time Metric for Outerplanar GraphsLeander Schietgat, Jan Ramon, Maurice Bruynooghe. mlg 2007: [doi]
Inference of Well-Typings for Logic Programs with Application to Termination AnalysisMaurice Bruynooghe, John P. Gallagher, Wouter Van Humbeeck. SAS 2005: 35-51 [doi]
Special Issue on Program Development, Guest Editors IntroductionMaurice Bruynooghe, Kung-Kiu Lau. tplp, 2(4-5):423-424, 2002.
Goal Dependent versus Goal Independent Analysis of Logic ProgramsMichael Codish, Maria J. García de la Banda, Maurice Bruynooghe, Manuel V. Hermenegildo. lpar 1994: 305-319
On the Transformation of Logic Programs with Instantiation Based Computation RulesDanny De Schreye, Maurice Bruynooghe. JSC, 7(2):125-154, 1989.
Dynamic Data Analysis and Data Mining for Prediction of Clinical StabilityKristien Van Loon, FabiÃ¡n GÃ¼iza, Geert Meyfroidt, Jean-Marie Aerts, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe, Greet Vanden Berghe, Daniel Berckmans. mie 2009: 590-594 [doi]
Experience with widening based equivalence checking in realistic multimedia systemsSven Verdoolaege, Martin Palkovic, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor. hldvt 2009: 122-129 [doi]
Database Repair by Signed FormulaeOfer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe. foiks 2004: 14-30 [doi]
A Practical Framework for the Abstract Interpretation of Logic ProgramsMaurice Bruynooghe. jlp, 10(1/2/3&4):91-124, 1991.
A Framework for Defining Distances Between First-Order Logic ObjectsJan Ramon, Maurice Bruynooghe. ilp 1998: 271-280
Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SATJo Devriendt, Bart Bogaerts 0001, Maurice Bruynooghe. sat 2017: 83-100 [doi]
Binding-time Analysis for MercuryWim Vanhoof, Maurice Bruynooghe. ICLP 1999: 500-514
A comparison of pruning criteria for probability treesDaan Fierens, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe. ml, 78(1-2):251-285, 2010. [doi]
On Abstracting the Procedural Behaviour of Logic ProgramsGerda Janssens, Maurice Bruynooghe. lpar 1992: 240-262
Logical Bayesian Networks and Their Relation to Other Probabilistic Logical ModelsDaan Fierens, Hendrik Blockeel, Maurice Bruynooghe, Jan Ramon. bnaic 2005: 343-344
A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretationMaurice Bruynooghe, Bart Demoen, Dmitri Boulanger, Marc Denecker, Anne Mulkers. SAS 1996: 128-142
Detecting Unsolvable Queries for Definite Logic ProgramsMaurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker. jflp, 1999(Special Issue 2), 1999.
Using Abstract Interpretation for Goal ReplacementDmitri Boulanger, Maurice Bruynooghe. LOPSTR 1993: 210-228
Intelligent Backtracking RevistedMaurice Bruynooghe. BIRTHDAY 1991: 166-177
The Impact of Abstract Interpretation: An Experiment in Code GenerationAndré Mariën, Gerda Janssens, Anne Mulkers, Maurice Bruynooghe. ICLP 1989: 33-47
Automatic functional verification of memory oriented global source code transformationsK. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens. hldvt 2003: 31-36 [doi]
Coherent Composition of Distributed Knowledge-Bases Through AbductionOfer Arieli, Bert Van Nuffelen, Marc Denecker, Maurice Bruynooghe. lpar 2001: 624-638 [doi]
Distance-Based Repairs of DatabasesOfer Arieli, Marc Denecker, Maurice Bruynooghe. jelia 2006: 43-55 [doi]
An approximative inference method for solving ∃∀SO satisfiability problemsHanne Vlaeminck, Joost Vennekens, Marc Denecker, Maurice Bruynooghe. jair, 45:79-124, 2012. [doi]
FO(ID) as an extension of DL with rulesJoost Vennekens, Marc Denecker, Maurice Bruynooghe. AMAI, 58(1-2):85-115, 2010. [doi]
When Size Does MatterWim Vanhoof, Maurice Bruynooghe. LOPSTR 2001: 129-147 [doi]
Declarative Bias for Specific-to-General ILP SystemsHilde Adé, Luc De Raedt, Maurice Bruynooghe. ml, 20(1-2):119-154, 1995.
First Order Logic with Inductive Definitions for Model-Based Problem SolvingMaurice Bruynooghe, Marc Denecker, Miroslaw Truszczynski. aim, 37(3):69-80, 2016. [doi]
Multi-agent Relational Reinforcement LearningTom Croonenborghs, Karl Tuyls, Jan Ramon, Maurice Bruynooghe. lamas 2006: 192-206 [doi]
Approximation Fixpoint Theory and the Semantics of Logic and Answers Set ProgramsMarc Denecker, Maurice Bruynooghe, Joost Vennekens. BIRTHDAY 2012: 178-194 [doi]
Temporal Reasoning with Abductive Event CalculusMarc Denecker, Lode Missiaen, Maurice Bruynooghe. ecai 1992: 384-388
An Application of Abstract Interpretation in Source Level Program TransformationDanny De Schreye, Maurice Bruynooghe. plilp 1989: 35-57
A Portrait of a Scientist as a Computational LogicianMaurice Bruynooghe, Luís Moniz Pereira, Jörg H. Siekmann, Maarten H. van Emden. BIRTHDAY 2002: 1-4 [doi]
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint TheoryLinde Vanbesien, Maurice Bruynooghe, Marc Denecker. tplp, 22(4):523-537, 2022. [doi]
A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic ProgramsMaurice Bruynooghe, Danny De Schreye, Bern Martens. SLP 1991: 117-131
Transformation to Dynamic Single Assignment Using a Simple Data Flow AnalysisPeter Vanbroekhoven, Gerda Janssens, Maurice Bruynooghe, Francky Catthoor. aplas 2005: 330-346 [doi]
On the Local Closed-World Assumption of Data-SourcesAlvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Bert Van Nuffelen, Maurice Bruynooghe. lpnmr 2005: 145-157 [doi]
Live-Structure Analysis for Logic Programming Languages with DeclarationsMaurice Bruynooghe, Gerda Janssens, Andreas Kågedal. ICLP 1997: 33-47
Some Reflexions on Implementation Issues of PrologMaurice Bruynooghe. ICLP 1983: 1-6 [doi]
Freeness Analysis in the Presence of Numerical ConstraintsVeroniek Dumortier, Gerda Janssens, Maurice Bruynooghe, Michael Codish. ICLP 1993: 100-115
Logic Based Program Synthesis and Transformation, 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected PapersMaurice Bruynooghe, editor, Volume 3018 of Lecture Notes in Computer Science, Springer, 2004.
Modeling Machine Learning and Data Mining Problems with FO(·)Hendrik Blockeel, Bart Bogaerts, Maurice Bruynooghe, Broes de Cat, Stef De Pooter, Marc Denecker, Anthony Labarre, Jan Ramon, Sicco Verwer. ICLP 2012: 14-25 [doi]
Live-Structure Dataflow Analysis for PrologAnne Mulkers, William H. Winsborough, Maurice Bruynooghe. TOPLAS, 16(2):205-258, 1994. [doi]
Abstract interpretation for constraint logic programmingMaurice Bruynooghe. jfplc 1992:
Logical Bayesian Networks and Their Relation to Other Probabilistic Logical ModelsDaan Fierens, Hendrik Blockeel, Maurice Bruynooghe, Jan Ramon. ilp 2005: 121-135 [doi]
On the Practicality of Abstract Equation SystemsAnne Mulkers, Wim Simoens, Gerda Janssens, Maurice Bruynooghe. ICLP 1995: 781-795
Extending constraint logic programming with open functionsNikolay Pelov, Maurice Bruynooghe. ppdp 2000: 235-244 [doi]
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizationsSven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe. cases 2004: 248-258 [doi]
Sub Node Extraction with Tree Based WrappersStefan Raeymaekers, Maurice Bruynooghe. ecai 2008: 137-141 [doi]
Abstracting s-semantincs Using A Model-Theoretic ApproachDmitri Boulanger, Maurice Bruynooghe, Marc Denecker. plilp 1994: 432-446
A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic ProgramsGerda Janssens, Maurice Bruynooghe, Veroniek Dumortier. SLP 1995: 336-350
Towards a Real-Time Garbage Collector for PrologEdwin Pittomvils, Maurice Bruynooghe, Yves D. Willems. SLP 1985: 185-198
A polynomial time computable metric between point setsJan Ramon, Maurice Bruynooghe. ACTA, 37(10):765-780, 2001. [doi]
Programming Language Implementation and Logic Programming, 4th International Symposium, PLILP 92, Leuven, Belgium, August 26-28, 1992, ProceedingsMaurice Bruynooghe, Martin Wirsing, editors, Volume 631 of Lecture Notes in Computer Science, Springer, 1992.
Using Call/Exit Analysis for Logic Program TransformationDmitri Boulanger, Maurice Bruynooghe. LOPSTR 1994: 36-50
Compiling ControlMaurice Bruynooghe, Danny De Schreye, Bruno Krekels. SLP 1986: 70-77
Distance semantics for database repairOfer Arieli, Marc Denecker, Maurice Bruynooghe. AMAI, 50(3-4):389-415, 2007. [doi]
Mining rooted ordered trees under subtree homeomorphismMostafa Haghir Chehreghani, Maurice Bruynooghe. datamine, 30(5):1249-1272, 2016. [doi]
A Comparison of Approaches for Learning Probability TreesDaan Fierens, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe. ecml 2005: 556-563 [doi]
Learning ( ::::k:::: , ::::l:::: )-contextual tree languages for information extraction from web pagesStefan Raeymaekers, Maurice Bruynooghe, Jan Van den Bussche. ml, 71(2-3):155-183, 2008. [doi]
Information Extraction from Web Documents Based on Local Unranked Tree Automaton InferenceRaymond Kosala, Maurice Bruynooghe, Jan Van den Bussche, Hendrik Blockeel. IJCAI 2003: 403-408
Analysis of Shared Data Structures for Compile-Time GarbageAnne Mulkers, William H. Winsborough, Maurice Bruynooghe. ICLP 1990: 747-762
From Monomorphic to Polymorphic Well-Typings and BeyondTom Schrijvers, Maurice Bruynooghe, John P. Gallagher. LOPSTR 2009: 152-167 [doi]
IDP3Maurice Bruynooghe, Hendrik Blockeel, Bart Bogaerts 0001, Broes de Cat, Stef De Pooter, Joachim Jansen, Anthony Labarre, Jan Ramon, Marc Denecker, Sicco Verwer. tplp, 15(6):783-817, 2015. [doi]
Lazy Model Expansion: Interleaving Grounding with SearchBroes de Cat, Marc Denecker, Maurice Bruynooghe, Peter J. Stuckey. jair, 52:235-286, 2015. [doi]
Abstract Interpretation for (Constraint) Logic ProgrammingMaurice Bruynooghe, Dmitri Boulanger. nato 1994: 228-260 [doi]
Generalized ordering-search for learning directed probabilistic logical modelsJan Ramon, Tom Croonenborghs, Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe. ml, 70(2-3):169-188, 2008. [doi]
Data Integration Using ID-LogicBert Van Nuffelen, Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe. caise 2004: 67-81 [doi]
Specialising Interpreters Using Offline Partial DeductionMichael Leuschel, Stephen-John Craig, Maurice Bruynooghe, Wim Vanhoof. LOPSTR 2004: 340-375 [doi]
Simulating Dynamic Systems Using Linear Time Calculus TheoriesBart Bogaerts, Joachim Jansen, Maurice Bruynooghe, Broes de Cat, Joost Vennekens, Marc Denecker. tplp, 14(4-5):477-492, 2014. [doi]
Using Symmetries to Lift Satisfiability CheckingPierre Carbonnelle, Gottfried Schenner, Maurice Bruynooghe, Bart Bogaerts 0001, Marc Denecker. AAAI 2024: 7961-7968 [doi]
CP-logic: A language of causal probabilistic events and its relation to logic programmingJoost Vennekens, Marc Denecker, Maurice Bruynooghe. tplp, 9(3):245-308, 2009. [doi]
The Compilation of Forward Checking Regimes through Meta-Interpretation and TransformationDanny De Schreye, Maurice Bruynooghe. meta 1988: 217-231
Towards a logical reconstruction of a theory for locally closed databasesMarc Denecker, Alvaro Cortés-Calabuig, Maurice Bruynooghe, Ofer Arieli. TODS, 35(3), 2010. [doi]
A Fixed Point Semantics for Logic Programs Extended with CutsWim Vanhoof, Remko Tronçon, Maurice Bruynooghe. LOPSTR 2003: 238-257 [doi]
Algorithms for Weighted Counting over Parametric Polytopes: A Survey and a Practical ComparisonSven Verdoolaege, Maurice Bruynooghe. itsl 2008: 60-66
Adding Redundancy to Obtain more Reliable and Readable Prolog ProgramsMaurice Bruynooghe. ICLP 1982: 129-133
Generalizing Multiple Examples in Explanation Based LearningGunther Sablon, Luc De Raedt, Maurice Bruynooghe. aii 1989: 177-183
Integrity Constraint Checking in Deductive Databases Using a Rule/Goal GraphBern Martens, Maurice Bruynooghe. treds 1988: 567-601
Towards Friendly Concept-LearnersLuc De Raedt, Maurice Bruynooghe. IJCAI 1989: 849-858
Propagation: A New Operation in a Framework for Abstract Interpretation of Logic ProgramsMaurice Bruynooghe, Gerda Janssens. meta 1992: 294-307
A General Criterion for Avoiding Infinite Unfolding during Partial DeductionMaurice Bruynooghe, Danny De Schreye, Bern Martens. ngc, 11(1):47-79, 1992.
Compact Representation of Knowledge Bases in Inductive Logic ProgrammingJan Struyf, Jan Ramon, Maurice Bruynooghe, Sofie Verbaeten, Hendrik Blockeel. ml, 57(3):305-333, 2004. [doi]
Logic programs with annotated disjunctionsJoost Vennekens, Sofie Verbaeten, Maurice Bruynooghe. lpnmr 2004: 409-415 [doi]
Satisfiability Checking for PC(ID)Maarten Mariën, Rudradeb Mitra, Marc Denecker, Maurice Bruynooghe. lpar 2005: 565-579 [doi]
On the Transformation of Object-Oriented Conceptual Models to Logical TheoriesPieter Bekaert, Bert Van Nuffelen, Maurice Bruynooghe, David Gilis, Marc Denecker. er 2002: 152-166 [doi]
Reuse of Results in Termination Analysis of Typed Logic ProgramsMaurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof. SAS 2002: 477-492 [doi]
A Theory of Clausal DiscoveryLuc De Raedt, Maurice Bruynooghe. IJCAI 1993: 1058-1063
Constructive Induction by AnalogyLuc De Raedt, Maurice Bruynooghe. icml 1989: 476-477
Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete DatabasesAlvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe. kr 2008: 81-91
Offline specialisation in Prolog using a hand-written compiler generatorMichael Leuschel, Jesper Jørgensen, Wim Vanhoof, Maurice Bruynooghe. tplp, 4(1-2):139-191, 2004.
Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic ProgramsDmitri Boulanger, Maurice Bruynooghe, Danny De Schreye. lpe 1993: 39-51

All Publications

Filter by Year

Filter by Type

Filter by Topic

Filter by Venue

Filter by Co-author

Filter by Top terms

Download

External Links

Profile Name

Statistics

Aliases

Researchr

Maurice Bruynooghe's Profile

Unidentified Publications