default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaurice Bruynooghe
Person information
- affiliation: Catholic University of Leuven, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j69]Linde Vanbesien
, Maurice Bruynooghe, Marc Denecker:
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory. Theory Pract. Log. Program. 22(4): 523-537 (2022)- 2016
- [j68]Maurice Bruynooghe, Marc Denecker, Miroslaw Truszczynski:
First Order Logic with Inductive Definitions for Model-Based Problem Solving. AI Mag. 37(3): 69-80 (2016) - [j67]Mostafa Haghir Chehreghani, Maurice Bruynooghe:
Mining rooted ordered trees under subtree homeomorphism. Data Min. Knowl. Discov. 30(5): 1249-1272 (2016) - [j66]Bart Bogaerts, Joachim Jansen, Broes De Cat, Gerda Janssens, Maurice Bruynooghe, Marc Denecker:
Bootstrapping Inference in the IDP Knowledge Base System. New Gener. Comput. 34(3): 193-220 (2016) - [j65]Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe, Marc Denecker:
On local domain symmetry for model expansion. Theory Pract. Log. Program. 16(5-6): 636-652 (2016) - 2015
- [j64]Broes De Cat, Marc Denecker, Maurice Bruynooghe, Peter J. Stuckey:
Lazy Model Expansion: Interleaving Grounding with Search. J. Artif. Intell. Res. 52: 235-286 (2015) - [j63]Maurice Bruynooghe, Hendrik Blockeel, Bart Bogaerts, Broes De Cat, Stef De Pooter, Joachim Jansen, Anthony Labarre, Jan Ramon, Marc Denecker, Sicco Verwer:
Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3. Theory Pract. Log. Program. 15(6): 783-817 (2015) - 2014
- [j62]Bart Bogaerts, Joachim Jansen, Maurice Bruynooghe, Broes De Cat, Joost Vennekens, Marc Denecker:
Simulating Dynamic Systems Using Linear Time Calculus Theories. Theory Pract. Log. Program. 14(4-5): 477-492 (2014) - 2013
- [j61]Leander Schietgat, Jan Ramon, Maurice Bruynooghe:
A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics. Ann. Math. Artif. Intell. 69(4): 343-376 (2013) - [j60]Johan Wittocx, Marc Denecker, Maurice Bruynooghe:
Constraint Propagation for First-Order Logic and Inductive Definitions. ACM Trans. Comput. Log. 14(3): 17:1-17:45 (2013) - [j59]Broes De Cat, Maurice Bruynooghe:
Detection and exploitation of functional dependencies for model generation. Theory Pract. Log. Program. 13(4-5): 471-485 (2013) - 2012
- [j58]Hanne Vlaeminck, Joost Vennekens, Marc Denecker, Maurice Bruynooghe:
An approximative inference method for solving ∃∀SO satisfiability problems. J. Artif. Intell. Res. 45: 79-124 (2012) - [j57]Sven Verdoolaege, Gerda Janssens, Maurice Bruynooghe:
Equivalence checking of static affine programs using widening to handle recurrences. ACM Trans. Program. Lang. Syst. 34(3): 11:1-11:35 (2012) - 2011
- [j56]Geert Meyfroidt, Fabian Güiza Grandas, Dominiek Cottem, Wilfried De Becker, Kristien Van Loon, Jean-Marie Aerts, Daniel Berckmans, Jan Ramon, Maurice Bruynooghe, Greta Van den Berghe:
Computerized prediction of intensive care unit discharge after cardiac surgery: development and validation of a Gaussian processes model. BMC Medical Informatics Decis. Mak. 11: 64 (2011) - [j55]Bernd Gutmann, Ingo Thon, Angelika Kimmig, Maurice Bruynooghe, Luc De Raedt:
The magic of logical inference in probabilistic programming. Theory Pract. Log. Program. 11(4-5): 663-680 (2011) - 2010
- [j54]Joost Vennekens, Marc Denecker, Maurice Bruynooghe:
FO(ID) as an extension of DL with rules. Ann. Math. Artif. Intell. 58(1-2): 85-115 (2010) - [j53]Sven Verdoolaege, Martin Palkovic, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor:
Experience with Widening Based Equivalence Checking in Realistic Multimedia Systems. J. Electron. Test. 26(2): 279-292 (2010) - [j52]Kristien Van Loon, Fabian Güiza Grandas, Geert Meyfroidt, Jean-Marie Aerts, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe, Greta Van den Berghe, Daniel Berckmans:
Prediction of Clinical Conditions after Coronary Bypass Surgery using Dynamic Data Analysis. J. Medical Syst. 34(3): 229-239 (2010) - [j51]Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe:
A comparison of pruning criteria for probability trees. Mach. Learn. 78(1-2): 251-285 (2010) - [j50]Marc Denecker, Alvaro Cortés-Calabuig, Maurice Bruynooghe, Ofer Arieli:
Towards a logical reconstruction of a theory for locally closed databases. ACM Trans. Database Syst. 35(3): 22:1-22:60 (2010) - 2009
- [j49]Joost Vennekens, Marc Denecker, Maurice Bruynooghe:
CP-logic: A language of causal probabilistic events and its relation to logic programming. Theory Pract. Log. Program. 9(3): 245-308 (2009) - 2008
- [j48]Daan Fierens, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel:
Learning directed probabilistic logical models: ordering-search versus structure-search. Ann. Math. Artif. Intell. 54(1-3): 99-133 (2008) - [j47]Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe:
Generalized ordering-search for learning directed probabilistic logical models. Mach. Learn. 70(2-3): 169-188 (2008) - [j46]Stefan Raeymaekers, Maurice Bruynooghe, Jan Van den Bussche:
Learning ( k , l )-contextual tree languages for information extraction from web pages. Mach. Learn. 71(2-3): 155-183 (2008) - 2007
- [j45]Jan Ramon, Daan Fierens, Fabian Güiza Grandas, Geert Meyfroidt, Hendrik Blockeel, Maurice Bruynooghe, Greta Van den Berghe:
Mining data from intensive care patients. Adv. Eng. Informatics 21(3): 243-256 (2007) - [j44]Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe:
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions. Algorithmica 48(1): 37-66 (2007) - [j43]Ofer Arieli, Marc Denecker, Maurice Bruynooghe:
Distance semantics for database repair. Ann. Math. Artif. Intell. 50(3-4): 389-415 (2007) - [j42]Peter Vanbroekhoven, Gerda Janssens, Maurice Bruynooghe, Francky Catthoor:
A practical dynamic single assignment transformation. ACM Trans. Design Autom. Electr. Syst. 12(4): 40 (2007) - [j41]Maurice Bruynooghe, Michael Codish, John P. Gallagher, Samir Genaim, Wim Vanhoof:
Termination analysis of logic programs through combination of type-based norms. ACM Trans. Program. Lang. Syst. 29(2): 10 (2007) - [j40]Nikolay Pelov, Marc Denecker, Maurice Bruynooghe:
Well-founded and stable semantics of logic programs with aggregates. Theory Pract. Log. Program. 7(3): 301-353 (2007) - 2006
- [j39]Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe:
Computational methods for database repair by signed formulae. Ann. Math. Artif. Intell. 46(1-2): 4-37 (2006) - [j38]Raymond Kosala, Hendrik Blockeel, Maurice Bruynooghe, Jan Van den Bussche:
Information extraction from structured documents using k-testable tree automaton inference. Data Knowl. Eng. 58(2): 129-158 (2006) - 2004
- [j37]Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe:
Coherent Integration of Databases by Abductive Logic Programming. J. Artif. Intell. Res. 21: 245-286 (2004) - [j36]Jan Struyf, Jan Ramon, Maurice Bruynooghe, Sofie Verbaeten, Hendrik Blockeel:
Compact Representation of Knowledge Bases in Inductive Logic Programming. Mach. Learn. 57(3): 305-333 (2004) - [j35]Michael Leuschel, Jesper Jørgensen, Wim Vanhoof, Maurice Bruynooghe:
Offline specialisation in Prolog using a hand-written compiler generator. Theory Pract. Log. Program. 4(1-2): 139-191 (2004) - [j34]Maurice Bruynooghe:
Enhancing a search algorithm to perform intelligent backtracking. Theory Pract. Log. Program. 4(3): 371-380 (2004) - 2003
- [j33]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. J. Univers. Comput. Sci. 9(3): 248-269 (2003) - 2002
- [j32]Maurice Bruynooghe, Kung-Kiu Lau:
Special Issue on Program Development, Guest Editors' Introduction. Theory Pract. Log. Program. 2(4-5): 423-424 (2002) - [j31]Michael Leuschel, Maurice Bruynooghe:
Logic program specialisation through partial deduction: Control issues. Theory Pract. Log. Program. 2(4-5): 461-515 (2002) - 2001
- [j30]Jan Ramon, Maurice Bruynooghe:
A polynomial time computable metric between point sets. Acta Informatica 37(10): 765-780 (2001) - [j29]Marc Denecker, Maurice Bruynooghe, V. Wiktor Marek:
Logic programming revisited: Logic programs as inductive definitions. ACM Trans. Comput. Log. 2(4): 623-654 (2001) - 2000
- [j28]Maurice Bruynooghe:
Benelog. AI Commun. 13(1): 7-8 (2000) - [j27]Danny De Schreye, Maurice Bruynooghe, Bart Demoen, Marc Denecker, Gerda Janssens, Bern Martens:
Project Report on LP+: A Second Generation Logic Programming Language. AI Commun. 13(1): 13-18 (2000) - 1999
- [j26]Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker:
Detecting Unsolvable Queries for Definite Logic Programs. J. Funct. Log. Program. 1999(Special Issue 2) (1999) - 1997
- [j25]Michael Codish, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo:
Exploiting Goal Independence in the Analysis of Logic Programs. J. Log. Program. 32(3): 247-261 (1997) - 1996
- [j24]Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe:
On the Design of a Correct Freeness Analysis for Logic Programs. J. Log. Program. 28(3): 181-206 (1996) - [j23]Maria J. García de la Banda, Manuel V. Hermenegildo, Maurice Bruynooghe, Veroniek Dumortier, Gerda Janssens, Wim Simoens:
Global Analysis of Constraint Logic Programs. ACM Trans. Program. Lang. Syst. 18(5): 564-614 (1996) - 1995
- [j22]Maurice Bruynooghe, Saumya K. Debray, Manuel V. Hermenegildo, Michael J. Maher:
Guest Editors' Introduction: Special Section: Ten Years of Logic Programming. J. Log. Program. 23(2): 87-88 (1995) - [j21]Lode Missiaen, Maurice Bruynooghe, Marc Denecker:
CHICA, an Abductive Planning System Based on Event Calculus. J. Log. Comput. 5(5): 579-602 (1995) - [j20]Hilde Adé, Luc De Raedt, Maurice Bruynooghe:
Declarative Bias for Specific-to-General ILP Systems. Mach. Learn. 20(1-2): 119-154 (1995) - [j19]Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo:
Improving Abstract Interpretations by Combining Domains. ACM Trans. Program. Lang. Syst. 17(1): 28-44 (1995) - 1994
- [j18]Gunther Sablon, Luc De Raedt, Maurice Bruynooghe:
Iterative Versionspaces. Artif. Intell. 69(1-2): 393-409 (1994) - [j17]Maurice Bruynooghe, Saumya K. Debray, Manuel V. Hermenegildo, Michael J. Maher:
Guest Editor's Introduction. J. Log. Program. 19/20: 1-3 (1994) - [j16]Anne Mulkers, William H. Winsborough, Maurice Bruynooghe:
Live-Structure Dataflow Analysis for Prolog. ACM Trans. Program. Lang. Syst. 16(2): 205-258 (1994) - 1993
- [j15]Dmitri Boulanger, Maurice Bruynooghe:
Deriving Fold/Unfold Transformations of Logic Programs Using Extended OLDT-Based Abstract Interpretation. J. Symb. Comput. 15(5/6): 495-521 (1993) - 1992
- [j14]Luc De Raedt, Maurice Bruynooghe:
Belief Updating from Integrity Constraints and Queries. Artif. Intell. 53(2-3): 291-307 (1992) - [j13]Luc De Raedt, Johan Feyaerts, Maurice Bruynooghe:
Acquiring object-knowledge. J. Exp. Theor. Artif. Intell. 4(3): 213-232 (1992) - [j12]Gerda Janssens, Maurice Bruynooghe:
Deriving Descriptions of Possible Values of Program Variables by Means of Abstract Interpretation. J. Log. Program. 13(2&3): 205-258 (1992) - [j11]Luc De Raedt, Maurice Bruynooghe:
A unifying framework for concept-learning algorithms. Knowl. Eng. Rev. 7(3): 251-269 (1992) - [j10]Luc De Raedt, Maurice Bruynooghe:
Interactive Concept-Learning and Constructive Induction by Analogy. Mach. Learn. 8: 107-150 (1992) - [j9]Maurice Bruynooghe, Danny De Schreye, Bern Martens:
A General Criterion for Avoiding Infinite Unfolding during Partial Deduction. New Gener. Comput. 11(1): 47-79 (1992) - 1991
- [j8]Danny De Schreye, Bern Martens, Gunther Sablon, Maurice Bruynooghe:
Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs. J. Autom. Reason. 7(3): 337-358 (1991) - [j7]Maurice Bruynooghe:
A Practical Framework for the Abstract Interpretation of Logic Programs. J. Log. Program. 10(2): 91-124 (1991) - [j6]John P. Gallagher, Maurice Bruynooghe:
The Derivation of an Algorithm for Program Specialisation. New Gener. Comput. 9(3/4): 305-334 (1991) - 1990
- [j5]Luc De Raedt, Maurice Bruynooghe:
Indirect relevance and bias in inductive concept-learning. Knowl. Acquis. 2(4): 365-390 (1990) - 1989
- [j4]Danny De Schreye, Maurice Bruynooghe, Kristof Verschaetse:
On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-Clauses. Artif. Intell. 41(2): 237-248 (1989) - [j3]Maurice Bruynooghe, Danny De Schreye, Bruno Krekels:
Compiling Control. J. Log. Program. 6(1&2): 135-162 (1989) - [j2]Danny De Schreye, Maurice Bruynooghe:
On the Transformation of Logic Programs with Instantiation Based Computation Rules. J. Symb. Comput. 7(2): 125-154 (1989) - 1981
- [j1]Maurice Bruynooghe:
Solving Combinatorial Search Problems by Intelligent Backtracking. Inf. Process. Lett. 12(1): 36-39 (1981)
Conference and Workshop Papers
- 2024
- [c144]Pierre Carbonnelle, Gottfried Schenner, Maurice Bruynooghe, Bart Bogaerts, Marc Denecker:
Using Symmetries to Lift Satisfiability Checking. AAAI 2024: 7961-7968 - 2023
- [c143]Ruben Lapauw, Maurice Bruynooghe, Marc Denecker:
Justifications and a Reconstruction of Parity Game Solving Algorithms. Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems 2023: 170-187 - [c142]Djordje Markovic, Maurice Bruynooghe, Marc Denecker:
Towards Systematic Treatment of Partial Functions in Knowledge Representation. JELIA 2023: 756-770 - 2020
- [c141]Ruben Lapauw, Maurice Bruynooghe, Marc Denecker:
Improving Parity Game Solvers with Justifications. VMCAI 2020: 449-470 - 2017
- [c140]Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe:
Symmetric Explanation Learning: Effective Dynamic Symmetry Handling for SAT. SAT 2017: 83-100 - 2016
- [c139]Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe, Marc Denecker:
Improved Static Symmetry Breaking for SAT. SAT 2016: 104-122 - 2013
- [c138]Jelle Van Eyck, Jan Ramon, Fabian Güiza Grandas, Geert Meyfroidt, Maurice Bruynooghe, Greta Van den Berghe:
Guided Monte Carlo Tree Search for Planning in Learned Environments. ACML 2013: 33-47 - 2012
- [c137]Marc Denecker, Maurice Bruynooghe, Joost Vennekens:
Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs. Correct Reasoning 2012: 178-194 - [c136]Hendrik Blockeel, Bart Bogaerts, Maurice Bruynooghe, Broes De Cat, Stef De Pooter, Marc Denecker, Anthony Labarre, Jan Ramon, Sicco Verwer:
Modeling Machine Learning and Data Mining Problems with FO(·). ICLP (Technical Communications) 2012: 14-25 - [c135]Hanne Vlaeminck, Joost Vennekens, Maurice Bruynooghe, Marc Denecker:
Ordered Epistemic Logic: Semantics, Complexity and Applications. KR 2012 - 2011
- [c134]Marc Denecker, Joost Vennekens, Hanne Vlaeminck, Johan Wittocx, Maurice Bruynooghe:
Answer Set Programming's Contributions to Classical Logic - An Analysis of ASP Methodology. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 12-32 - 2010
- [c133]Maurice Bruynooghe, Theofrastos Mantadelis, Angelika Kimmig, Bernd Gutmann, Joost Vennekens, Gerda Janssens, Luc De Raedt:
ProbLog Technology for Inference in a Probabilistic First Order Logic. ECAI 2010: 719-724 - [c132]Joost Vennekens, Maurice Bruynooghe, Marc Denecker:
Embracing Events in Causal Modelling: Interventions and Counterfactuals in CP-Logic. JELIA 2010: 313-325 - [c131]Hanne Vlaeminck, Johan Wittocx, Joost Vennekens, Marc Denecker, Maurice Bruynooghe:
An Approximative Inference Method for Solving THERE EXISTS FOR ALL SO Satisfiability Problems. JELIA 2010: 326-338 - 2009
- [c130]Sven Verdoolaege, Gerda Janssens, Maurice Bruynooghe:
Equivalence Checking of Static Affine Programs Using Widening to Handle Recurrences. CAV 2009: 599-613 - [c129]Sven Verdoolaege, Martin Palkovic, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor:
Experience with widening based equivalence checking in realistic multimedia systems. HLDVT 2009: 122-129 - [c128]Paolo Pilozzi, Tom Schrijvers, Maurice Bruynooghe:
A Transformational Approach for Proving Properties of the CHR Constraint Store. LOPSTR 2009: 22-36 - [c127]Kristien Van Loon, Fabian Güiza Grandas, Geert Meyfroidt, Jean-Marie Aerts, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe, Greta Van den Berghe, Daniel Berckmans:
Dynamic Data Analysis and Data Mining for Prediction of Clinical Stability. MIE 2009: 590-594 - 2008
- [c126]Leander Schietgat, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel:
An Efficiently Computable Graph-Based Metric for the Classification of Small Molecules. Discovery Science 2008: 197-209 - [c125]Stefan Raeymaekers, Maurice Bruynooghe:
Sub Node Extraction with Tree Based Wrappers. ECAI 2008: 137-141 - [c124]Sven Verdoolaege, Maurice Bruynooghe:
Algorithms for Weighted Counting over Parametric Polytopes: A Survey and a Practical Comparison. ITSL 2008: 60-66 - [c123]Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe:
Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases. KR 2008: 81-91 - [c122]Tom Schrijvers, Maurice Bruynooghe, John P. Gallagher:
From Monomorphic to Polymorphic Well-Typings and Beyond. LOPSTR 2008: 152-167 - [c121]Maarten Mariën, Johan Wittocx, Marc Denecker, Maurice Bruynooghe:
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions. SAT 2008: 211-224 - 2007
- [c120]Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe:
Approximate Query Answering in Locally Closed Databases. AAAI 2007: 397-402 - [c119]Daan Fierens, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel:
Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-Search. ECML 2007: 567-574 - [c118]Tom Croonenborghs, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe:
Online Learning and Exploiting Relational Models in Reinforcement Learning. IJCAI 2007: 726-731 - [c117]Daan Fierens, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel:
Learning Directed Probabilistic Logical Models Using Ordering-Search. ILP 2007: 24 - [c116]Tom Croonenborghs, Kurt Driessens, Maurice Bruynooghe:
Learning Relational Options for Inductive Transfer in Relational Reinforcement Learning. ILP 2007: 88-97 - [c115]Leander Schietgat, Jan Ramon, Maurice Bruynooghe:
A Polynomial-time Metric for Outerplanar Graphs. MLG 2007 - 2006
- [c114]Johan Wittocx, Joost Vennekens, Maarten Mariën, Marc Denecker, Maurice Bruynooghe:
Predicate Introduction Under Stable and Well-Founded Semantics. ICLP 2006: 242-256 - [c113]Jan Ramon, Tom Croonenborghs, Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe:
Generalized Ordering-Search for Learning Directed Probabilistic Logical Models. ILP 2006: 40-42 - [c112]Ofer Arieli, Marc Denecker, Maurice Bruynooghe:
Distance-Based Repairs of Databases. JELIA 2006: 43-55 - [c111]Joost Vennekens, Marc Denecker, Maurice Bruynooghe:
Representing Causal Information About a Probabilistic Process. JELIA 2006: 452-464 - [c110]Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe:
Representation of Partial Knowledge and Query Answering in Locally Complete Databases. LPAR 2006: 407-421 - [c109]Tom Schrijvers, Maurice Bruynooghe:
Polymorphic algebraic data type reconstruction. PPDP 2006: 85-96 - 2005
- [c108]Peter Vanbroekhoven, Gerda Janssens, Maurice Bruynooghe, Francky Catthoor:
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis. APLAS 2005: 330-346 - [c107]Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Bert Van Nuffelen, Maurice Bruynooghe:
On the Local Closed-World Assumption of Data-Sources. BNAIC 2005: 333-334 - [c106]Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe, Jan Ramon:
Logical Bayesian Networks and Their Relation to Other Probabilistic Logical Models. BNAIC 2005: 343-344 - [c105]Sven Verdoolaege, Kristof Beyls, Maurice Bruynooghe, Francky Catthoor:
Experiences with Enumeration of Integer Projections of Parametric Polytopes. CC 2005: 91-105 - [c104]K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens:
Verification of Source Code Transformations by Program Equivalence Checking. CC 2005: 221-236 - [c103]K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens:
Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code. DATE 2005: 1310-1315 - [c102]Stefan Raeymaekers, Maurice Bruynooghe, Jan Van den Bussche:
Learning (k, l)-Contextual Tree Languages for Information Extraction. ECML 2005: 305-316 - [c101]Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe:
A Comparison of Approaches for Learning Probability Trees. ECML 2005: 556-563 - [c100]Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe, Jan Ramon:
Logical Bayesian Networks and Their Relation to Other Probabilistic Logical Models. ILP 2005: 121-135 - [c99]Tom Croonenborghs, Karl Tuyls, Jan Ramon, Maurice Bruynooghe:
Multi-agent Relational Reinforcement Learning. LAMAS 2005: 192-206 - [c98]Maarten Mariën, Rudradeb Mitra, Marc Denecker, Maurice Bruynooghe:
Satisfiability Checking for PC(ID). LPAR 2005: 565-579 - [c97]Bert Van Nuffelen, Ofer Arieli, Alvaro Cortés-Calabuig, Maurice Bruynooghe:
An ID-Logic Formalization of the Composition of Autonomous Databases. LPNMR 2005: 132-144 - [c96]Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Bert Van Nuffelen, Maurice Bruynooghe:
On the Local Closed-World Assumption of Data-Sources. LPNMR 2005: 145-157 - [c95]Maurice Bruynooghe, John P. Gallagher, Wouter Van Humbeeck:
Inference of Well-Typings for Logic Programs with Application to Termination Analysis. SAS 2005: 35-51 - 2004
- [c94]Bert Van Nuffelen, Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe:
Data Integration Using ID-Logic. CAiSE 2004: 67-81 - [c93]Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vincent Loechner, Maurice Bruynooghe:
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations. CASES 2004: 248-258 - [c92]Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe:
Database Repair by Signed Formulae. FoIKS 2004: 14-30 - [c91]Joost Vennekens, Sofie Verbaeten, Maurice Bruynooghe:
Logic Programs with Annotated Disjunctions. ICLP 2004: 431-445 - [c90]Nikolay Pelov, Marc Denecker, Maurice Bruynooghe:
Partial Stable Models for Logic Programs with Aggregates. LPNMR 2004: 207-219 - [c89]Joost Vennekens, Sofie Verbaeten, Maurice Bruynooghe:
Logic programs with annotated disjunctions. NMR 2004: 409-415 - 2003
- [c88]Sven Verdoolaege, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor:
Multi-dimentsional Incremetal Loops Fusion for Data Locality. ASAP 2003: 17-27 - [c87]Nikolay Pelov, Marc Denecker, Maurice Bruynooghe:
Translation of Aggregate Programs to Normal Logic Programs. Answer Set Programming 2003 - [c86]K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens:
Automatic functional verification of memory oriented global source code transformations. HLDVT 2003: 31-36 - [c85]Raymond Kosala, Maurice Bruynooghe, Jan Van den Bussche, Hendrik Blockeel:
Information Extraction from Web Documents Based on Local Unranked Tree Automaton Inference. IJCAI 2003: 403-408 - 2002
- [c84]Maurice Bruynooghe, Luís Moniz Pereira, Jörg H. Siekmann, Maarten H. van Emden:
A Portrait of a Scientist as a Computational Logician. Computational Logic: Logic Programming and Beyond 2002: 1-4 - [c83]Pieter Bekaert, Bert Van Nuffelen, Maurice Bruynooghe, David Gilis, Marc Denecker:
On the Transformation of Object-Oriented Conceptual Models to Logical Theories. ER 2002: 152-166 - [c82]Wim Vanhoof, Remko Tronçon, Maurice Bruynooghe:
A Fixed Point Semantics for Logic Programs Extended with Cuts. LOPSTR 2002: 238-257 - [c81]Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe:
Repairing Inconsistent Databases: A Model-Theoretic Approach and Abductive Reasoning. Paraconsistent Computational Logic 2002: 51-65 - [c80]Raymond Kosala, Jan Van den Bussche, Maurice Bruynooghe, Hendrik Blockeel:
Information Extraction in Structured Documents Using Tree Automata Induction. PKDD 2002: 299-310 - [c79]Maurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof:
Reuse of Results in Termination Analysis of Typed Logic Programs. SAS 2002: 477-492 - [c78]Remko Tronçon, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor:
Storage Size Reduction by In-place Mapping of Arrays. VMCAI 2002: 167-181 - [c77]K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens:
Geometric Model Checking: An Automatic Verification Technique for Loop and Data Reuse Transformations. COCV@ETAPS 2002: 67-82 - 2001
- [c76]Maurice Bruynooghe, Wim Vanhoof, Michael Codish:
Pos(T): Analyzing Dependencies in Typed Logic Programs. Ershov Memorial Conference 2001: 406-420 - [c75]Nancy Mazur, Peter Ross, Gerda Janssens, Maurice Bruynooghe:
Practical Aspects for a Working Compile Time Garbage Collection System for Mercury. ICLP 2001: 105-119 - [c74]Marc Denecker, Nikolay Pelov, Maurice Bruynooghe:
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates. ICLP 2001: 212-226 - [c73]Wim Vanhoof, Maurice Bruynooghe:
When Size Does Matter. LOPSTR 2001: 129-147 - [c72]Ofer Arieli, Bert Van Nuffelen, Marc Denecker, Maurice Bruynooghe:
Coherent Composition of Distributed Knowledge-Bases Through Abduction. LPAR 2001: 624-638 - [c71]Wim Vanhoof, Maurice Bruynooghe:
Binding-Time Annotations Without Binding-Time Analysis. LPAR 2001: 707-722 - 2000
- [c70]Nancy Mazur, Gerda Janssens, Maurice Bruynooghe:
A Module Based Analysis for Memory Reuse in Mercury. Computational Logic 2000: 1255-1269 - [c69]Wim Vanhoof, Maurice Bruynooghe:
Towards a modular binding-time analysis for higher-order Mercury. LOPSTR 2000 - [c68]Nikolay Pelov, Maurice Bruynooghe:
Extending constraint logic programming with open functions. PPDP 2000: 235-244 - 1999
- [c67]Wim Vanhoof, Maurice Bruynooghe:
Binding-time Analysis for Mercury. ICLP 1999: 500-514 - [c66]Nikolay Pelov, Maurice Bruynooghe:
Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog. LPAR 1999: 358-375 - [c65]Wim Vanhoof, Maurice Bruynooghe:
Towards Modular Binding-Time Analysis for First-order Mercury. WOID@ICLP 1999: 189-198 - 1998
- [c64]Maurice Bruynooghe, Michael Leuschel, Konstantinos Sagonas:
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction. ESOP 1998: 27-41 - [c63]Jan Ramon, Maurice Bruynooghe:
A Framework for Defining Distances Between First-Order Logic Objects. ILP 1998: 271-280 - [c62]Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker:
Detecting Unsolvable Queries for Definite Logic Programs. PLILP/ALP 1998: 118-133 - 1997
- [c61]Maurice Bruynooghe, Gerda Janssens, Andreas Kågedal:
Live-Structure Analysis for Logic Programming Languages with Declarations. ICLP 1997: 33-47 - 1996
- [c60]Maurice Bruynooghe, Bart Demoen, Dmitri Boulanger, Marc Denecker, Anne Mulkers:
A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation. SAS 1996: 128-142 - 1995
- [c59]Anne Mulkers, Wim Simoens, Gerda Janssens, Maurice Bruynooghe:
On the Practicality of Abstract Equation Systems. ICLP 1995: 781-795 - [c58]Gerda Janssens, Maurice Bruynooghe, Veroniek Dumortier:
A Blueprint for an Abstract Machine for Abstract Interpretation of (Constraint) Logic Programs. ILPS 1995: 336-350 - 1994
- [c57]Dmitri Boulanger, Maurice Bruynooghe:
Abstract Domains: a Model-Theoretic approach. ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages 1994 - [c56]Maurice Bruynooghe, Michael Codish, Anne Mulkers:
Abstract Unification for a Composite Domain Deriving Sharing and Freeness Properties of Program Variables. ICLP Workshop: Verification and Analysis of (Concurrent) Logic Languages 1994 - [c55]Dmitri Boulanger, Maurice Bruynooghe:
Using Call/Exit Analysis for Logic Program Transformation. LOPSTR 1994: 36-50 - [c54]Michael Codish, Maria J. García de la Banda, Maurice Bruynooghe, Manuel V. Hermenegildo:
Goal Dependent versus Goal Independent Analysis of Logic Programs. LPAR 1994: 305-319 - [c53]Gerda Janssens, Maurice Bruynooghe, Vincent Englebert:
Abstracting Numerical Values in CLP(H, N). PLILP 1994: 400-414 - [c52]Dmitri Boulanger, Maurice Bruynooghe, Marc Denecker:
Abstracting s-semantincs Using A Model-Theoretic Approach. PLILP 1994: 432-446 - [c51]Dmitri Boulanger, Maurice Bruynooghe:
A Systematic Construction of Abstract Domains. SAS 1994: 61-77 - 1993
- [c50]Veroniek Dumortier, Gerda Janssens, Maurice Bruynooghe, Michael Codish:
Freeness Analysis in the Presence of Numerical Constraints. ICLP 1993: 100-115 - [c49]Michael Codish, Dennis Dams, Gilberto Filé, Maurice Bruynooghe:
Freeness Analysis for Logic Programs - And Correctness? ICLP 1993: 116-131 - [c48]Luc De Raedt, Maurice Bruynooghe:
A Theory of Clausal Discovery. IJCAI 1993: 1058-1063 - [c47]Dmitri Boulanger, Maurice Bruynooghe:
Using Abstract Interpretation for Goal Replacement. LOPSTR 1993: 210-228 - [c46]Dmitri Boulanger, Maurice Bruynooghe, Danny De Schreye:
Compiling Control Revisited: A New approach Based Upon Abstract Interpretation for Constraint Logic Programs. LPE 1993: 39-51 - [c45]Maurice Bruynooghe, Dmitri Boulanger:
Abstract Interpretation for (Constraint) Logic Programming. NATO ASI CP 1993: 228-260 - [c44]Michael Codish, Anne Mulkers, Maurice Bruynooghe, Maria J. García de la Banda, Manuel V. Hermenegildo:
Improving Abstract Interpretations by Combining Domains. PEPM 1993: 194-205 - [c43]Maurice Bruynooghe, Michael Codish:
Freeness, Sharing, Linearity and Correctness - All at Once. WSA 1993: 153-164 - 1992
- [c42]Marc Denecker, Lode Missiaen, Maurice Bruynooghe:
Temporal Reasoning with Abductive Event Calculus. ECAI 1992: 384-388 - [c41]Hilde Adé, Luc De Raedt, Maurice Bruynooghe:
Inverse Resolution in an Integrated Inductive-Deductive Learning System. ECAI 1992: 456-457 - [c40]Bern Martens, Danny De Schreye, Maurice Bruynooghe:
Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. FGCS 1992: 473-480 - [c39]Danny De Schreye, Kristof Verschaetse, Maurice Bruynooghe:
A Framework for Analyzing the Termination of Definite Logic Programs with respect to Call Patterns. FGCS 1992: 481-488 - [c38]Maurice Bruynooghe:
Abstract interpretation for constraint logic programming. JFPL 1992 - [c37]Dmitri Boulanger, Maurice Bruynooghe:
Deriving Transformations for Logic Programs Using Abstract Interpretation. LOPSTR 1992: 99-117 - [c36]Maurice Bruynooghe, Gerda Janssens:
Propagation: A New Operation in a Framework for Abstract Interpretation of Logic Programs. META 1992: 294-307 - 1991
- [c35]Maurice Bruynooghe:
Intelligent Backtracking Revisted. Computational Logic - Essays in Honor of Alan Robinson 1991: 166-177 - [c34]Luc De Raedt, Johan Feyaerts, Maurice Bruynooghe:
Acquiring Object-Knowledge for Learning Systems. EWSL 1991: 245-264 - [c33]Luc De Raedt, Maurice Bruynooghe, Bern Martens:
Integrity Constraints and Interactive Concept-Learning. ML 1991: 394-398 - [c32]Gerda Janssens, Maurice Bruynooghe:
On Abstracting the Procedural Behaviour of Logic Programs. RCLP 1991: 240-262 - [c31]Maurice Bruynooghe, Veroniek Dumortier, Gerda Janssens:
Improving the Efficiency of Constraint Logic Programming Languages by Deriving Specialized Versions. PDK 1991: 309-317 - [c30]Maurice Bruynooghe, Danny De Schreye, Bern Martens:
A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs. ISLP 1991: 117-131 - 1990
- [c29]Luc De Raedt, Maurice Bruynooghe:
On Negation and Three-Valued Logic in Interactive Concept-Learning. ECAI 1990: 207-212 - [c28]Danny De Schreye, Dirk Pollet, Johan Ronsyn, Maurice Bruynooghe:
Implementing Finite-domain Constraint Logic Programming on Top of a Prolog-System with Delay-mechanism. ESOP 1990: 106-117 - [c27]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. ICLP 1990: 649-663 - [c26]Kristof Verschaetse, Danny De Schreye, Maurice Bruynooghe:
Generation and Compilation of Efficient Computation Rules. ICLP 1990: 700-714 - [c25]John P. Gallagher, Maurice Bruynooghe:
The Derivation of an Algorithm for Program Specialisation. ICLP 1990: 732-746 - [c24]Anne Mulkers, William H. Winsborough, Maurice Bruynooghe:
Analysis of Shared Data Structures for Compile-Time Garbage. ICLP 1990: 747-762 - [c23]Veroniek Dumortier, Maurice Bruynooghe:
On the Automatic Generation of Events in Delta Prolog. PLILP 1990: 324-339 - 1989
- [c22]Maurice Bruynooghe, Danny De Schreye:
Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-based Learning. AII 1989: 60-77 - [c21]Gunther Sablon, Luc De Raedt, Maurice Bruynooghe:
Generalizing Multiple Examples in Explanation Based Learning. AII 1989: 177-183 - [c20]André Mariën, Gerda Janssens, Anne Mulkers, Maurice Bruynooghe:
The Impact of Abstract Interpretation: An Experiment in Code Generation. ICLP 1989: 33-47 - [c19]Luc De Raedt, Maurice Bruynooghe:
Constructive Induction by Analogy. ML 1989: 476-477 - [c18]Maurice Bruynooghe, Luc De Raedt, Danny De Schreye:
Explanation Based Program Transformation. IJCAI 1989: 407-412 - [c17]Luc De Raedt, Maurice Bruynooghe:
Towards Friendly Concept-Learners. IJCAI 1989: 849-858 - 1988
- [c16]Luc De Raedt, Maurice Bruynooghe:
On Interactive Concept-Learning and Assimilation. EWSL 1988: 167-176 - [c15]Bern Martens, Maurice Bruynooghe:
Integrity Constraint Checking in Deductive Databases Using a Rule/Goal Graph. Expert Database Conf. 1988: 567-601 - [c14]Patrick Weemeeuw, Maurice Bruynooghe, Marleen De Haondt:
On Implementing Logic Programming Languages on a Dataflow Architecture. ESOP 1988: 359-372 - [c13]Maurice Bruynooghe, Gerda Janssens:
An Instance of Abstract Interpretation Integrating Type and Mode Inferencing. ICLP/SLP 1988: 669-683 - [c12]Danny De Schreye, Maurice Bruynooghe:
The Compilation of Forward Checking Regimes through Meta-Interpretation and Transformation. META 1988: 217-231 - [c11]Danny De Schreye, Maurice Bruynooghe:
An Application of Abstract Interpretation in Source Level Program Transformation. PLILP 1988: 35-57 - 1987
- [c10]Maurice Bruynooghe, Gerda Janssens, Alain Callebaut, Bart Demoen:
Abstract Interpretation: Towards the Global Optimization of Prolog Programs. SLP 1987: 192-204 - 1986
- [c9]Maurice Bruynooghe:
Is Logic Programming "Real" Programming? AIMSA 1986: 81-91 - [c8]Willem Rosiers, Maurice Bruynooghe:
Empirical Study of some Constraints Satisfaction Algorithms. AIMSA 1986: 173-180 - [c7]Maurice Bruynooghe, Danny De Schreye, Bruno Krekels:
Compiling Control. SLP 1986: 70-77 - 1985
- [c6]Edwin Pittomvils, Maurice Bruynooghe, Yves D. Willems:
Towards a Real-Time Garbage Collector for Prolog. SLP 1985: 185-198 - [c5]Raf Venken, Maurice Bruynooghe, Luc Dekeyser, Bruno Krekels:
The Centralized Scheduler vs. the Distributed Specialists: Towards a Flexible Controller in Prolog for Expert Systems. Wissensbasierte Systeme 1985: 370-383 - 1983
- [c4]Maurice Bruynooghe:
Some Reflexions on Implementation Issues of Prolog. Logic Programming Workshop 1983: 1-6 - 1982
- [c3]Maurice Bruynooghe:
A Note on Garbage-Collection in Prolog Interpreters. ICLP 1982: 52-55 - [c2]Maurice Bruynooghe:
Adding Redundancy to Obtain more Reliable and Readable Prolog Programs. ICLP 1982: 129-133 - 1980
- [c1]Maurice Bruynooghe:
Analysis of Dependencies to Improve the Behaviour of Logic Programs. CADE 1980: 293-305
Parts in Books or Collections
- 2018
- [p6]Broes De Cat, Bart Bogaerts, Maurice Bruynooghe, Gerda Janssens, Marc Denecker:
Predicate logic as a modeling language: the IDP system. Declarative Logic Programming 2018: 279-323 - 2004
- [p5]Wim Vanhoof, Maurice Bruynooghe, Michael Leuschel:
Binding-Time Analysis for Mercury. Program Development in Computational Logic 2004: 189-232 - [p4]Michael Leuschel, Stephen-John Craig, Maurice Bruynooghe, Wim Vanhoof:
Specialising Interpreters Using Offline Partial Deduction. Program Development in Computational Logic 2004: 340-375 - 1995
- [p3]Maurice Bruynooghe, Michael Codish, Anne Mulkers:
Abstracting Unification: A Key Step in the Design of Logic Program Analyses. Computer Science Today 1995: 406-425 - 1984
- [p2]Maurice Bruynooghe, Luís Moniz Pereira:
Deduction Revision by Intelligent Backtracking. Implementations of Prolog 1984: 194-215 - [p1]Maurice Bruynooghe:
Garbage Collection in Prolog Interpreters. Implementations of Prolog 1984: 259-267
Editorship
- 2004
- [e5]Maurice Bruynooghe:
Logic Based Program Synthesis and Transformation, 13th International Symposium LOPSTR 2003, Uppsala, Sweden, August 25-27, 2003, Revised Selected Papers. Lecture Notes in Computer Science 3018, Springer 2004, ISBN 3-540-22174-3 [contents] - [e4]Maurice Bruynooghe, Kung-Kiu Lau:
Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development. Lecture Notes in Computer Science 3049, Springer 2004, ISBN 3-540-22152-2 [contents] - 1994
- [e3]Maurice Bruynooghe:
Logic Programming, Proceedings of the 1994 International Symposium, Ithaca, New York, USA, November 13-17, 1994. MIT Press 1994, ISBN 0-262-52191-1 [contents] - 1993
- [e2]Maurice Bruynooghe, Jaan Penjam:
Programming Language Implementation and Logic Programming, 5th International Symposium, PLILP'93, Tallinn, Estonia, August 25-27, 1993, Proceedings. Lecture Notes in Computer Science 714, Springer 1993, ISBN 3-540-57186-8 [contents] - 1992
- [e1]Maurice Bruynooghe, Martin Wirsing:
Programming Language Implementation and Logic Programming, 4th International Symposium, PLILP'92, Leuven, Belgium, August 26-28, 1992, Proceedings. Lecture Notes in Computer Science 631, Springer 1992, ISBN 3-540-55844-6 [contents]
Informal and Other Publications
- 2023
- [i25]Pierre Carbonnelle, Gottfried Schenner, Maurice Bruynooghe, Bart Bogaerts, Marc Denecker:
Using Symmetries to Lift Satisfiability Checking. CoRR abs/2311.03424 (2023) - 2021
- [i24]Ruben Lapauw, Maurice Bruynooghe, Marc Denecker:
Justifications and a Reconstruction of Parity Game Solving Algorithms. CoRR abs/2102.01440 (2021) - [i23]Linde Vanbesien, Maurice Bruynooghe, Marc Denecker:
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory. CoRR abs/2104.14789 (2021) - 2016
- [i22]Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe, Marc Denecker:
On Local Domain Symmetry for Model Expansion. CoRR abs/1608.02688 (2016) - [i21]San Tu Pham, Jo Devriendt, Maurice Bruynooghe, Patrick De Causmaecker:
A MIP Backend for the IDP System. CoRR abs/1609.00759 (2016) - 2014
- [i20]Broes De Cat, Bart Bogaerts, Maurice Bruynooghe, Marc Denecker:
Predicate Logic as a Modelling Language: The IDP System. CoRR abs/1401.6312 (2014) - [i19]Broes De Cat, Marc Denecker, Peter J. Stuckey, Maurice Bruynooghe:
Lazy Model Expansion: Interleaving Grounding with Search. CoRR abs/1402.6889 (2014) - [i18]Bart Bogaerts, Joachim Jansen, Maurice Bruynooghe, Broes De Cat, Joost Vennekens, Marc Denecker:
Simulating dynamic systems using Linear Time Calculus theories. CoRR abs/1405.1523 (2014) - [i17]Mostafa Haghir Chehreghani, Maurice Bruynooghe:
Mining Rooted Ordered Trees under Homeomorphism. CoRR abs/1412.1470 (2014) - 2013
- [i16]Maurice Bruynooghe, Hendrik Blockeel, Bart Bogaerts, Broes De Cat, Stef De Pooter, Joachim Jansen, Anthony Labarre, Jan Ramon, Marc Denecker, Sicco Verwer:
Predicate Logic as a Modeling Language: Modeling and Solving some Machine Learning and Data Mining Problems with IDP3. CoRR abs/1309.6883 (2013) - 2011
- [i15]Ofer Arieli, Maurice Bruynooghe, Marc Denecker, Bert Van Nuffelen:
Coherent Integration of Databases by Abductive Logic Programming. CoRR abs/1107.0030 (2011) - [i14]Bernd Gutmann, Ingo Thon, Angelika Kimmig, Maurice Bruynooghe, Luc De Raedt:
The Magic of Logical Inference in Probabilistic Programming. CoRR abs/1107.5152 (2011) - 2010
- [i13]Johan Wittocx, Marc Denecker, Maurice Bruynooghe:
Constraint Propagation for Extended First-Order Logic. CoRR abs/1008.2121 (2010) - 2009
- [i12]Joost Vennekens, Marc Denecker, Maurice Bruynooghe:
CP-logic: A Language of Causal Probabilistic Events and Its Relation to Logic Programming. CoRR abs/0904.1672 (2009) - 2007
- [i11]K. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens:
Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code. CoRR abs/0710.4689 (2007) - 2005
- [i10]Nikolay Pelov, Marc Denecker, Maurice Bruynooghe:
Well-founded and Stable Semantics of Logic Programs with Aggregates. CoRR abs/cs/0509024 (2005) - 2003
- [i9]Maurice Bruynooghe:
Enhancing a Search Algorithm to Perform Intelligent Backtracking. CoRR cs.AI/0311003 (2003) - 2002
- [i8]Michael Leuschel, Maurice Bruynooghe:
Logic program specialisation through partial deduction: Control issues. CoRR cs.PL/0202012 (2002) - [i7]Michael Leuschel, Jesper Jørgensen, Wim Vanhoof, Maurice Bruynooghe:
Offline Specialisation in Prolog Using a Hand-Written Compiler Generator. CoRR cs.PL/0208009 (2002) - 2001
- [i6]Nancy Mazur, Peter Ross, Gerda Janssens, Maurice Bruynooghe:
Practical Aspects for a Working Compile Time Garbage Collection System for Mercury. CoRR cs.PL/0110037 (2001) - 2000
- [i5]Maurice Bruynooghe:
Logic Programming for Describing and Solving Planning Problems. CoRR cs.AI/0003025 (2000) - [i4]Nikolay Pelov, Emmanuel De Mot, Maurice Bruynooghe:
A Comparison of Logic Programming Approaches for Representation and Solving of Constraint Satisfaction Problems. CoRR cs.LO/0003026 (2000) - [i3]Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker:
Detecting Unsolvable Queries for Definite Logic Programs. CoRR cs.LO/0003067 (2000) - [i2]Nikolay Pelov, Maurice Bruynooghe:
Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog. CoRR cs.LO/0003069 (2000) - [i1]Maurice Bruynooghe, Michael Leuschel, Konstantinos Sagonas:
A Polyvariant Binding-Time Analysis for Off-line Partial Deduction. CoRR cs.PL/0003068 (2000)
Coauthor Index
[j69] [j68] [j66] [j65] [j64] [j63] [j62] [j60] [j58] [j54] [j50] [j49] [j43] [j40] [j39] [j37] [j29] [j27] [j26] [j21] [c144] [c143] [c142] [c141] [c139] [c137] [c136] [c135] [c134] [c132] [c131] [c123] [c121] [c120] [c114] [c112] [c111] [c110] [c107] [c98] [c96] [c94] [c92] [c90] [c87] [c83] [c81] [c74] [c72] [c62] [c60] [c52] [c42] [p6] [i25] [i24] [i23] [i22] [i20] [i19] [i18] [i16] [i15] [i13] [i12] [i10] [i3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
