This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
Abstract. Westudy cut-elimination in first-orderclassical logic. Weconstructa sequenceofpolynomiallength proofs having a non-elementary number of different cut-free normal forms....
We explicitly construct Markov languages of normal forms for the groups in the title of the paper and closely related groups. A Markov language of normal forms is a choice of &quo...
Uniqueness of normal forms (UN= ) is an important property of term rewrite systems. UN= is decidable for ground (i.e., variable-free) systems and undecidable in general. Recently ...
Contrary to popular belief, relation schemes in good classical normal forms are not necessarily devoid of redundancies. This arises from the fact that classical data dependencies ...
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
Abstract. We use a code generator--type-directed partial evaluation-to verify conversions between isomorphic types, or more precisely to verify that a composite function is the ide...
The relationship and possible interplay between different knowledge representation and reasoning paradigms is a fundamental topic in artificial intelligence. For expressive knowl...