Amanote Research

Amanote Research

  • Register
  • Sign In

Proving Termination With Multiset Orderings

Communications of the ACM- United States

doi 10.1145/359138.359142

Full Text

Abstract

Available in

Categories

Computer Science

Date

August 1, 1979

Authors

Nachum DershowitzZohar Manna

Publisher

Association for Computing Machinery (ACM)


Related search

Automatically Proving Program Termination

English

Proving Non-Termination Using Max-SMT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Proving Existential Termination of Normal Logic Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Matrix Interpretations for Proving Termination of Term Rewriting

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2007English

Practical Methods for Proving Termination of General Logic Programs

Journal of Artificial Intelligence Research
Artificial Intelligence
1996English

Fuzzy Soft Multiset Theory

Abstract and Applied Analysis
Applied MathematicsAnalysis
2012English

Compactness in Multiset Topology

International Journal of Mathematics Trends and Technology
2017English

Fuzzy Multiset Clustering for Metagame Analysis

2019English

Fuzzy Strict Preference Relations Compatible With Fuzzy Orderings

International Journal of Uncertainty, Fuzziness and Knowlege-Based Systems
ControlSystems EngineeringInformation SystemsArtificial IntelligenceSoftware
2010English

Amanote Research

Note-taking for researchers

Follow Amanote


© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy