skip to main content
Language:
Search Limited to: Search Limited to: Resource type Show Results with: Show Results with: Search type Index

Results 1 - 20 of 34  for All Library Resources

Results 1 2 next page
Show only
Result Number Material Type Add to My Shelf Action Record Details and Options
1
Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis
Material Type:
Article
Add to My Research

Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis

Theory and practice of logic programming, 2019-09, Vol.19 (5-6), p.990-1005 [Peer Reviewed Journal]

Cambridge University Press 2019 ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068419000310

Full text available

2
Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation
Material Type:
Article
Add to My Research

Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation

Theory and practice of logic programming, 2021-01, Vol.21 (1), p.4-50 [Peer Reviewed Journal]

Copyright © The Author(s), 2020. Published by Cambridge University Press ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068420000101

Full text available

3
Resource Analysis driven by (Conditional) Termination Proofs
Material Type:
Article
Add to My Research

Resource Analysis driven by (Conditional) Termination Proofs

Theory and practice of logic programming, 2019-09, Vol.19 (5-6), p.722-739 [Peer Reviewed Journal]

Cambridge University Press 2019 ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068419000152

Full text available

4
Detecting multiphase linear ranking functions for single-path linear-constraint loops
Material Type:
Article
Add to My Research

Detecting multiphase linear ranking functions for single-path linear-constraint loops

International journal on software tools for technology transfer, 2021-02, Vol.23 (1), p.55-67 [Peer Reviewed Journal]

Springer-Verlag GmbH Germany, part of Springer Nature 2019 ;International Journal on Software Tools for Technology Transfer is a copyright of Springer, (2019). All Rights Reserved. ;Springer-Verlag GmbH Germany, part of Springer Nature 2019. ;ISSN: 1433-2779 ;EISSN: 1433-2787 ;DOI: 10.1007/s10009-019-00527-1

Full text available

5
Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs
Material Type:
Article
Add to My Research

Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs

Journal of automated reasoning, 2013-06, Vol.51 (1), p.27-56 [Peer Reviewed Journal]

Springer Science+Business Media Dordrecht 2013 ;ISSN: 0168-7433 ;EISSN: 1573-0670 ;DOI: 10.1007/s10817-013-9277-6

Full text available

6
Ranking Function Detection via SVM: A More General Method
Material Type:
Article
Add to My Research

Ranking Function Detection via SVM: A More General Method

IEEE access, 2019, Vol.7, p.9971-9979 [Peer Reviewed Journal]

Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019 ;ISSN: 2169-3536 ;EISSN: 2169-3536 ;DOI: 10.1109/ACCESS.2018.2890692 ;CODEN: IAECCG

Full text available

7
A practical analysis of non-termination in large logic programs
Material Type:
Article
Add to My Research

A practical analysis of non-termination in large logic programs

Theory and practice of logic programming, 2013-07, Vol.13 (4-5), p.705-719 [Peer Reviewed Journal]

Copyright © 2013 [SENLIN LIANG and MICHAEL KIFER] ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068413000446

Full text available

8
On the Linear Ranking Problem for Simple Floating-Point Loops
Material Type:
Conference Proceeding
Add to My Research

On the Linear Ranking Problem for Simple Floating-Point Loops

Lecture Notes in Computer Science, Proceedings of the 23rd International Symposium on Static Analysis (SAS), 2016, Vol.9837, p.300-316 [Peer Reviewed Journal]

Distributed under a Creative Commons Attribution 4.0 International License ;DOI: 10.1007/978-3-662-53413-7_15

Digital Resources/Online E-Resources

9
Automated termination analysis for logic programs with cut
Material Type:
Article
Add to My Research

Automated termination analysis for logic programs with cut

Theory and practice of logic programming, 2010-07, Vol.10 (4-6), p.365-381 [Peer Reviewed Journal]

Copyright © Cambridge University Press 2010 ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068410000165

Full text available

10
DISCOVERING NON-TERMINATING INPUTS FOR MULTI-PATH POLYNOMIAL PROGRAMS
Material Type:
Article
Add to My Research

DISCOVERING NON-TERMINATING INPUTS FOR MULTI-PATH POLYNOMIAL PROGRAMS

Journal of systems science and complexity, 2014-12, Vol.27 (6), p.1286-1304 [Peer Reviewed Journal]

Institute of Systems Science, Academy of Mathematics and Systems Science, CAS and Springer-Verlag Berlin Heidelberg 2014 ;ISSN: 1009-6124 ;EISSN: 1559-7067 ;DOI: 10.1007/s11424-014-2145-6

