Undecidable goals for completed acyclic programs

DOI10.1007/BF03037342zbMath0804.68020MaRDI QIDQ1326578

Jan Keuzenkamp, Marc Bezem

Publication date: 12 January 1995

Published in: New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

logic programmingtheory of computationautomatic theorem provingacyclic programs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The undecidability of the second-order unification problem
• Strong termination of logic programs

This page was built for publication: Undecidable goals for completed acyclic programs