Article

A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints

Authors:

Michael Codish,

Cohavit TabochAuthors Info & Claims

ALP '97-HOA '97: Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming

Pages 31 - 45

Published: 03 September 1997 Publication History

Abstract

No abstract available.

Cited By

View all

Kroening DSharygina NTsitovich AWintersteiger C(2010)Termination analysis with compositional transition invariantsProceedings of the 22nd international conference on Computer Aided Verification10.1007/978-3-642-14295-6_9(89-103)Online publication date: 15-Jul-2010
https://dl.acm.org/doi/10.1007/978-3-642-14295-6_9
Ben-Amram A(2008)Size-change termination with difference constraintsACM Transactions on Programming Languages and Systems10.1145/1353445.135345030:3(1-31)Online publication date: 21-May-2008
https://dl.acm.org/doi/10.1145/1353445.1353450
Ben-Amram ALee C(2007)Program termination analysis in polynomial timeACM Transactions on Programming Languages and Systems10.1145/1180475.118048029:1(1-37)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1145/1180475.1180480
Show More Cited By

A Semantic Basis for Termination Analysis of Logic Programs and Its Realization Using Symbolic Norm Constraints
1. Computing methodologies
  1. Artificial intelligence
    1. Knowledge representation and reasoning
2. Theory of computation
  1. Logic

Recommendations

On proving left termination of constraint logic programs

The Constraint Logic Programming (CLP) Scheme merges logic programming with constraint solving over predefined domains. In this article, we study proof methods for universal left termination of constraint logic programs. We provide a sound and complete ...
Automated termination analysis for logic programs by term rewriting
LOPSTR'06: Proceedings of the 16th international conference on Logic-based program synthesis and transformation

There are two kinds of approaches for termination analysis of logic programs: "transformational" and "direct" ones. Direct approaches prove termination directly on the basis of the logic program. Transformational approaches transform a logic program ...
Description logic programs: combining logic programs with description logic
WWW '03: Proceedings of the 12th international conference on World Wide Web

We show how to interoperate, semantically and inferentially, between the leading Semantic Web approaches to rules (RuleML Logic Programs) and ontologies (OWL/DAML+OIL Description Logic) via analyzing their expressive intersection. To do so, we define a ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ALP '97-HOA '97: Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming

September 1997

286 pages

ISBN:3540634592

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 03 September 1997

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kroening DSharygina NTsitovich AWintersteiger C(2010)Termination analysis with compositional transition invariantsProceedings of the 22nd international conference on Computer Aided Verification10.1007/978-3-642-14295-6_9(89-103)Online publication date: 15-Jul-2010
https://dl.acm.org/doi/10.1007/978-3-642-14295-6_9
Ben-Amram A(2008)Size-change termination with difference constraintsACM Transactions on Programming Languages and Systems10.1145/1353445.135345030:3(1-31)Online publication date: 21-May-2008
https://dl.acm.org/doi/10.1145/1353445.1353450
Ben-Amram ALee C(2007)Program termination analysis in polynomial timeACM Transactions on Programming Languages and Systems10.1145/1180475.118048029:1(1-37)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1145/1180475.1180480
Decorte SDe Schreye DVandecasteele H(1999)Constraint-based termination analysis of logic programsACM Transactions on Programming Languages and Systems10.1145/330643.33064521:6(1137-1195)Online publication date: 1-Nov-1999
https://dl.acm.org/doi/10.1145/330643.330645

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Recommendations

On proving left termination of constraint logic programs

Automated termination analysis for logic programs by term rewriting

Description logic programs: combining logic programs with description logic

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations