3454 search results - page 186 / 691 » Modern computer algebra |
210
click to vote
SEMWEB
2009
Springer
15 years 11 months ago
2009
Springer
Abstract—For many tasks, such as the integration of knowledge bases in the semantic web, one must not only handle the knowledge itself, but also characterizations of this knowled...
200
click to vote
AMAST
1991
Springer
15 years 10 months ago
1991
Springer
Boolean logic treats disjunction and conjunction symmetrically and algebraically. The corresponding operations for computation are respectively nondeterminism (choice) and concurr...
183
click to vote
DBPL
1991
Springer
15 years 10 months ago
1991
Springer
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
219
click to vote
SIAMDM
2010
15 years 4 months ago
2010
For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops ...
196
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition co...