Full text available

11
Terminyzer: An Automatic Non-termination Analyzer for Large Logic Programs
Material Type:
Book Chapter
Add to My Research

Terminyzer: An Automatic Non-termination Analyzer for Large Logic Programs

Practical Aspects of Declarative Languages, p.173-189 [Peer Reviewed Journal]

Springer-Verlag Berlin Heidelberg 2013 ;ISSN: 0302-9743 ;ISBN: 9783642452833 ;ISBN: 3642452833 ;EISSN: 1611-3349 ;EISBN: 9783642452840 ;EISBN: 3642452841 ;DOI: 10.1007/978-3-642-45284-0_12

Full text available

12
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs
Material Type:
Article
Add to My Research

Polytool: Polynomial interpretations as a basis for termination analysis of logic programs

Theory and practice of logic programming, 2011-01, Vol.11 (1), p.33-63 [Peer Reviewed Journal]

Copyright © Cambridge University Press 2010 ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068410000025

Full text available

13
Non-termination analysis of logic programs with integer arithmetics
Material Type:
Article
Add to My Research

Non-termination analysis of logic programs with integer arithmetics

Theory and practice of logic programming, 2011-07, Vol.11 (4-5), p.521-536 [Peer Reviewed Journal]

Copyright © Cambridge University Press 2011 ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068411000159

Full text available

14
SAT-based termination analysis using monotonicity constraints over the integers
Material Type:
Article
Add to My Research

SAT-based termination analysis using monotonicity constraints over the integers

Theory and practice of logic programming, 2011-07, Vol.11 (4-5), p.503-520 [Peer Reviewed Journal]

Copyright © Cambridge University Press 2011 ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068411000147

Full text available

15
Call-by-value Termination in the Untyped lambda-calculus
Material Type:
Article
Add to My Research

Call-by-value Termination in the Untyped lambda-calculus

Logical methods in computer science, 2008-03, Vol.4, Issue 1 [Peer Reviewed Journal]

ISSN: 1860-5974 ;EISSN: 1860-5974 ;DOI: 10.2168/LMCS-4(1:3)2008

Full text available

16
On termination of meta-programs
Material Type:
Article
Add to My Research

On termination of meta-programs

Theory and practice of logic programming, 2005-05, Vol.5 (3), p.355-390 [Peer Reviewed Journal]

2005 Cambridge University Press ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068404002248

Full text available

17
Acceptability with General Orderings
Material Type:
Book Chapter
Add to My Research

Acceptability with General Orderings

Computational Logic: Logic Programming and Beyond, p.187-210 [Peer Reviewed Journal]

Springer-Verlag Berlin Heidelberg 2002 ;ISSN: 0302-9743 ;ISBN: 9783540439592 ;ISBN: 3540439595 ;EISSN: 1611-3349 ;EISBN: 9783540456285 ;EISBN: 3540456287 ;DOI: 10.1007/3-540-45628-7_9

Full text available

18
Inference of termination conditions for numerical loops in Prolog
Material Type:
Article
Add to My Research

Inference of termination conditions for numerical loops in Prolog

Theory and practice of logic programming, 2004-09, Vol.4 (5-6), p.719-751 [Peer Reviewed Journal]

2004 Cambridge University Press ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068404002042

Full text available

19
Inferring termination conditions for logic programs using backwards analysis
Material Type:
Article
Add to My Research

Inferring termination conditions for logic programs using backwards analysis

Theory and practice of logic programming, 2005-01, Vol.5 (1-2), p.75-91 [Peer Reviewed Journal]

2005 Cambridge University Press ;ISSN: 1471-0684 ;EISSN: 1475-3081 ;DOI: 10.1017/S1471068404002236

Full text available

20
Analyses de terminaison des calculs flottants
Material Type:
Thesises (postgraduate)
Add to My Research

Analyses de terminaison des calculs flottants

Digital Resources/Online E-Resources

Results 1 - 20 of 34  for All Library Resources

Results 1 2 next page

Personalize your results

  1. Edit

Refine Search Results

Expand My Results

  1.   

Show only

  1. Peer-reviewed Journals (24)

Refine My Results

Creation Date 

From To
  1. Before 1999  (4)
  2. 1999 To 2003  (4)
  3. 2004 To 2010  (5)
  4. 2011 To 2016  (14)
  5. After 2016  (7)
  6. More options open sub menu

Language 

  1. English  (32)
  2. French  (2)
  3. German  (1)
  4. Japanese  (1)
  5. More options open sub menu

Searching Remote Databases, Please Wait