150 search results - page 13 / 30 » Understanding Promise Theory Using Rewriting Logic |
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
ECIS
2004
14 years 10 months ago
2004
This paper explores the use of two complementary approaches, each stemming from Personal Construct Theory (PCT), to investigate the interdependence of organizations and informatio...
RML
2002
14 years 9 months ago
2002
The development of the Semantic Web proceeds in layers. Currently the most advanced layer that has reached maturity is the ontology layer, in the form of the DAML+OIL language whic...
JOT
2010
14 years 7 months ago
2010
A theory, graphical notation, mathematical calculus and implementation for finding whether two given expressions can, at execution time, denote references attached to the same obj...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...