2911 search results - page 435 / 583 » A Logic of Graph Constraints |
107
Voted
CADE
2004
Springer
15 years 6 months ago
2004
Springer
The paper presents a modular superposition calculus for the combination of first-order theories involving both total and partial functions. Modularity means that inferences are pu...
103
click to vote
FSTTCS
2004
Springer
15 years 6 months ago
2004
Springer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
100
Voted
RSCTC
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper focuses on the use and interpretation of approximate databases where both rough sets and indiscernibility partitions are generalized and replaced by approximat...
ICANN
2009
Springer
15 years 5 months ago
2009
Springer
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
138
Voted
DSVIS
2001
Springer
15 years 5 months ago
2001
Springer
In a time where mobile computing devices and embedded systems gain importance, too much time is spent to reinventing user interfaces for each new device. To enhance future extensib...