Strong termination of logic programs
From MaRDI portal
Publication:4036282
DOI10.1016/0743-1066(93)90014-8zbMath0787.68016OpenAlexW2059709382MaRDI QIDQ4036282
Publication date: 16 May 1993
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/26249
Related Items
Undecidable goals for completed acyclic programs, Correctness and Completeness of Logic Programs, Negation as failure for disjunctive logic programming, A logical semantics for depth-first Prolog with ground negation, On Completeness of Logic Programs, On Correctness and Completeness of an n Queens Program, Logic + control: On program construction and verification, Fast offline partial evaluation of logic programs, Proving completeness of logic programs with the cut, \(\exists\)-Universal termination of logic programs, Totally correct logic program transformations via well-founded annotations, Loop checking in SLD-derivations by well-quasi-ordering of goals, Left termination turned into termination, Automated modular termination proofs for real Prolog programs
