3793 search results - page 420 / 759 » Expressive Description Logics |
184
click to vote
MKM
2007
Springer
16 years 26 days ago
2007
Springer
An axiomatic theory represents mathematical knowledge declaratively as a set of axioms. An algorithmic theory represents mathematical knowledge procedurally as a set of algorithms....
221
click to vote
DALT
2005
Springer
16 years 8 days ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
230
click to vote
CADE
1998
Springer
15 years 11 months ago
1998
Springer
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
174
click to vote
CAISE
2009
Springer
15 years 10 months ago
2009
Springer
Despite the abundance of analysis techniques to discover control-flow errors in workflow designs, there is hardly any support for w verification. Most techniques simply abstract fr...
157
click to vote
CDB
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...