Idioma:

Termination Proofs for Logic Programs

Plümer, Lutz

Texto completo disponível

Citações Citado por

Título:
Termination Proofs for Logic Programs
Autor: Plümer, Lutz
Assuntos: Artificial Intelligence ; Computer Science ; Logic design ; Logics and Meanings of Programs ; Mathematical Logic and Formal Languages ; Programming Languages, Compilers, Interpreters ; Software Engineering
Descrição: Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. But until now there was little hope that termination proofs for nontrivial programs could be achieved automatically. This book gives a comprehensive discussion of the termination problem in the context of logic programming. Although logic programs pose special difficulties for termination proofs it turns out that automation of this task is obtainable to a much larger degree than for programs in imperative languages. A technique for the automatic derivation of termination proofs is presented in detail. The discussion of several nontrivial examples illustrates its range of applicability. The approach is based on the concept of declarative semantics, and thus makes use of an important feature of logic programming.
Títulos relacionados: Lecture Notes in Artificial Intelligence
Editor: Berlin, Heidelberg: Springer Berlin Heidelberg
Data de criação/publicação: 1990
Formato: VIII, 142
Idioma: Inglês

Voltar para lista de resultados

Anterior Resultado 10 Avançar Ir para próxima página