Normal form (abstract rewriting)

Known as: Normal form, Normal form (formal languages), Normal form (term rewriting) 
In abstract rewriting, an object is in normal form if it cannot be rewritten any further. Depending on the rewriting system and the object, several… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1956-2017
05010019562016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
Noncooperative game theory is one of a handful of fundamental frameworks used for economic modeling. It is therefore troubling… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
This article takes a first step towards the design and normalization theory for XML documents. We show that, like relational… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A generalized state realization of the Wiberg type is called normal if symbol variables have degree 1 and state variables have… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 9
Is this relevant?
Highly Cited
2001
Highly Cited
2001
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented… (More)
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We present here decidable approximations of sets of descendants and sets of normal forms of Term Rewriting Systems, based on… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The purpose of good database logical design is to eliminate data redundancy and isertion and deletion anomalies. In order to… (More)
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We show that the duality of a pair of monotone disjunctive normal forms of size n can be tested in n oŽlog n. 
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We establish some fundamental facts for infinitary orthogonal term rewriting systems (OTRSs): for strongly convergent reductions… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
A new type of dependency, which includes the well-known functional dependencies as a special case, is defined for relational… (More)
  • table I
  • table III
  • table IV
  • table V
Is this relevant?
Highly Cited
1960
Highly Cited
1960
The hope that mathematical methods employed in the investigation of formal logic would lead to purely computational methods for… (More)
Is this relevant?