Sciweavers

3040 search results - page 259 / 608
» Independent Natural Extension
Sort
View
LPAR
2005
Springer
16 years 9 days ago
Termination of Fair Computations in Term Rewriting
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
Salvador Lucas, José Meseguer
OOPSLA
2005
Springer
16 years 8 days ago
Using predicate fields in a highly flexible industrial control system
Predicate fields allow an object’s structure to vary at runtime based on the object’s state: a predicate field is present or not, depending on the values of other fields. P...
Shay Artzi, Michael D. Ernst
PCI
2005
Springer
16 years 8 days ago
Routing and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
Stratis Ioannidis, Christos Nomikos, Aris Pagourtz...
FSTTCS
2004
Springer
16 years 5 days ago
Verifying Probabilistic Procedural Programs
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
Javier Esparza, Kousha Etessami
KR
2004
Springer
16 years 5 days ago
Improving the Forward Chaining Algorithm for Conceptual Graphs Rules
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
Jean-François Baget