MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named Maurice Bruynooghe – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 113 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Enhancing a Search Algorithm to Perform Intelligent Backtracking  
  • by Maurice Bruynooghe — 2004 — In ICLP'04: Proceedings of the 20th International Conference on Logic Programming
  • …This paper illustrates how a Prolog program, using chronological backtracking to find a solution in some search space, can be enhanced to perform intelligent backtracking. The enhancement crucially relies on the impurity of Prolog that allows a program to store information when a dead end is reached…
  • Cited by 3 (0 self) – Add To MetaCart
  • On the Design of a Correct Freeness Analysis for Logic Programs  
  • by Michael Codish, Dennis Dams, Gilberto Filé. Maurice Bruynooghe, Maurice Bruynooghe — 1996
  • …Several proposals for computing freeness information for logic programs have been put forward in recent literature. The availability of such information has proven useful in a variety of applications, including parallelization of Prolog programs, optimizations in Prolog compilers, as well as for imp…
  • Cited by 5 (1 self) – Add To MetaCart
  • Proving Failure of Queries for Definite Logic Programs Using XSB-Prolog  
  • by Nikolay Pelov, Maurice Bruynooghe — 1999
  • …Proving failure of queries for de nite logic programs can be done by constructing a finite model of the program in which the query is false. A general purpose model generator for first order logic can be used for this. A recent paper presented at PLILP98 shows how the peculiarities of definite progr…
  • Add To MetaCart
  • Logic program specialisation through partial deduction: Control issues  
  • by Michael Leuschel, Maurice Bruynooghe — 2002
  • …Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programming, known respectively as partial evaluation and partial deduction, is to exploit partial knowledge about the input. It …
  • Cited by 36 (9 self) – Add To MetaCart
  • Binding-Time Analysis for Mercury  
  • by Wim Vanhoof, Maurice Bruynooghe — 1999 — 16th International Conference on Logic Programming, pages 500 { 514
  • …. In this paper, we describe a binding-time analysis (BTA) for a statically typed and strongly moded pure logic programming language, in casu Mercury. Binding-time analysis is the key concept in achieving o-line program specialisation: the analysis starts from a description of the program's inpu…
  • Cited by 8 (4 self) – Add To MetaCart
  • Binding-time Annotations without Binding-time Analysis (Extended Abstract)  
  • by Wim Vanhoof, Maurice Bruynooghe — 2001 — Logic for Programming, Artificial Intelligence, and Reasoning, 8th International Conference, LNCS 2250
  • …) Wim Vanhoof and Maurice Bruynooghe Department of Computer Science, K.U.Leuven, Belgium. e-mail: fwimvh,mauriceg@cs.kuleuven.ac.be Abstract. In this work, we argue that the use of termination conditions as unfolding criteria is insucient to obtain adequate specialisation of logic programs. We…
  • Cited by 8 (4 self) – Add To MetaCart
  • Towards a Modular Binding-time Analysis for Higher-order Mercury  
  • by Wim Vanhoof, Maurice Bruynooghe — 2000 — In Special Issue on Optimization and Implementation of Declarative Programming Languages, volume 30 of Electronic Notes in Theoretical Computer Science. Elsevier - North
  • …This extended abstract describes work in progress on binding-time analysis (BTA) for Mercury. It reports on a so called phased BTA that deals with the higher-order aspects of Mercury, and of which a large part can be performed on a modular basis.…
  • Cited by 5 (1 self) – Add To MetaCart
  • Aggregation versus selection bias, and relational neural networks  
  • by Hendrik Blockeel, Maurice Bruynooghe — 2003 — In: IJCAI-2003 Workshop on Learning Statistical Models from Relational Data, SRL-2003
  • …Current relational learners handle sets either by aggregating over them or by selecting specific elements, but do not combine both. This imposes a significant, possibly undesirable bias on these learners. We discuss this bias, as well as some ideas on how to lift it. In the process, we introduce the…
  • Cited by 6 (4 self) – Add To MetaCart
  • Parameterless information extraction using (k,l)-contextual tree languages  
  • by Stefan Raeymaekers, Maurice Bruynooghe — 2004 — In BNAIC 2004 - Proceedings of the 16th Belgian-Dutch Conference on Artificial Intelligence
  • …Recently, several wrapper induction algorithms for structured documents have been introduced. They are based on contextual tree languages and learn from positive examples only but have the disadvantage that they need parameters. To obtain the optimal parameter setting, they use precision and recall.…
  • Cited by 1 (1 self) – Add To MetaCart
  • Inferring Polymorphic Types from Logic Programs  
  • by Maurice Bruynooghe, John Gallagher — 2005 — Proc. of the Int’l Symposium on Logic-based Program Synthesis and Transformation (LOPSTR’04). Springer LNCS
  • …Abstract. This extended abstract sketches work in progress on how to infer polymorphic types from logic programs. Type information can contribute to a better automation of termination analysis. However, as sketched in the introduction, the monomorphic types describing the success set of predicates, …
  • Cited by 1 (0 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB