scientific article; zbMATH DE number 4125019

zbMATH Open0686.68045MaRDI QIDQ4205083FDOQ4205083

Authors: John V. Tucker, Jeffery Zucker 

Publication date: 1989

Title of this publication is not available (Why is that?)

Recommendations

• Deterministic and nondeterministic computation, and horn programs, on abstract data types
• scientific article
• On computability by logic programs
• An external approach to abstract data types. I: Computability on abstract data type
• Abstract computability and algebraic specification

zbMATH Keywords

abstract data typesmany-sorted algebraalgebraic specificationGeneralized Church-Turing ThesisHorn clause computability

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Data structures (68P05) Artificial intelligence (68T99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Algebraic structures (08A99)

Cited In (12)

• PROJECTIONS OF SEMICOMPUTABLE RELATIONS ON ABSTRACT DATA TYPES
• Theory of computation over stream algebras, and its applications
• Case-free programs: An abstraction of definite horn programs
• Title not available (Why is that?)
• Horn logic, search and satisfiability. A collection of papers in memory of Robert G. Jeroslow
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deterministic and nondeterministic computation, and horn programs, on abstract data types
• Computability by means of effectively definable schemes and definability via enumerations
• Title not available (Why is that?)
• Title not available (Why is that?)
• A compositional semantic basis for the analysis of equational Horn programs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4205083)