999 search results - page 109 / 200 » On the Decidability of Functional Uncertainty |
MWCN
2004
Springer
14 years 2 months ago
2004
Springer
In Mobile Ad Hoc Networks (MANETs), each node has the capacity to act as a router. The performance of the MANET relies on how well the nodes perform this function. In simulations,...
DEXAW
2003
IEEE
14 years 2 months ago
2003
IEEE
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite univers...
TPHOL
2003
IEEE
14 years 2 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
DALT
2009
Springer
14 years 1 months ago
2009
Springer
We continue the work initiated in [1–3], where the acceptance logic, a modal logic for modelling individual and collective acceptances was introduced. This logic is aimed at capt...
IWANN
2001
Springer
14 years 1 months ago
2001
Springer
Complexity-penalization strategies are one way to decide on the most appropriate network size in order to address the trade-off between overfitted and underfitted models. In this p...