Вы здесь

De Schreye D.

Автор:

Вид Название Год Автор Серия Редакторы Колл. автор Источник Дата поступления
СТ On Termination of Logic Programs with Floating Point Computations 2002 Serebrenik A., De Schreye D. Lecture Notes in Computer Science 31.10.2002
СТ Non-transformational Termination Analysis of Logic Programs, Based on General Term-Orderings 2001 Serebrenik A., De Schreye D. Lecture Notes in Computer Science 23.06.2001
СТ Termination analysis: some practical properties of the norm and level mapping space 1998 Decorte S., De Schreye D. Logic Programming 07.03.2001
СТ Constraint-Based Termination Analysis of Logic Programs 1999 Decorte S., De Schreye D., Vandecasteele H. ACM Trans. on Programming Languages and Systems 10.07.2000
СТ Termination Analysis of Tabled Logic Programs Using Mode and Type Information 1999 Verbaeten S., De Schreye D. Lecture Notes in Computer Science 25.11.1999
СТ Modular Termination Proofs for Prolog with Tabling 1999 Verbaeten S., Sagonas K., De Schreye D. Lecture Notes in Computer Science 27.10.1999
СТ Termination Analysis for Tabled Logic Programming 1998 Decorte S., De Schreye D., Leuschel M., Martens B., Sagonas K. Lecture Notes in Computer Science 14.10.1998
СТ A Framework for Bottom Up Specialisation of Logic Programs 1998 Vanhoof W., De Schreye D., Martens B. Lecture Notes in Computer Science 13.10.1998
СТ Controlling Generalization and Polyvariance in Partial Deduction of Normal Logic Programs 1998 Leuschel M., Martens B., De Schreye D. ACM Trans. on Programming Languages and Systems 30.07.1998
СТ Demand-driven and Constraint-based Automatic Left-termination Analysis for Logic Programs 1997 Decorte S., De Schreye D. Logic Programming 11.03.1998
СТ A Strong Correspondence between Description Logics and Open Logic Programming 1997 Van Belleghem K., Denecker M., De Schreye D. Logic Programming 11.03.1998
СТ Compositionality of Normal Open Logic Programs 1997 Verbaeten S., Denecker M., De Schreye D. Logic Programming 05.03.1998
СТ Towards Creating Specialized Integrity Checks Through Partial Evaluation of Meta-Interpreters 1995 Leuschel M., De Schreye D. Proc. of the ACM SIGPLAN Symp. on Partial Evaluation and Semantics-Based Program Manipulation 13.08.1997
СТ Logic Program Specialisation: How to Be More Specific 1996 Leuschel M., De Schreye D. Lecture Notes in Computer Science 20.11.1996
СТ Combining Situation Calculus and Event Calculus 1995 Van Belleghem K., Denecker M., De Schreye D. Logic Programming: Proc. of the Twelfth Intern. Conf. 06.05.1996
СТ Compiling Control Revisited: A New Approach based upon Abstract Interpretation 1994 Boulanger D., De Schreye D. Logic Programming: Proc. of the Eleventh Intern. Conf. 01.02.1996
СТ A General Criterion for Avoiding Infinite Unfolding during Partial Deduction of Logic Programs 1991 Bruynooghe M., De Schreye D., Martens B. Logic Programming: Proc./1991 Intern. Symp. 29.12.1994
СТ A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming 1992 Martens B., De Schreye D. Logic Programming: Proc./ Joint Intern. Conf. and Symp. on Logic Programming 19.12.1994
СТ Automatic Inference of Norms: a Missing Link in Automatic Termination Analysis 1993 Decorte S., De Schreye D., Fabris M. Logic Programming: Proc./1993 Intern. Symp. 21.09.1994
СТ Representing Incomplete Knowledge in Abductive Logic Programming 1993 Denecker M., De Schreye D. Logic Programming: Proc./1993 Intern. Symp. 20.09.1994
СТ Deriving Termination Proofs for Logic Programs, using Abstract Procedures 1991 Verschaetse K., De Schreye D. Logic Programming: Proc./Eighth Intern. Conf. 19.09.1994
СТ The Abductive Event Calculus as a General Framework for Temporal Databases 1994 Van Belleghem K., Denecker M., De Schreye D. Lecture Notes in Artificial Intelligence 12.08.1994
СТ Implementing a Finite-domain CLP-language on Top of Prolog: A Transformational Approach 1994 Vandecasteele H., De Schreye D. Lecture Notes in Artificial Intelligence 04.08.1994
СТ Tutorial on Termination of Logic Programs 1992 De Schreye D., Verschaetse K. Lecture Notes in Computer Science 03.02.1993
СТ A Sensible Least Herbrand Semantics for Untyped Vanilla Meta-Programming and its Extension to a Limited Form of Amalgamation 1992 De Schreye D., Martens B. Lecture Notes in Computer Science 03.02.1993
СТ Derivation of Linear Size Relations by Abstract Interpretation 1992 Verschaetse K., De Schreye D. Lecture Notes in Computer Science 13.10.1992