The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase left termination (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1994-2006 (11)
Publication types (Num. hits)
article(5) inproceedings(6)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 5 occurrences of 3 keywords

Results
Found 11 publication records. Showing 11 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
64Frédéric Mesnard, Salvatore Ruggieri On proving left termination of constraint logic programs. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Automatic termination analysis, left termination, termination inference, constraint logic programming
64Frédéric Mesnard, Salvatore Ruggieri On proving left termination of constraint logic programs. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Automatic termination analysis, left termination, termination inference, constraint logic programming
63Frédéric Mesnard, Étienne Payet, Ulrich Neumerkel Detecting Optimal Termination Conditions of Logic Programs. Search on Bibsonomy SAS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
50Étienne Payet, Frédéric Mesnard Non-termination Inference for Constraint Logic Programs. Search on Bibsonomy SAS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
45Frédéric Mesnard, Ulrich Neumerkel Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs. Search on Bibsonomy SAS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
33Kees Doets Left Termination Turned into Termination. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
31Étienne Payet, Frédéric Mesnard Nontermination inference of logic programs. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF nontermination analysis, optimal termination condition, Logic programming, static analysis
25Manh Thang Nguyen, Danny De Schreye Polytool: Proving Termination Automatically Based on Polynomial Interpretations. Search on Bibsonomy LOPSTR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
25Sébastien Hoarau, Frédéric Mesnard Inferring and Compiling Termination for Constraint Logic Programs. Search on Bibsonomy LOPSTR The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
22Stefaan Decorte, Danny De Schreye Demand-Driven and Constraint-Based Automatic Left-Termination Analysis for Logic Programs. Search on Bibsonomy ICLP The full citation details ... 1997 DBLP  BibTeX  RDF
19Dino Pedreschi, Salvatore Ruggieri Bounded Nondeterminism of Logic Programs. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF universal termination, bounded nondeterminism, strong termination, logic programming
Displaying result #1 - #11 of 11 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license