Deterministic and nondeterministic computation, and horn programs, on abstract data types

DOI10.1016/0743-1066(92)90020-4zbMath0768.68094OpenAlexW2014848011MaRDI QIDQ3992226

Jeffery Zucker, J. V. Tucker

Publication date: 13 August 1992

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-1066(92)90020-4

zbMATH Keywords

semicomputabilityHorn programscomputability over abstract structuresdefinability of relations on abstract structurespartial computable functions

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Applications of universal algebra in computer science (08A70) Abstract data types; algebraic specification (68Q65) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (3)

1997–98 Annual Meeting of the Association for Symbolic Logic ⋮ Theory of computation over stream algebras, and its applications ⋮ Computation by `While' programs on topological partial algebras

This page was built for publication: Deterministic and nondeterministic computation, and horn programs, on abstract data types