140 search results - page 20 / 28 » Some Varieties of Equational Logic |
103
Voted
VMCAI
2009
Springer
15 years 8 months ago
2009
Springer
—A variety of partial modeling formalisms, aimed re and reason about abstractions, have been proposed. Some, e.g., Kripke Modal Transition Systems (KMTSs) put strong restrictions...
145
Voted
CEC
2011
IEEE
14 years 1 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
143
click to vote
PEPM
2011
ACM
14 years 4 months ago
2011
ACM
Navigating through tree structures is a core operation in tree processing programs. Most notably, XML processing programs intensively use XPath, the path specification language t...
192
Voted
PODS
2009
ACM
16 years 2 months ago
2009
ACM
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
157
click to vote
KBSE
2003
IEEE
15 years 7 months ago
2003
IEEE
Physics-based animation programs can often be modeled in terms of hybrid automata. A hybrid automaton includes both discrete and continuous dynamical variables. The discrete varia...