A refinement calculus for logic programs
From MaRDI portal
Publication:4452605
DOI10.1017/S1471068402001448zbMATH Open1090.68532MaRDI QIDQ4452605FDOQ4452605
Paul Strooper, Robert Colvin, David Hemer, Ray Nickson, Ian Hayes
Publication date: 1 March 2004
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Recommendations
Cited In (24)
- Calculating modules in contextual logic program refinement
- Title not available (Why is that?)
- A Multi-type Calculus for Inquisitive Logic
- Refinement of Higher-Order Logic Programs
- A Schemata Calculus for Propositional Logic
- Title not available (Why is that?)
- A logic for schema-based program development
- A logical calculus for problem solving in highly structured application domains
- Exits in the refinement calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- The least conjunctive refinement and promotion in the refinement calculus
- Title not available (Why is that?)
- A calculus of refinements for program derivations
- Program Development in Computational Logic
- A theoretical basis for stepwise refinement and the programming calculus
- Differential Refinement Logic
- Title not available (Why is that?)
- A paramodulation-based calculus for refuting schemata of clause sets defined by rewrite rules
- Title not available (Why is that?)
- Derivation of logic programs by functional methods
- A Logic for Reflective ASMs
- Mints type deductive calculi for logic programming
- General parameterised refinement and recursion for the M-net calculus
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)
