JSYML
2011
12 years 11 months ago
2011
Abstract. Westudy cut-elimination in first-orderclassical logic. Weconstructa sequenceofpolynomiallength proofs having a non-elementary number of different cut-free normal forms....
IJAC
2010
13 years 1 months ago
2010
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...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
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 ...
TKDE
2002
13 years 4 months ago
2002
IGPL
2002
13 years 4 months ago
2002
The system of natural deduction that originated with Gentzen (1934
ICDE
1992
IEEE
13 years 8 months ago
1992
IEEE
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 ...
MCMASTER
1993
13 years 8 months ago
1993
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...
MFCS
1997
Springer
13 years 8 months ago
1997
Springer
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...
PEPM
1998
ACM
13 years 8 months ago
1998
ACM
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...
KI
2007
Springer
13 years 10 months ago
2007
Springer
The relationship and possible interplay between different knowledge representation and reasoning paradigms is a fundamental topic in artificial intelligence. For expressive knowl...