157 search results - page 8 / 32 » Formal Probabilistic Analysis: A Higher-Order Logic Based Ap... |
KCAP
2003
ACM
14 years 1 months ago
2003
ACM
Modularity is a key requirement for large ontologies in order to achieve re-use, maintainability, and evolution. Mechanisms for ‘normalisation’ to achieve analogous aims are s...
JCST
2010
13 years 3 months ago
2010
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
EKAW
2004
Springer
14 years 1 months ago
2004
Springer
Abstract In this paper we describe a general logic-enabled Formal Concept Analysis (FCA) approach to manage patient record instances. In particular, the conceptual model of the dom...
ICFP
2005
ACM
14 years 8 months ago
2005
ACM
We present a foundation for a computational meta-theory of languages with bindings implemented in a computer-aided formal reasoning environment. Our theory provides the ability to...
ICMLA
2009
13 years 6 months ago
2009
Languages that combine predicate logic with probabilities are needed to succinctly represent knowledge in many real-world domains. We consider a formalism based on universally qua...