393 search results - page 46 / 79 » Probabilistic Description Logic Programs |
FLAIRS
2001
15 years 1 months ago
2001
We introduce the graph-based relational concept learner SubdueCL. We start with a brief description of other graph-based learning systems: the Galois lattice, Conceptual Graphs, a...
117
click to vote
SEMWEB
2010
Springer
14 years 10 months ago
2010
Springer
In this paper we present a method for semantic annotation of texts, which is based on a deep linguistic analysis (DLA) and Inductive Logic Programming (ILP). The combination of DLA...
118
click to vote
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
114
Voted
FOSSACS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...
101
click to vote
HYBRID
2010
Springer
15 years 7 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...