2018 search results - page 6 / 404 » Code Normal Forms |
147
Voted
JELIA
2010
Springer
15 years 19 days ago
2010
Springer
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbirary the...
120
Voted
CSL
2007
Springer
15 years 8 months ago
2007
Springer
Normal form bisimulation is a powerful theory of program equivalence, originally developed to characterize L´evy-Longo tree equivalence and Boehm tree equivalence. It has been ada...
106
Voted
ICFP
2003
ACM
16 years 2 months ago
2003
ACM
All classical -terms typable with disjunctive normal forms are shown to share a common computational behavior: they implement a local exception handling mechanism whose exact work...
89
Voted
CDC
2008
IEEE
15 years 8 months ago
2008
IEEE
— We give geometrical conditions, which guarantee the existence of a diffeomorphism in order to transform a nonlinear system without inputs into a canonical normal form depending...
114
click to vote
JCT
2008
15 years 2 months ago
2008
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...