A refinement calculus for logic programs
From MaRDI portal
Recommendations
Cited in
(27)- A calculus of refinements for program derivations
- A logical calculus for problem solving in highly structured application domains
- The least conjunctive refinement and promotion in the refinement calculus
- Derivation of logic programs by functional methods
- Mints type deductive calculi for logic programming
- General parameterised refinement and recursion for the M-net calculus
- Exits in the refinement calculus
- A Multi-type Calculus for Inquisitive Logic
- Don't care non-determinism in logic program refinement
- The role of logical interpretations in program development
- A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules
- Refinement of Higher-Order Logic Programs
- scientific article; zbMATH DE number 7234173 (Why is no real title available?)
- A Schemata Calculus for Propositional Logic
- scientific article; zbMATH DE number 4033055 (Why is no real title available?)
- scientific article; zbMATH DE number 512961 (Why is no real title available?)
- scientific article; zbMATH DE number 695093 (Why is no real title available?)
- scientific article; zbMATH DE number 1104390 (Why is no real title available?)
- scientific article; zbMATH DE number 1973216 (Why is no real title available?)
- scientific article; zbMATH DE number 1512629 (Why is no real title available?)
- Differential Refinement Logic
- scientific article; zbMATH DE number 1863389 (Why is no real title available?)
- A Logic for Reflective ASMs
- Calculating modules in contextual logic program refinement
- Program Development in Computational Logic
- A theoretical basis for stepwise refinement and the programming calculus
- A logic for schema-based program development
This page was built for publication: A refinement calculus for logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4452605)