Daniel De Schreye

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Non-transformational termination analysis of logic programs, based on general term-orderings
Lecture Notes in Computer Science
2003-09-01Paper
Non-transformational termination analysis of logic programs, based on general term-orderings
Lecture Notes in Computer Science
2003-09-01Paper
On termination of logic programs with floating point computations
Lecture Notes in Computer Science
2003-07-13Paper
Acceptability with general orderings
Lecture Notes in Computer Science
2003-06-11Paper
Termination analysis of tabled logic programs using mode and type information
Lecture Notes in Computer Science
2002-07-22Paper
Termination of simply-moded well-typed logic programs under a tabled execution mechanism
Applicable Algebra in Engineering, Communication and Computing
2001-08-26Paper
Modular termination proofs for prolog with tabling
Lecture Notes in Computer Science
2001-03-12Paper
scientific article; zbMATH DE number 1420813 (Why is no real title available?)2000-12-05Paper
The abductive event calculus as a general framework for temporal databases
Lecture Notes in Computer Science
2000-11-28Paper
Conjunctive partial deduction: foundations, control, algorithms, and experiments
The Journal of Logic Programming
2000-09-26Paper
scientific article; zbMATH DE number 1508931 (Why is no real title available?)2000-09-18Paper
scientific article; zbMATH DE number 1420816 (Why is no real title available?)2000-03-22Paper
Compositionality of normal open logic programs
The Journal of Logic Programming
2000-03-16Paper
scientific article; zbMATH DE number 1407684 (Why is no real title available?)2000-02-28Paper
Creating specialised integrity checks through partial evaluation of meta-interpreters
The Journal of Logic Programming
1999-04-19Paper
A framework for bottom up specialisation of logic programs
Lecture Notes in Computer Science
1998-11-11Paper
SLDNFA: An abductive procedure for abductive logic programs
The Journal of Logic Programming
1998-10-06Paper
On the relation between situation calculus and event calculus
The Journal of Logic Programming
1997-10-23Paper
Automatic finite unfolding using well-founded measures
The Journal of Logic Programming
1997-06-09Paper
A general criterion for avoiding infinite unfolding during partial deduction
New Generation Computing
1993-04-01Paper
scientific article; zbMATH DE number 4178791 (Why is no real title available?)1989-01-01Paper


Research outcomes over time


This page was built for person: Daniel De Schreye