Вы здесь

Главная

завершение

Связанные издания:

Proving Termination for Logic Programs by the Query-Mapping Paris Approach
Proving Termination of (Conditional) Rewrite Systems
Proving Termination of Logic Programs by Exploiting Term Properties
Proving Termination of Logic Programs by Transforming Them into Equivalent Term Rewriting Systems
Safe Stratified Datalog with Integer Order Programs
Semantics and Termination of Simply-Moded Logic Programs with Dynamic Scheduling
Semantic Technology: Proc./9th International Conference, JIST 2019, Hangzhou, China, November 2019
Simple Termination is Difficult
Strict Functionals for Termination Proofs
Syntactical Analysis of Total Termination
Term Completion Versus Algebraic Completion
Termination Analysis for Functional Programs Using Term Orderings
Termination Analysis for Tabled Logic Programming
Termination Analysis of Tabled Logic Programs Using Mode and Type Information
Termination and completion modulo associativity, communicativity and identity
Termination of Linear Programs
Termination of Logic Programs using Semantic Unification
Termination of Logic Programs with Block Declarations Running in Several Modes
Termination Proofs and Complexity Certification
Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths
Term Rewriting and Applications: Proc./16th International Conference, RTA 2005. Nara, Japan, April 2005
Term Rewriting and Applications: Proc./17th International Conference, RTA 2006. Seattle, WA, USA, August 2006
The Hierarchy of Terminating Recursive Programs over N
Timed Process Algebra (With a Focus on Explicit Termination and Relative Timing)
Total Termination of Term Rewriting
Towards a Domain Theory for Termination Proofs
Transforming Acyclic Programs
Tutorial on Termination of Logic Programs
Unfolding the Mystery of Mergesort
Up-to Techniques for Weak Bisimulation
Working Material for the Lectures of E.W. Dijkstrai: International Summer School "Control Flow and Data Flow", Munich, Germany, August, 1984
Working Material for the Lectures of K.R. Apt: International Summer School "Control Flow and Data Flow", Munich, Germany, August, 1984