Case-free programs: An abstraction of definite horn programs
From MaRDI portal
Recommendations
- Publication:4205083
- Deterministic and nondeterministic computation, and horn programs, on abstract data types
- Intensional Kleene and Rice theorems for abstract program semantics
- Calculus of equivalences of abstract programs
- scientific article; zbMATH DE number 2090546
- Horn clause solvers for program verification
- Recursive programs and denotational semantics in absolute logics of programs
- On recursion-free Horn clauses and Craig interpolation
- A simple functional presentation and an inductive correctness proof of the Horn algorithm
- Horn clauses as an intermediate representation for program analysis and transformation
Cites work
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 3986671 (Why is no real title available?)
- scientific article; zbMATH DE number 4026795 (Why is no real title available?)
- scientific article; zbMATH DE number 4061192 (Why is no real title available?)
- scientific article; zbMATH DE number 3568056 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- Mechanical Theorem-Proving by Model Elimination
- Near-Horn prolog and beyond
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
- Non-Horn clause logic programming without contrapositives
Cited in
(2)
This page was built for publication: Case-free programs: An abstraction of definite horn programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488524)