|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 7 keywords
|
|
|
Results
Found 6 publication records. Showing 6 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
85 | Germán Vidal |
Quasi-terminating logic programs for ensuring the termination of partial evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PEPM ![In: Proceedings of the 2007 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2007, Nice, France, January 15-16, 2007, pp. 51-60, 2007, ACM, 978-1-59593-620-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
quasi-termination, partial deduction |
77 | Sofie Verbaeten, Danny De Schreye |
Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 12(1/2), pp. 157-196, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Logic Programming, Termination, Tabling |
60 | Sofie Verbaeten, Danny De Schreye, Konstantinos Sagonas |
Termination proofs for logic programs with tabling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 2(1), pp. 57-92, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
prolog, tabling, SLG-resolution |
35 | Stefaan Decorte, Danny De Schreye, Michael Leuschel, Bern Martens, Konstantinos Sagonas |
Termination Analysis for Tabled Logic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LOPSTR ![In: Logic Programming Synthesis and Transformation, 7th International Workshop, LOPSTR'97, Leuven, Belgium, July 10-12, 1997, Proceedings, pp. 111-127, 1997, Springer, 3-540-65074-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
26 | J. Guadalupe Ramos, Josep Silva, Germán Vidal |
Fast narrowing-driven partial evaluation for inductively sequential programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, ICFP 2005, Tallinn, Estonia, September 26-28, 2005, pp. 228-239, 2005, ACM, 1-59593-064-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
offline partial evaluation, quasi-termination, narrowing |
19 | J. Guadalupe Ramos, Josep Silva, Germán Vidal |
Ensuring the quasi-termination of needed narrowing computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 101(5), pp. 220-226, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #6 of 6 (100 per page; Change: )
|
|