Sciweavers

5499 search results - page 33 / 1100
» Generalized Rewrite Theories
Sort
View
JCC
2002
67views more  JCC 2002»
13 years 7 months ago
Quasi-degenerate perturbation theory with general multiconfiguration self-consistent field reference functions
: The quasi-degenerate perturbation theory (QDPT) with complete active space (CAS) self-consistent field (SCF) reference functions is extended to the general multiconfiguration (MC...
Haruyuki Nakano, Ryuma Uchiyama, Kimihiko Hirao
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
13 years 12 months ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
FMOODS
2003
13 years 9 months ago
A Rewriting Based Model for Probabilistic Distributed Object Systems
Concurrent and distributed systems have traditionally been modelled using nondeterministic transitions over configurations. The minism provides an abstraction over scheduling, net...
Nirman Kumar, Koushik Sen, José Meseguer, G...
JAR
2006
87views more  JAR 2006»
13 years 7 months ago
Elimination Transformations for Associative-Commutative Rewriting Systems
To simplify the task of proving termination and AC-termination of term rewriting systems, elimination transformations have been vigorously studied since the 1990's. Dummy elim...
Keiichirou Kusakari, Masaki Nakamura, Yoshihito To...
JAIR
2012
211views Hardware» more  JAIR 2012»
11 years 10 months ago
Reformulating the Situation Calculus and the Event Calculus in the General Theory of Stable Models and in Answer Set Programming
Circumscription and logic programs under the stable model semantics are two wellknown nonmonotonic formalisms. The former has served as a basis of classical logic based action for...
Joohyung Lee, Ravi Palla