6 citations · 10 across the 5 of their papers we have counts for
5 papers
A Term-Rewriting Semantics for Imperative Style Programming
David Plaisted, Lee Barnett
Term rewriting systems have a simple syntax and semantics and facilitate proofs of correctness. However, they are not as popular in industry or academia as imperative languages. We…
Situation Calculus by Term Rewriting
David A. Plaisted
A version of the situation calculus in which situations are represented as first-order terms is presented. Fluents can be computed from the term structure, and actions on the situa…
Properties and Extensions of Alternating Path Relevance - I
David A. Plaisted
When proving theorems from large sets of logical assertions, it can be helpful to restrict the search for a proof to those assertions that are relevant, that is, closely related to…
A Hierarchical Situation Calculus
David A. Plaisted
A situation calculus is presented that provides a solution to the frame problem for hierarchical situations, that is, situations that have a modular structure in which parts of the…
An Abstract Programming System
David A. Plaisted
The system PL permits the translation of abstract proofs of program correctness into programs in a variety of programming languages. A programming language satisfying certain axiom…