A computable semantics for general logic programs
From MaRDI portal
Publication:4730755
DOI10.1016/0743-1066(89)90017-4zbMath0681.68024OpenAlexW2035077417MaRDI QIDQ4730755
No author found.
Publication date: 1989
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(89)90017-4
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Artificial intelligence (68T99) Many-valued logic (03B50)
Related Items (2)
Definite clause programs are canonical (over a suitable domain) ⋮ Protected completions of first-order general logic programs
This page was built for publication: A computable semantics for general logic programs