Sciweavers

3040 search results - page 277 / 608
» Independent Natural Extension
Sort
View
JSC
2007
58views more  JSC 2007»
15 years 6 months ago
Are Buchberger's criteria necessary for the chain condition?
Buchberger’s Gr¨obner basis theory plays a fundamental role in symbolic computation. The resulting algorithms essentially carry out several S-polynomial reductions. In his PhD ...
Hoon Hong, John Perry
AMAI
2004
Springer
15 years 6 months ago
Multi-Agent Systems Specification and Certification: A Situation and State Calculus Approach
We address the topic of specifying multi-agent systems using the situation and state calculus (SSC). SSC has been proposed as an extension of the situation calculus to overcome so...
Paula Gouveia, Jaime Ramos
JSYML
2007
78views more  JSYML 2007»
15 years 6 months ago
The settling-time reducibility ordering
Abstract. To each computable enumerable (c.e.) set A with a particular enumeration {As}s∈ω, there is associated a settling function mA(x), where mA(x) is the last stage when a n...
Barbara F. Csima, Richard A. Shore
894
Voted
KER
2007
90views more  KER 2007»
15 years 6 months ago
Ontology-based models in pervasive computing systems
Pervasive computing is by its nature open and extensible, and must integrate the information from a diverse range of sources. This leads to a problem of information exchange, so s...
Juan Ye, Lorcan Coyle, Simon Dobson, Paddy Nixon
LISP
2007
112views more  LISP 2007»
15 years 6 months ago
The next 700 Krivine machines
: The Krivine machine is a simple and natural implementation of the normal weak-head reduction strategy for pure λ-terms. While its original description has remained unpublished, ...
Rémi Douence, Pascal Fradet