The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Maurice Bruynooghe: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Luc De Raedt, Maurice Bruynooghe
    A Theory of Clausal Discovery. [Citation Graph (4, 0)][DBLP]
    IJCAI, 1993, pp:1058-1063 [Conf]
  2. Luc De Raedt, Maurice Bruynooghe
    Belief Updating from Integrity Constraints and Queries. [Citation Graph (3, 0)][DBLP]
    Artif. Intell., 1992, v:53, n:2-3, pp:291-307 [Journal]
  3. Maurice Bruynooghe, Gerda Janssens, Alain Callebaut, Bart Demoen
    Abstract Interpretation: Towards the Global Optimization of Prolog Programs. [Citation Graph (2, 0)][DBLP]
    SLP, 1987, pp:192-204 [Conf]
  4. Bern Martens, Maurice Bruynooghe
    Integrity Constraint Checking in Deductive Databases Using a Rule/Goal Graph. [Citation Graph (1, 0)][DBLP]
    Expert Database Conf., 1988, pp:567-601 [Conf]
  5. Maurice Bruynooghe
    A Note on Garbage-Collection in Prolog Interpreters. [Citation Graph (1, 0)][DBLP]
    ICLP, 1982, pp:52-55 [Conf]
  6. Maurice Bruynooghe
    Adding Redundancy to Obtain more Reliable and Readable Prolog Programs. [Citation Graph (1, 0)][DBLP]
    ICLP, 1982, pp:129-133 [Conf]
  7. Maurice Bruynooghe, Gerda Janssens
    An Instance of Abstract Interpretation Integrating Type and Mode Inferencing. [Citation Graph (1, 0)][DBLP]
    ICLP/SLP, 1988, pp:669-683 [Conf]
  8. Danny De Schreye, Maurice Bruynooghe
    The Compilation of Forward Checking Regimes through Meta-Interpretation and Transformation. [Citation Graph (1, 0)][DBLP]
    META, 1988, pp:217-231 [Conf]
  9. Maurice Bruynooghe, Danny De Schreye
    Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-based Learning. [Citation Graph (0, 0)][DBLP]
    AII, 1989, pp:60-77 [Conf]
  10. Gunther Sablon, Luc De Raedt, Maurice Bruynooghe
    Generalizing Multiple Examples in Explanation Based Learning. [Citation Graph (0, 0)][DBLP]
    AII, 1989, pp:177-183 [Conf]
  11. Maurice Bruynooghe
    Is Logic Programming ``Real'' Programming? [Citation Graph (0, 0)][DBLP]
    AIMSA, 1986, pp:81-91 [Conf]
  12. Willem Rosiers, Maurice Bruynooghe
    Empirical Study of some Constraints Satisfaction Algorithms. [Citation Graph (0, 0)][DBLP]
    AIMSA, 1986, pp:173-180 [Conf]
  13. Peter Vanbroekhoven, Gerda Janssens, Maurice Bruynooghe, Francky Catthoor
    Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis. [Citation Graph (0, 0)][DBLP]
    APLAS, 2005, pp:330-346 [Conf]
  14. Sven Verdoolaege, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor
    Multi-dimentsional Incremetal Loops Fusion for Data Locality. [Citation Graph (0, 0)][DBLP]
    ASAP, 2003, pp:17-27 [Conf]
  15. Nikolay Pelov, Marc Denecker, Maurice Bruynooghe
    Translation of Aggregate Programs to Normal Logic Programs. [Citation Graph (0, 0)][DBLP]
    Answer Set Programming, 2003, pp:- [Conf]
  16. Maurice Bruynooghe
    Intelligent Backtracking Revisted. [Citation Graph (0, 0)][DBLP]
    Computational Logic - Essays in Honor of Alan Robinson, 1991, pp:166-177 [Conf]
  17. Maurice Bruynooghe, Luís Moniz Pereira, Jörg H. Siekmann, Maarten H. van Emden
    A Portrait of a Scientist as a Computational Logician. [Citation Graph (0, 0)][DBLP]
    Computational Logic: Logic Programming and Beyond, 2002, pp:1-4 [Conf]
  18. Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Bert Van Nuffelen, Maurice Bruynooghe
    On the Local Closed-World Assumption of Data-Sources. [Citation Graph (0, 0)][DBLP]
    BNAIC, 2005, pp:333-334 [Conf]
  19. Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe, Jan Ramon
    Logical Bayesian Networks and Their Relation to Other Probabilistic Logical Models. [Citation Graph (0, 0)][DBLP]
    BNAIC, 2005, pp:343-344 [Conf]
  20. Maurice Bruynooghe
    Analysis of Dependencies to Improve the Behaviour of Logic Programs. [Citation Graph (0, 0)][DBLP]
    CADE, 1980, pp:293-305 [Conf]
  21. Bert Van Nuffelen, Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe
    Data Integration Using ID-Logic. [Citation Graph (0, 0)][DBLP]
    CAiSE, 2004, pp:67-81 [Conf]
  22. Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe
    Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations. [Citation Graph (0, 0)][DBLP]
    CASES, 2004, pp:248-258 [Conf]
  23. K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens
    Verification of Source Code Transformations by Program Equivalence Checking. [Citation Graph (0, 0)][DBLP]
    CC, 2005, pp:221-236 [Conf]
  24. Sven Verdoolaege, Kristof Beyls, Maurice Bruynooghe, Francky Catthoor
    Experiences with Enumeration of Integer Projections of Parametric Polytopes. [Citation Graph (0, 0)][DBLP]
    CC, 2005, pp:91-105 [Conf]
  25. Nancy Mazur, Gerda Janssens, Maurice Bruynooghe
    A Module Based Analysis for Memory Reuse in Mercury. [Citation Graph (0, 0)][DBLP]
    Computational Logic, 2000, pp:1255-1269 [Conf]
  26. K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens
    Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code. [Citation Graph (0, 0)][DBLP]
    DATE, 2005, pp:1310-1315 [Conf]
  27. Hilde Adé, Luc De Raedt, Maurice Bruynooghe
    Inverse Resolution in an Integrated Inductive-Deductive Learning System. [Citation Graph (0, 0)][DBLP]
    ECAI, 1992, pp:456-457 [Conf]
  28. Marc Denecker, Lode Missiaen, Maurice Bruynooghe
    Temporal Reasoning with Abductive Event Calculus. [Citation Graph (0, 0)][DBLP]
    ECAI, 1992, pp:384-388 [Conf]
  29. Luc De Raedt, Maurice Bruynooghe
    On Negation and Three-Valued Logic in Interactive Concept-Learning. [Citation Graph (0, 0)][DBLP]
    ECAI, 1990, pp:207-212 [Conf]
  30. Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe
    A Comparison of Approaches for Learning Probability Trees. [Citation Graph (0, 0)][DBLP]
    ECML, 2005, pp:556-563 [Conf]
  31. Luc De Raedt, Maurice Bruynooghe
    On Interactive Concept-Learning and Assimilation. [Citation Graph (0, 0)][DBLP]
    EWSL, 1988, pp:167-176 [Conf]
  32. Luc De Raedt, Johan Feyaerts, Maurice Bruynooghe
    Acquiring Object-Knowledge for Learning Systems. [Citation Graph (0, 0)][DBLP]
    EWSL, 1991, pp:245-264 [Conf]
  33. Stefan Raeymaekers, Maurice Bruynooghe, Jan Van den Bussche
    Learning (k, l)-Contextual Tree Languages for Information Extraction. [Citation Graph (0, 0)][DBLP]
    ECML, 2005, pp:305-316 [Conf]
  34. Pieter Bekaert, Bert Van Nuffelen, Maurice Bruynooghe, David Gilis, Marc Denecker
    On the Transformation of Object-Oriented Conceptual Models to Logical Theories. [Citation Graph (0, 0)][DBLP]
    ER, 2002, pp:152-166 [Conf]
  35. Maurice Bruynooghe, Wim Vanhoof, Michael Codish
    Pos(T): Analyzing Dependencies in Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2001, pp:406-420 [Conf]
  36. Maurice Bruynooghe, Michael Leuschel, Konstantinos F. Sagonas
    A Polyvariant Binding-Time Analysis for Off-line Partial Deduction. [Citation Graph (0, 0)][DBLP]
    ESOP, 1998, pp:27-41 [Conf]
  37. Danny De Schreye, Dirk Pollet, Johan Ronsyn, Maurice Bruynooghe
    Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism. [Citation Graph (0, 0)][DBLP]
    ESOP, 1990, pp:106-117 [Conf]
  38. Patrick Weemeeuw, Maurice Bruynooghe, Marleen De Haondt
    On Implementing Logic Programming Languages on a Dataflow Architecture. [Citation Graph (0, 0)][DBLP]
    ESOP, 1988, pp:359-372 [Conf]
  39. Bern Martens, Danny De Schreye, Maurice Bruynooghe
    Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. [Citation Graph (0, 0)][DBLP]
    FGCS, 1992, pp:473-480 [Conf]
  40. Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe
    A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns. [Citation Graph (0, 0)][DBLP]
    FGCS, 1992, pp:481-488 [Conf]
  41. Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe
    Database Repair by Signed Formulae. [Citation Graph (0, 0)][DBLP]
    FoIKS, 2004, pp:14-30 [Conf]
  42. Maurice Bruynooghe, Gerda Janssens, Andreas Kågedal
    Live-Structure Analysis for Logic Programming Languages with Declarations. [Citation Graph (0, 0)][DBLP]
    ICLP, 1997, pp:33-47 [Conf]
  43. Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe
    Freeness Analysis for Logic Programs - And Correctness? [Citation Graph (0, 0)][DBLP]
    ICLP, 1993, pp:116-131 [Conf]
  44. Marc Denecker, Nikolay Pelov, Maurice Bruynooghe
    Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:212-226 [Conf]
  45. Veroniek Dumortier, Gerda Janssens, Maurice Bruynooghe, Michael Codish
    Freeness Analysis in the Presence of Numerical Constraints. [Citation Graph (0, 0)][DBLP]
    ICLP, 1993, pp:100-115 [Conf]
  46. John P. Gallagher, Maurice Bruynooghe
    The Derivation of an Algorithm for Program Specialisation. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:732-746 [Conf]
  47. André Mariën, Gerda Janssens, Anne Mulkers, Maurice Bruynooghe
    The Impact of Abstract Interpretation: An Experiment in Code Generation. [Citation Graph (0, 0)][DBLP]
    ICLP, 1989, pp:33-47 [Conf]
  48. Nancy Mazur, Peter Ross, Gerda Janssens, Maurice Bruynooghe
    Practical Aspects for a Working Compile Time Garbage Collection System for Mercury. [Citation Graph (0, 0)][DBLP]
    ICLP, 2001, pp:105-119 [Conf]
  49. Anne Mulkers, Wim Simoens, Gerda Janssens, Maurice Bruynooghe
    On the Practicality of Abstract Equation Systems. [Citation Graph (0, 0)][DBLP]
    ICLP, 1995, pp:781-795 [Conf]
  50. Anne Mulkers, William H. Winsborough, Maurice Bruynooghe
    Analysis of Shared Data Structures for Compile-Time Garbage. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:747-762 [Conf]
  51. Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe
    A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:649-663 [Conf]
  52. Wim Vanhoof, Maurice Bruynooghe
    Binding-time Analysis for Mercury. [Citation Graph (0, 0)][DBLP]
    ICLP, 1999, pp:500-514 [Conf]
  53. Joost Vennekens, Sofie Verbaeten, Maurice Bruynooghe
    Logic Programs with Annotated Disjunctions. [Citation Graph (0, 0)][DBLP]
    ICLP, 2004, pp:431-445 [Conf]
  54. Kristof Verschaetse, Danny De Schreye, Maurice Bruynooghe
    Generation and Compilation of Efficient Computation Rules. [Citation Graph (0, 0)][DBLP]
    ICLP, 1990, pp:700-714 [Conf]
  55. Johan Wittocx, Joost Vennekens, Maarten Mariën, Marc Denecker, Maurice Bruynooghe
    Predicate Introduction Under Stable and Well-Founded Semantics. [Citation Graph (0, 0)][DBLP]
    ICLP, 2006, pp:242-256 [Conf]
  56. Luc De Raedt, Maurice Bruynooghe
    Constructive Induction by Analogy. [Citation Graph (0, 0)][DBLP]
    ML, 1989, pp:476-477 [Conf]
  57. Luc De Raedt, Maurice Bruynooghe, Bern Martens
    Integrity Constraints and Interactive Concept-Learning. [Citation Graph (0, 0)][DBLP]
    ML, 1991, pp:394-398 [Conf]
  58. Maurice Bruynooghe, Luc De Raedt, Danny De Schreye
    Explanation Based Program Transformation. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:407-412 [Conf]
  59. Raymond Kosala, Maurice Bruynooghe, Jan Van den Bussche, Hendrik Blockeel
    Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:403-408 [Conf]
  60. Luc De Raedt, Maurice Bruynooghe
    Towards Friendly Concept-Learners. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1989, pp:849-858 [Conf]
  61. Tom Croonenborghs, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe
    Online Learning and Exploiting Relational Models in Reinforcement Learning. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:726-731 [Conf]
  62. Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe, Jan Ramon
    Logical Bayesian Networks and Their Relation to Other Probabilistic Logical Models. [Citation Graph (0, 0)][DBLP]
    ILP, 2005, pp:121-135 [Conf]
  63. Jan Ramon, Maurice Bruynooghe
    A Framework for Defining Distances Between First-Order Logic Objects. [Citation Graph (0, 0)][DBLP]
    ILP, 1998, pp:271-280 [Conf]
  64. Ofer Arieli, Marc Denecker, Maurice Bruynooghe
    Distance-Based Repairs of Databases. [Citation Graph (0, 0)][DBLP]
    JELIA, 2006, pp:43-55 [Conf]
  65. Joost Vennekens, Marc Denecker, Maurice Bruynooghe
    Representing Causal Information About a Probabilistic Process. [Citation Graph (0, 0)][DBLP]
    JELIA, 2006, pp:452-464 [Conf]
  66. Maurice Bruynooghe
    Abstract interpretation for constraint logic programming. [Citation Graph (0, 0)][DBLP]
    JFPL, 1992, pp:- [Conf]
  67. Tom Croonenborghs, Karl Tuyls, Jan Ramon, Maurice Bruynooghe
    Multi-agent Relational Reinforcement Learning. [Citation Graph (0, 0)][DBLP]
    LAMAS, 2005, pp:192-206 [Conf]
  68. Dmitri Boulanger, Maurice Bruynooghe
    Using Abstract Interpretation for Goal Replacement. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1993, pp:210-228 [Conf]
  69. Dmitri Boulanger, Maurice Bruynooghe
    Using Call/Exit Analysis for Logic Program Transformation. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1994, pp:36-50 [Conf]
  70. Dmitri Boulanger, Maurice Bruynooghe
    Deriving Transformations for Logic Programs Using Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1992, pp:99-117 [Conf]
  71. Michael Leuschel, Stephen-John Craig, Maurice Bruynooghe, Wim Vanhoof
    Specialising Interpreters Using Offline Partial Deduction. [Citation Graph (0, 0)][DBLP]
    Program Development in Computational Logic, 2004, pp:340-375 [Conf]
  72. Wim Vanhoof, Maurice Bruynooghe
    Towards a modular binding-time analysis for higher-order Mercury. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2000, pp:- [Conf]
  73. Wim Vanhoof, Maurice Bruynooghe
    When Size Does Matter. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2001, pp:129-147 [Conf]
  74. Wim Vanhoof, Maurice Bruynooghe, Michael Leuschel
    Binding-Time Analysis for Mercury. [Citation Graph (0, 0)][DBLP]
    Program Development in Computational Logic, 2004, pp:189-232 [Conf]
  75. Wim Vanhoof, Remko Tronçon, Maurice Bruynooghe
    A Fixed Point Semantics for Logic Programs Extended with Cuts. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 2002, pp:238-257 [Conf]
  76. Ofer Arieli, Bert Van Nuffelen, Marc Denecker, Maurice Bruynooghe
    Coherent Composition of Distributed Knowledge-Bases Through Abduction. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:624-638 [Conf]
  77. Michael Codish, Maria J. García de la Banda, Maurice Bruynooghe, Manuel V. Hermenegildo
    Goal Dependent versus Goal Independent Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPAR, 1994, pp:305-319 [Conf]
  78. Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe
    Representation of Partial Knowledge and Query Answering in Locally Complete Databases. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:407-421 [Conf]
  79. Gerda Janssens, Maurice Bruynooghe
    On Abstracting the Procedural Behaviour of Logic Programs. [Citation Graph (0, 0)][DBLP]
    RCLP, 1991, pp:240-262 [Conf]
  80. Maarten Mariën, Rudradeb Mitra, Marc Denecker, Maurice Bruynooghe
    Satisfiability Checking for PC(ID). [Citation Graph (0, 0)][DBLP]
    LPAR, 2005, pp:565-579 [Conf]
  81. Nikolay Pelov, Maurice Bruynooghe
    Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog. [Citation Graph (0, 0)][DBLP]
    LPAR, 1999, pp:358-375 [Conf]
  82. Wim Vanhoof, Maurice Bruynooghe
    Binding-Time Annotations Without Binding-Time Analysis. [Citation Graph (0, 0)][DBLP]
    LPAR, 2001, pp:707-722 [Conf]
  83. Dmitri Boulanger, Maurice Bruynooghe, Danny De Schreye
    Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    LPE, 1993, pp:39-51 [Conf]
  84. Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Bert Van Nuffelen, Maurice Bruynooghe
    On the Local Closed-World Assumption of Data-Sources. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2005, pp:145-157 [Conf]
  85. Bert Van Nuffelen, Ofer Arieli, Alvaro Cortés-Calabuig, Maurice Bruynooghe
    An ID-Logic Formalization of the Composition of Autonomous Databases. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2005, pp:132-144 [Conf]
  86. Nikolay Pelov, Marc Denecker, Maurice Bruynooghe
    Partial Stable Models for Logic Programs with Aggregates. [Citation Graph (0, 0)][DBLP]
    LPNMR, 2004, pp:207-219 [Conf]
  87. Maurice Bruynooghe, Gerda Janssens
    Propagation: A New Operation in a Framework for Abstract Interpretation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    META, 1992, pp:294-307 [Conf]
  88. Joost Vennekens, Sofie Verbaeten, Maurice Bruynooghe
    Logic programs with annotated disjunctions. [Citation Graph (0, 0)][DBLP]
    NMR, 2004, pp:409-415 [Conf]
  89. Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe
    Repairing Inconsistent Databases: A Model-Theoretic Approach and Abductive Reasoning. [Citation Graph (0, 0)][DBLP]
    Paraconsistent Computational Logic, 2002, pp:51-65 [Conf]
  90. Maurice Bruynooghe, Veroniek Dumortier, Gerda Janssens
    Improving the Efficiency of Constraint Logic Programming Languages by Deriving Specialized Versions. [Citation Graph (0, 0)][DBLP]
    PDK, 1991, pp:309-317 [Conf]
  91. Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo
    Improving Abstract Interpretations by Combining Domains. [Citation Graph (0, 0)][DBLP]
    PEPM, 1993, pp:194-205 [Conf]
  92. Raymond Kosala, Jan Van den Bussche, Maurice Bruynooghe, Hendrik Blockeel
    Information Extraction in Structured Documents Using Tree Automata Induction. [Citation Graph (0, 0)][DBLP]
    PKDD, 2002, pp:299-310 [Conf]
  93. Veroniek Dumortier, Maurice Bruynooghe
    On the Automatic Generation of Events in Delta Prolog. [Citation Graph (0, 0)][DBLP]
    PLILP, 1990, pp:324-339 [Conf]
  94. Dmitri Boulanger, Maurice Bruynooghe, Marc Denecker
    Abstracting s-semantincs Using A Model-Theoretic Approach. [Citation Graph (0, 0)][DBLP]
    PLILP, 1994, pp:432-446 [Conf]
  95. Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker
    Detecting Unsolvable Queries for Definite Logic Programs. [Citation Graph (0, 0)][DBLP]
    PLILP/ALP, 1998, pp:118-133 [Conf]
  96. Gerda Janssens, Maurice Bruynooghe, Vincent Englebert
    Abstracting Numerical Values in CLP(H, N). [Citation Graph (0, 0)][DBLP]
    PLILP, 1994, pp:400-414 [Conf]
  97. Danny De Schreye, Maurice Bruynooghe
    An Application of Abstract Interpretation in Source Level Program Transformation. [Citation Graph (0, 0)][DBLP]
    PLILP, 1988, pp:35-57 [Conf]
  98. Nikolay Pelov, Maurice Bruynooghe
    Extending constraint logic programming with open functions. [Citation Graph (0, 0)][DBLP]
    PPDP, 2000, pp:235-244 [Conf]
  99. Tom Schrijvers, Maurice Bruynooghe
    Polymorphic algebraic data type reconstruction. [Citation Graph (0, 0)][DBLP]
    PPDP, 2006, pp:85-96 [Conf]
  100. Maurice Bruynooghe, Michael Codish
    Freeness, Sharing, Linearity and Correctness - All at Once. [Citation Graph (0, 0)][DBLP]
    WSA, 1993, pp:153-164 [Conf]
  101. Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof
    Reuse of Results in Termination Analysis of Typed Logic Programs. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:477-492 [Conf]
  102. Maurice Bruynooghe, Bart Demoen, Dmitri Boulanger, Marc Denecker, Anne Mulkers
    A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation. [Citation Graph (0, 0)][DBLP]
    SAS, 1996, pp:128-142 [Conf]
  103. Dmitri Boulanger, Maurice Bruynooghe
    A Systematic Construction of Abstract Domains [Citation Graph (0, 0)][DBLP]
    SAS, 1994, pp:61-77 [Conf]
  104. Maurice Bruynooghe, John P. Gallagher, Wouter Van Humbeeck
    Inference of Well-Typings for Logic Programs with Application to Termination Analysis. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:35-51 [Conf]
  105. Maurice Bruynooghe, Danny De Schreye, Bruno Krekels
    Compiling Control. [Citation Graph (0, 0)][DBLP]
    SLP, 1986, pp:70-77 [Conf]
  106. Maurice Bruynooghe, Danny De Schreye, Bern Martens
    A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs. [Citation Graph (0, 0)][DBLP]
    ISLP, 1991, pp:117-131 [Conf]
  107. Gerda Janssens, Maurice Bruynooghe, Veroniek Dumortier
    A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs. [Citation Graph (0, 0)][DBLP]
    ILPS, 1995, pp:336-350 [Conf]
  108. Edwin Pittomvils, Maurice Bruynooghe, Yves D. Willems
    Towards a Real-Time Garbage Collector for Prolog. [Citation Graph (0, 0)][DBLP]
    SLP, 1985, pp:185-198 [Conf]
  109. Remko Tronçon, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor
    Storage Size Reduction by In-place Mapping of Arrays. [Citation Graph (0, 0)][DBLP]
    VMCAI, 2002, pp:167-181 [Conf]
  110. Raf Venken, Maurice Bruynooghe, Luc Dekeyser, Bruno Krekels
    The Centralized Scheduler vs. the Distributed Specialists: Towards a Flexible Controller in Prolog for Expert Systems. [Citation Graph (0, 0)][DBLP]
    Wissensbasierte Systeme, 1985, pp:370-383 [Conf]
  111. Jan Ramon, Maurice Bruynooghe
    A polynomial time computable metric between point sets. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2001, v:37, n:10, pp:765-780 [Journal]
  112. Gunther Sablon, Luc De Raedt, Maurice Bruynooghe
    Iterative Versionspaces. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1994, v:69, n:1-2, pp:393-409 [Journal]
  113. Danny De Schreye, Maurice Bruynooghe, Kristof Verschaetse
    On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-Clauses. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1989, v:41, n:2, pp:237-248 [Journal]
  114. Maurice Bruynooghe
    Benelog. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2000, v:13, n:1, pp:7-8 [Journal]
  115. Danny De Schreye, Maurice Bruynooghe, Bart Demoen, Marc Denecker, Gerda Janssens, Bern Martens
    Project Report on LP+: A Second Generation Logic Programming Language. [Citation Graph (0, 0)][DBLP]
    AI Commun., 2000, v:13, n:1, pp:13-18 [Journal]
  116. Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe
    Computational methods for database repair by signed formulae. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2006, v:46, n:1-2, pp:4-37 [Journal]
  117. Maurice Bruynooghe
    Logic Programming for Describing and Solving Planning Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  118. Maurice Bruynooghe
    Enhancing a Search Algorithm to Perform Intelligent Backtracking [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  119. Nikolay Pelov, Emmanuel De Mot, Maurice Bruynooghe
    A Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  120. Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker
    Detecting Unsolvable Queries for Definite Logic Programs [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  121. Nikolay Pelov, Maurice Bruynooghe
    Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  122. Maurice Bruynooghe, Michael Leuschel, Konstantinos F. Sagonas
    A Polyvariant Binding-Time Analysis for Off-line Partial Deduction [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  123. Nancy Mazur, Peter Ross, Gerda Janssens, Maurice Bruynooghe
    Practical Aspects for a Working Compile Time Garbage Collection System for Mercury [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  124. Michael Leuschel, Maurice Bruynooghe
    Logic program specialisation through partial deduction: Control issues [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  125. Michael Leuschel, Jesper Jørgensen, Wim Vanhoof, Maurice Bruynooghe
    Offline Specialisation in Prolog Using a Hand-Written Compiler Generator [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  126. Raymond Kosala, Hendrik Blockeel, Maurice Bruynooghe, Jan Van den Bussche
    Information extraction from structured documents using k-testable tree automaton inference. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 2006, v:58, n:2, pp:129-158 [Journal]
  127. K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens
    Geometric Model Checking: An Automatic Verification Technique for Loop and Data Reuse Transformations. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:65, n:2, pp:- [Journal]
  128. Maurice Bruynooghe
    Solving Combinatorial Search Problems by Intelligent Backtracking. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:1, pp:36-39 [Journal]
  129. Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe
    Coherent Integration of Databases by Abductive Logic Programming. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2004, v:21, n:, pp:245-286 [Journal]
  130. Danny De Schreye, Bern Martens, Gunther Sablon, Maurice Bruynooghe
    Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1991, v:7, n:3, pp:337-358 [Journal]
  131. Luc De Raedt, Johan Feyaerts, Maurice Bruynooghe
    Acquiring object-knowledge. [Citation Graph (0, 0)][DBLP]
    J. Exp. Theor. Artif. Intell., 1992, v:4, n:3, pp:213-232 [Journal]
  132. Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker
    Detecting Unsolvable Queries for Definite Logic Programs [Citation Graph (0, 0)][DBLP]
    Journal of Functional and Logic Programming, 1999, v:1999, n:Special Issue 2, pp:- [Journal]
  133. Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe
    On the Design of a Correct Freeness Analysis for Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1996, v:28, n:3, pp:181-206 [Journal]
  134. Maurice Bruynooghe
    A Practical Framework for the Abstract Interpretation of Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1991, v:10, n:1/2/3&4, pp:91-124 [Journal]
  135. Maurice Bruynooghe, Saumya K. Debray, Manuel V. Hermenegildo, Michael J. Maher
    Guest Editors' Introduction: Special Section: Ten Years of Logic Programming. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1995, v:23, n:2, pp:87-88 [Journal]
  136. Maurice Bruynooghe, Saumya K. Debray, Manuel V. Hermenegildo, Michael J. Maher
    Guest Editor's Introduction. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1994, v:19, n:, pp:1-3 [Journal]
  137. Maurice Bruynooghe, Danny De Schreye, Bruno Krekels
    Compiling Control. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1989, v:6, n:1&2, pp:135-162 [Journal]
  138. Michael Codish, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo
    Exploiting Goal Independence in the Analysis of Logic Programs. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1997, v:32, n:3, pp:247-261 [Journal]
  139. G. Janssen, Maurice Bruynooghe
    Deriving Descriptions of Possible Values of Program Variables by Means of Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1992, v:13, n:2&3, pp:205-258 [Journal]
  140. Dmitri Boulanger, Maurice Bruynooghe
    Deriving Fold/Unfold Transformations of Logic Programs Using Extended OLDT-Based Abstract Interpretation. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1993, v:15, n:5/6, pp:495-521 [Journal]
  141. Danny De Schreye, Maurice Bruynooghe
    On the Transformation of Logic Programs with Instantiation Based Computation Rules. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1989, v:7, n:2, pp:125-154 [Journal]
  142. K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens
    An Automatic Verification Technique for Loop and Data Reuse Transformations based on Geometric Modeling of Programs. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2003, v:9, n:3, pp:248-269 [Journal]
  143. Lode Missiaen, Maurice Bruynooghe, Marc Denecker
    CHICA, an Abductive Planning System Based on Event Calculus. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 1995, v:5, n:5, pp:579-602 [Journal]
  144. Hilde Adé, Luc De Raedt, Maurice Bruynooghe
    Declarative Bias for Specific-to-General ILP Systems. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1995, v:20, n:1-2, pp:119-154 [Journal]
  145. Luc De Raedt, Maurice Bruynooghe
    Interactive Concept-Learning and Constructive Induction by Analogy. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 1992, v:8, n:, pp:107-150 [Journal]
  146. Jan Struyf, Jan Ramon, Maurice Bruynooghe, Sofie Verbaeten, Hendrik Blockeel
    Compact Representation of Knowledge Bases in Inductive Logic Programming. [Citation Graph (0, 0)][DBLP]
    Machine Learning, 2004, v:57, n:3, pp:305-333 [Journal]
  147. John P. Gallagher, Maurice Bruynooghe
    The Derivation of an Algorithm for Program Specialisation. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1991, v:9, n:3/4, pp:305-334 [Journal]
  148. Maurice Bruynooghe, Danny De Schreye, Bern Martens
    A General Criterion for Avoiding Infinite Unfolding during Partial Deduction. [Citation Graph (0, 0)][DBLP]
    New Generation Comput., 1992, v:11, n:1, pp:47-79 [Journal]
  149. Wim Vanhoof, Maurice Bruynooghe
    Towards Modular Binding-Time Analysis for First-order Mercury. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:30, n:2, pp:- [Journal]
  150. Marc Denecker, Maurice Bruynooghe, V. Wiktor Marek
    Logic programming revisited: Logic programs as inductive definitions. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2001, v:2, n:4, pp:623-654 [Journal]
  151. Maria J. García de la Banda, Manuel V. Hermenegildo, Maurice Bruynooghe, Veroniek Dumortier, Gerda Janssens, Wim Simoens
    Global Analysis of Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1996, v:18, n:5, pp:564-614 [Journal]
  152. Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo
    Improving Abstract Interpretations by Combining Domains. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1995, v:17, n:1, pp:28-44 [Journal]
  153. Anne Mulkers, William H. Winsborough, Maurice Bruynooghe
    Live-Structure Dataflow Analysis for Prolog. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1994, v:16, n:2, pp:205-258 [Journal]
  154. Michael Leuschel, Maurice Bruynooghe
    Logic program specialisation through partial deduction: Control issues. [Citation Graph (0, 0)][DBLP]
    TPLP, 2002, v:2, n:4-5, pp:461-515 [Journal]
  155. Michael Leuschel, Jesper Jørgensen, Wim Vanhoof, Maurice Bruynooghe
    Offline specialisation in Prolog using a hand-written compiler generator. [Citation Graph (0, 0)][DBLP]
    TPLP, 2004, v:4, n:1-2, pp:139-191 [Journal]
  156. Maurice Bruynooghe
    Enhancing a search algorithm to perform intelligent backtracking. [Citation Graph (0, 0)][DBLP]
    TPLP, 2004, v:4, n:3, pp:371-380 [Journal]
  157. Maurice Bruynooghe, Kung-Kiu Lau
    Special Issue on Program Development, Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    TPLP, 2002, v:2, n:4-5, pp:423-424 [Journal]
  158. Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe
    Approximate Query Answering in Locally Closed Databases. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:397-402 [Conf]
  159. Daan Fierens, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel
    Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-Search. [Citation Graph (0, 0)][DBLP]
    ECML, 2007, pp:567-574 [Conf]
  160. Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe
    Generalized Ordering-Search for Learning Directed Probabilistic Logical Models. [Citation Graph (0, 0)][DBLP]
    ILP, 2006, pp:40-42 [Conf]
  161. Jan Ramon, Daan Fierens, Fabián Güiza, Geert Meyfroidt, Hendrik Blockeel, Maurice Bruynooghe, Greet Vanden Berghe
    Mining data from intensive care patients. [Citation Graph (0, 0)][DBLP]
    Advanced Engineering Informatics, 2007, v:21, n:3, pp:243-256 [Journal]
  162. Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe
    Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:48, n:1, pp:37-66 [Journal]
  163. Ofer Arieli, Marc Denecker, Maurice Bruynooghe
    Distance semantics for database repair. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 2007, v:50, n:3-4, pp:389-415 [Journal]
  164. K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens
    Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  165. Peter Vanbroekhoven, Gerda Janssens, Maurice Bruynooghe, Francky Catthoor
    A practical dynamic single assignment transformation. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Design Autom. Electr. Syst., 2007, v:12, n:4, pp:- [Journal]
  166. Maurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, Wim Vanhoof
    Termination analysis of logic programs through combination of type-based norms. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2007, v:29, n:2, pp:- [Journal]

  167. Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences. [Citation Graph (, )][DBLP]


  168. An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules. [Citation Graph (, )][DBLP]


  169. Sub Node Extraction with Tree Based Wrappers. [Citation Graph (, )][DBLP]


  170. ProbLog Technology for Inference in a Probabilistic First Order Logic. [Citation Graph (, )][DBLP]


  171. Learning Relational Options for Inductive Transfer in Relational Reinforcement Learning. [Citation Graph (, )][DBLP]


  172. Learning Directed Probabilistic Logical Models Using Ordering-Search. [Citation Graph (, )][DBLP]


  173. An Approximative Inference Method for Solving THERE EXISTS FOR ALL SO Satisfiability Problems. [Citation Graph (, )][DBLP]


  174. Embracing Events in Causal Modelling: Interventions and Counterfactuals in CP-Logic. [Citation Graph (, )][DBLP]


  175. Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases. [Citation Graph (, )][DBLP]


  176. From Monomorphic to Polymorphic Well-Typings and Beyond. [Citation Graph (, )][DBLP]


  177. A Transformational Approach for Proving Properties of the CHR Constraint Store. [Citation Graph (, )][DBLP]


  178. SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions. [Citation Graph (, )][DBLP]


  179. A Polynomial-time Metric for Outerplanar Graphs. [Citation Graph (, )][DBLP]


  180. Algorithms for Weighted Counting over Parametric Polytopes: A Survey and a Practical Comparison. [Citation Graph (, )][DBLP]


  181. Dynamic Data Analysis and Data Mining for Prediction of Clinical Stability. [Citation Graph (, )][DBLP]


  182. Learning directed probabilistic logical models: ordering-search versus structure-search. [Citation Graph (, )][DBLP]


  183. Well-founded and Stable Semantics of Logic Programs with Aggregates [Citation Graph (, )][DBLP]


  184. CP-logic: A Language of Causal Probabilistic Events and Its Relation to Logic Programming [Citation Graph (, )][DBLP]


  185. Constraint Propagation for Extended First-Order Logic [Citation Graph (, )][DBLP]


Search in 1.117secs, Finished in 1.127secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002