2018 search results - page 6 / 404 » Code Normal Forms |
113
click to vote
JELIA
2010
Springer
14 years 10 months 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...
105
click to vote
CSL
2007
Springer
15 years 5 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...
ICFP
2003
ACM
15 years 11 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...
CDC
2008
IEEE
15 years 6 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...
JCT
2008
14 years 11 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...