Sciweavers

Share
JSYML
2011
84views more  JSYML 2011»
8 years 5 months ago
On the non-confluence of cut-elimination
Abstract. Westudy cut-elimination in first-orderclassical logic. Weconstructa sequenceofpolynomiallength proofs having a non-elementary number of different cut-free normal forms....
Matthias Baaz, Stefan Hetzl
IJAC
2010
76views more  IJAC 2010»
8 years 7 months ago
Normal Forms for Automorphisms of Universal Coxeter Groups and Palindromic Automorphisms of Free Groups
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...
Adam Piggott, Kim Ruane
FSTTCS
2010
Springer
8 years 8 months ago
Uniqueness of Normal Forms is Decidable for Shallow Term Rewrite Systems
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 ...
Nicholas Radcliffe, Rakesh M. Verma
IGPL
2002
80views more  IGPL 2002»
8 years 10 months ago
Ultimate Normal Forms for Parallelized Natural Deductions
The system of natural deduction that originated with Gentzen (1934
Neil Tennant
ICDE
1992
IEEE
126views Database» more  ICDE 1992»
9 years 2 months ago
Logical Database Design with Inclusion Dependencies
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 ...
Tok Wang Ling, Cheng Hian Goh
MCMASTER
1993
9 years 2 months ago
A Taste of Rewrite Systems
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...
Nachum Dershowitz
MFCS
1997
Springer
9 years 2 months ago
When are Two Rewrite Systems More than None?
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...
Nachum Dershowitz
PEPM
1998
ACM
9 years 2 months ago
Type-Directed Partial Evaluation
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...
Olivier Danvy
KI
2007
Springer
9 years 4 months ago
Description Logic Programs: Normal Forms
The relationship and possible interplay between different knowledge representation and reasoning paradigms is a fundamental topic in artificial intelligence. For expressive knowl...
Pascal Hitzler, Andreas Eberhart
books