See this document in CiteSeerX!

A Brief Overview of Logic Programming Research at the K.U.Leuven, with Notes on its Industrial Relevance  (Make Corrections)  
Bern Martens, Maurice Bruynooghe, Marc Denecker, Luc De Raedt, Danny De Schreye, Gerda Janssens



  Home/Search   Context   Related

 
View or download:
cs.kuleuven.ac.be/pub/logic...cw223.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.kuleuven.ac.be/...abstracts.96 (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper, we present a brief overview of most recent and ongoing research in logic programming at the K.U.Leuven Department of Computer Science. We specifically include some indications of its practical, current and/or prospective industrial relevance. For the benefit of the interested reader, we also provide a rich selection of references to papers published by the K.U.Leuven group in the scientific literature. 1 Introduction The research group on Logic Programming and Artificial... (Update)

Active bibliography (related documents):   More   All
0.9:   Temporal Reasoning with iff-Abduction - Denecker, van Belleghem   (Correct)
0.9:   SLDNFA: an abductive procedure for abductive logic programs - Denecker, De Schreye (1997)   (Correct)
0.7:   A Realistic Experiment in Knowledge Representation .. - Denecker, Van.. (1996)   (Correct)

Similar documents based on text:   More   All
0.8:   Constraint Logic Programming: Applications and Implementation - Vandecasteele (1999)   (Correct)
0.6:   Logic program specialisation through partial deduction.. - Leuschel, Bruynooghe (2002)   (Correct)
0.6:   Project Report on: - Lp Second Generation   (Correct)

BibTeX entry:   (Update)

@misc{ martens-brief,
  author = "Bern Martens and Maurice Bruynooghe and Marc Denecker and Luc De Raedt
    and Danny De Schreye and Gerda Janssens",
  title = "A Brief Overview of Logic Programming Research at the K.U.Leuven, with
    Notes on its Industrial Relevance",
  url = "citeseer.ist.psu.edu/108389.html" }
Citations (may not include all citations):
815   Abstract interpretation: A unified lattice model for static .. (context) - Cousot, Cousot - 1977
324   A logic-based calculus of events (context) - Kowalski, Sergot - 1986
313   Inductive logic programming : Theory and methods - Muggleton, De Raedt - 1994
271   Efficient induction of logic programs - Muggleton, Feng - 1990
212   Abductive Logic Programming - Kakas, Kowalski et al. - 1992
108   A practical framework for the abstract interpretation of log.. (context) - Bruynooghe - 1991
96   Drug design by machine learning: the use of inductive logic .. (context) - King, Muggleton et al. - 1992
89   Deriving descriptions of possible values of program variable.. (context) - Janssens, Bruynooghe - 1992
85   Theories for mutagenicity: a study in first-order and featur.. - Srinivasan, Muggleton et al. - 1995
77   Representing incomplete knowledge in abductive logic program.. - Denecker, De Schreye - 1993
77   Protein secondary structure prediction using logic (context) - Muggleton, King et al. - 1992
77   Termination of logic programs: the never-ending story (context) - De Schreye, Decorte - 1994
77   Representing Incomplete Knowledge in Abductive Logic Program.. - Denecker, De Schreye - 1995
60   A theory of clausal discovery (context) - De Raedt, Bruynooghe - 1993
59   ositional Logic Programs and a Magic Wand (context) - Codish, Demoen et al. - 1993
59   ositional logic programs and a magic wand (context) - Codish, Demoen et al. - 1995
58   Ensuring global termination of partial deduction while allow.. - Martens, Gallagher - 1995
56   Temporal reasoning with abductive event calculus - Denecker, Missiaen et al. - 1992
51   First order jk-clausal theories are PAC-learnable (context) - De Raedt, Dzeroski - 1994
45   Improving abstract interpretations by combining domains (context) - Codish, Mulkers et al. - 1995
38   High-Performance logic programming with the Aquarius Prolog .. (context) - Van Roy, Despain - 1992
38   A general criterion for avoiding infinite unfolding during p.. (context) - Bruynooghe, De Schreye et al. - 1992
37   Abstract interpretation: Towards the global optimization of .. (context) - Bruynooghe, Janssens et al. - 1987
36   An instance of abstract interpretation integrating type and .. (context) - Bruynooghe, Janssens - 1988
36   Deriving polymorphic type dependencies for logic programs us.. - Codish, Demoen - 1994
30   Inductive constraint logic - De Raedt, Van Laer - 1995
30   Automatic inference of norms : a missing link in automatic t.. (context) - Decorte, De Schreye et al. - 1993
26   the practicality of abstract equation systems (context) - Mulkers, Simoens et al. - 1995
26   Knowledge Representation and Reasoning in Incomplete Logic P.. (context) - Denecker - 1993
26   A Terminological Interpretation (context) - Denecker - 1995
24   an abductive procedure for normal abductive programs (context) - Denecker, De Schreye - 1992
23   Sound and complete partial deduction with unfolding based on.. (context) - Martens, De Schreye et al. - 1994
22   Deriving termination proofs for logic programs (context) - Verschaetse, De Schreye - 1991
21   the Semantics of Meta-Programming and the Control of Partial.. (context) - Martens - 1994
20   an abductive planning system based on event calculus (context) - Missiaen, Denecker et al. - 1995
19   A blueprint for an abstract machine for abstract interpretat.. (context) - Janssens, Bruynooghe et al. - 1995
19   Justification semantics: a unifying framework for the semant.. (context) - Denecker, De Schreye - 1993
16   Partial deduction of the ground representation and its appli.. - Leuschel, Martens - 1995
14   Declarative Bias for Specific-to-General ILP Systems (context) - Ad'e, De Raedt et al. - 1995
14   the duality of abduction and model generation (context) - Denecker, De Schreye - 1992
13   real thing (context) - Leuschel, of - 1995
12   Towards creating specialised integrity checks through partia.. - Leuschel, De Schreye - 1995
12   Live-structure dataflow analysis for Prolog (context) - Mulkers, Winsborough et al. - 1994
11   A framework for analysing the termination of definite logic .. (context) - De Schreye, Verschaetse et al. - 1992
10   Representing continuous change in the abductive event calcul.. - Van Belleghem, Denecker et al. - 1994
10   Freeness Analysis in the Presence of Numerical Constraints - Dumortier, Janssens et al. - 1993
10   Global analysis of constraint logic programs - de la, Hermenegildo et al. - 1995
9   Abstracting numerical values in CLP (context) - Janssens, Bruynooghe et al. - 1994
9   the Duality of Abduction and Model Generation in a Framework.. - Denecker, De Schreye - 1994
8   Derivation of linear size relations by abstract interpretati.. (context) - Verschaetse, De Schreye - 1992
8   An almost perfect abstraction operation for partial deductio.. (context) - Leuschel, De Schreye - 1995
8   Towards a practical full mode inference system for CLP - Dumortier, Janssens - 1994
5   Implementing a finite-domain CLP-language on top of prolog :.. (context) - Vandecasteele, De Schreye - 1994
5   Deriving linear size relations for logic programs by abstrac.. (context) - De Schreye, Verschaetse - 1995
5   The abductive event calculus as a general framework for temp.. - Van Belleghem, Denecker et al. - 1994
4   en zijn toepassing voor het redeneren over continue verander.. (context) - Bruneel, Clarebout et al. - 1994
4   Live Data Structures in Logic Programs (context) - Mulkers - 1993
3   Automatic termination analysis (context) - Verschaetse, Decorte et al. - 1993
3   A strong correspondence between concept languages and open l.. (context) - Van Belleghem, Denecker et al. - 1994
3   Reasoning in an integration of Classical Logic and Logic Pro.. (context) - Denecker, De Schreye - 1995
3   Integrating types in termination analysis (context) - Decorte, De Schreye et al. - 1996
3   Using Event Calculus for Protocol Specification (context) - Denecker, Duchatelet et al. - 1995
3   The compilation of forward checking regimes through meta-int.. (context) - De Schreye, Bruynooghe - 1989
2   Generation and compilation of efficient computation rules (context) - Verschaetse, De Schreye et al. - 1990
2   Implementing finitedomain constraint logic programming on to.. (context) - De Schreye, Pollet et al. - 1990
2   Some further issues in finite unfolding (context) - Martens, De Schreye - 1994
2   results from a Prolog compiler for a RISC (context) - Taylor, MIPS - 1990
2   A practical technique for detecting nonterminating queries f.. (context) - De Schreye, Verschaetse et al. - 1990
2   Termination of logic programs: Tutorial notes (context) - De Schreye, Verschaetse - 1992
1   the existence of nonterminating queries for a restricted cla.. (context) - De Schreye, Bruynooghe et al. - 1989
1   A theory of Inductive Definitions and its application for th.. (context) - Denecker - 1995
1   the design of a correct analysis for logic programs (context) - Codish, Dams et al. - 1996

Documents on the same site (http://www.cs.kuleuven.ac.be/cwis/research/dtai/publications/abstracts.96.html):   More
Creating Specialised Integrity Checks Through Partial.. - Leuschel, De Schreye (1998)   (Correct)
On The Relation Between Situation Calculus And Event.. - Van BELLEGHEM.. (1997)   (Correct)
Live-structure Analysis for Logic Programming Languages with.. - Bruynooghe (1996)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC