Maurice Bruynooghe - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

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]

2010

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]

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 comparison of pruning criteria for probability treesDaan Fierens, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe. ml, 78(1-2):251-285, 2010. [doi]

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]

Embracing Events in Causal Modelling: Interventions and Counterfactuals in CP-LogicJoost Vennekens, Maurice Bruynooghe, Marc Denecker. jelia 2010: 313-325 [doi]

FO(ID) as an extension of DL with rulesJoost Vennekens, Marc Denecker, Maurice Bruynooghe. AMAI, 58(1-2):85-115, 2010. [doi]

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]

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]

2009

2008

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

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]

SAT(ID): Satisfiability of Propositional Logic Extended with Inductive DefinitionsMaarten Mariën, Johan Wittocx, Marc Denecker, Maurice Bruynooghe. sat 2008: 211-224 [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]

Sub Node Extraction with Tree Based WrappersStefan Raeymaekers, Maurice Bruynooghe. ecai 2008: 137-141 [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]

An Efficiently Computable Graph-Based Metric for the Classification of Small MoleculesLeander Schietgat, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel. dis 2008: 197-209 [doi]

From Monomorphic to Polymorphic Well-Typings and BeyondTom Schrijvers, Maurice Bruynooghe, John P. Gallagher. LOPSTR 2009: 152-167 [doi]

Algorithms for Weighted Counting over Parametric Polytopes: A Survey and a Practical ComparisonSven Verdoolaege, Maurice Bruynooghe. itsl 2008: 60-66

2007

Distance semantics for database repairOfer Arieli, Marc Denecker, Maurice Bruynooghe. AMAI, 50(3-4):389-415, 2007. [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), 2007. [doi]

Approximate Query Answering in Locally Closed DatabasesAlvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe. AAAI 2007: 397-402

Learning Relational Options for Inductive Transfer in Relational Reinforcement LearningTom Croonenborghs, Kurt Driessens, Maurice Bruynooghe. ilp 2008: 88-97 [doi]

Online Learning and Exploiting Relational Models in Reinforcement LearningTom Croonenborghs, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe. IJCAI 2007: 726-731 [doi]

Learning Directed Probabilistic Logical Models Using Ordering-SearchDaan Fierens, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel. ilp 2008: 24 [doi]

Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-SearchDaan Fierens, Jan Ramon, Maurice Bruynooghe, Hendrik Blockeel. ecml 2007: 567-574 [doi]

Well-founded and stable semantics of logic programs with aggregatesNikolay Pelov, Marc Denecker, Maurice Bruynooghe. tplp, 7(3):301-353, 2007. [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]

A Polynomial-time Metric for Outerplanar GraphsLeander Schietgat, Jan Ramon, Maurice Bruynooghe. mlg 2007: [doi]

A practical dynamic single assignment transformationPeter Vanbroekhoven, Gerda Janssens, Maurice Bruynooghe, Francky Catthoor. todaes, 12(4), 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]

2006

Computational methods for database repair by signed formulaeOfer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe. AMAI, 46(1-2):4-37, 2006. [doi]

Distance-Based Repairs of DatabasesOfer Arieli, Marc Denecker, Maurice Bruynooghe. jelia 2006: 43-55 [doi]

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]

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]

Generalized Ordering-Search for Learning Directed Probabilistic Logical ModelsJan Ramon, Tom Croonenborghs, Daan Fierens, Hendrik Blockeel, Maurice Bruynooghe. ilp 2007: 40-42 [doi]

Polymorphic algebraic data type reconstructionTom Schrijvers, Maurice Bruynooghe. ppdp 2006: 85-96 [doi]

Representing Causal Information About a Probabilistic ProcessJoost Vennekens, Marc Denecker, Maurice Bruynooghe. jelia 2006: 452-464 [doi]

Predicate Introduction Under Stable and Well-Founded SemanticsJohan Wittocx, Joost Vennekens, Maarten Mariën, Marc Denecker, Maurice Bruynooghe. ICLP 2006: 242-256 [doi]

2005

Inference of Well-Typings for Logic Programs with Application to Termination AnalysisMaurice Bruynooghe, John P. Gallagher, Wouter Van Humbeeck. SAS 2005: 35-51 [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]

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

Multi-agent Relational Reinforcement LearningTom Croonenborghs, Karl Tuyls, Jan Ramon, Maurice Bruynooghe. lamas 2006: 192-206 [doi]

Logical Bayesian Networks and Their Relation to Other Probabilistic Logical ModelsDaan Fierens, Hendrik Blockeel, Maurice Bruynooghe, Jan Ramon. bnaic 2005: 343-344

Logical Bayesian Networks and Their Relation to Other Probabilistic Logical ModelsDaan Fierens, Hendrik Blockeel, Maurice Bruynooghe, Jan Ramon. ilp 2005: 121-135 [doi]

A Comparison of Approaches for Learning Probability TreesDaan Fierens, Jan Ramon, Hendrik Blockeel, Maurice Bruynooghe. ecml 2005: 556-563 [doi]

Satisfiability Checking for PC(ID)Maarten Mariën, Rudradeb Mitra, Marc Denecker, Maurice Bruynooghe. lpar 2005: 565-579 [doi]

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 (k, l)-Contextual Tree Languages for Information ExtractionStefan Raeymaekers, Maurice Bruynooghe, Jan Van den Bussche. ecml 2005: 305-316 [doi]

Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source CodeK. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens. date 2005: 1310-1315 [doi]

Verification of Source Code Transformations by Program Equivalence CheckingK. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens. CC 2005: 221-236 [doi]

Transformation to Dynamic Single Assignment Using a Simple Data Flow AnalysisPeter Vanbroekhoven, Gerda Janssens, Maurice Bruynooghe, Francky Catthoor. aplas 2005: 330-346 [doi]

Experiences with Enumeration of Integer Projections of Parametric PolytopesSven Verdoolaege, Kristof Beyls, Maurice Bruynooghe, Francky Catthoor. CC 2005: 91-105 [doi]

2004

Database Repair by Signed FormulaeOfer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe. foiks 2004: 14-30 [doi]

Coherent Integration of Databases by Abductive Logic ProgrammingOfer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe. jair, 21:245-286, 2004. [doi]

Enhancing a search algorithm to perform intelligent backtrackingMaurice Bruynooghe. tplp, 4(3):371-380, 2004.

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.

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.

Specialising Interpreters Using Offline Partial DeductionMichael Leuschel, Stephen-John Craig, Maurice Bruynooghe, Wim Vanhoof. LOPSTR 2004: 340-375 [doi]

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.

Data Integration Using ID-LogicBert Van Nuffelen, Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe. caise 2004: 67-81 [doi]

Partial Stable Models for Logic Programs with AggregatesNikolay Pelov, Marc Denecker, Maurice Bruynooghe. lpnmr 2004: 207-219 [doi]

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]

Binding-Time Analysis for MercuryWim Vanhoof, Maurice Bruynooghe, Michael Leuschel. LOPSTR 2004: 189-232 [doi]

Logic Programs with Annotated DisjunctionsJoost Vennekens, Sofie Verbaeten, Maurice Bruynooghe. ICLP 2004: 431-445 [doi]

Logic programs with annotated disjunctionsJoost Vennekens, Sofie Verbaeten, Maurice Bruynooghe. lpnmr 2004: 409-415 [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]

2003

2002

Repairing Inconsistent Databases: A Model-Theoretic Approach and Abductive ReasoningOfer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe. pcl 2002: 51-65 [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]

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]

Special Issue on Program Development, Guest Editors IntroductionMaurice Bruynooghe, Kung-Kiu Lau. tplp, 2(4-5):423-424, 2002.

Reuse of Results in Termination Analysis of Typed Logic ProgramsMaurice Bruynooghe, Michael Codish, Samir Genaim, Wim Vanhoof. SAS 2002: 477-492 [doi]

Information Extraction in Structured Documents Using Tree Automata InductionRaymond Kosala, Jan Van den Bussche, Maurice Bruynooghe, Hendrik Blockeel. pkdd 2002: 299-310 [doi]

Logic program specialisation through partial deduction: Control issuesMichael Leuschel, Maurice Bruynooghe. tplp, 2(4-5):461-515, 2002.

Geometric Model Checking: An Automatic Verification Technique for Loop and Data Reuse TransformationsK. C. Shashidhar, Maurice Bruynooghe, Francky Catthoor, Gerda Janssens. ENTCS, 65(2), 2002. [doi]

Storage Size Reduction by In-place Mapping of ArraysRemko Tronçon, Maurice Bruynooghe, Gerda Janssens, Francky Catthoor. vmcai 2002: 167-181 [doi]

A Fixed Point Semantics for Logic Programs Extended with CutsWim Vanhoof, Remko Tronçon, Maurice Bruynooghe. LOPSTR 2003: 238-257 [doi]

2001

Coherent Composition of Distributed Knowledge-Bases Through AbductionOfer Arieli, Bert Van Nuffelen, Marc Denecker, Maurice Bruynooghe. lpar 2001: 624-638 [doi]

Pos(T): Analyzing Dependencies in Typed Logic ProgramsMaurice Bruynooghe, Wim Vanhoof, Michael Codish. ershov 2001: 406-420 [doi]

Ultimate Well-Founded and Stable Semantics for Logic Programs with AggregatesMarc Denecker, Nikolay Pelov, Maurice Bruynooghe. ICLP 2001: 212-226 [doi]

Logic programming revisited: Logic programs as inductive definitionsMarc Denecker, Maurice Bruynooghe, V. Wiktor Marek. tocl, 2(4):623-654, 2001. [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]

A polynomial time computable metric between point setsJan Ramon, Maurice Bruynooghe. ACTA, 37(10):765-780, 2001. [doi]

When Size Does MatterWim Vanhoof, Maurice Bruynooghe. LOPSTR 2001: 129-147 [doi]

Binding-Time Annotations Without Binding-Time AnalysisWim Vanhoof, Maurice Bruynooghe. lpar 2001: 707-722 [doi]

2000

1999

Detecting Unsolvable Queries for Definite Logic ProgramsMaurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker. jflp, 1999(Special Issue 2), 1999.

Proving Failure of Queries for Definite Logic Programs Using XSB-PrologNikolay Pelov, Maurice Bruynooghe. lpar 1999: 358-375

Towards Modular Binding-Time Analysis for First-order MercuryWim Vanhoof, Maurice Bruynooghe. TCS, 30(2), 1999. [doi]

PreviousNext