681 search results - page 104 / 137 » Combining Theorem Proving with Natural Language Processing |
TAPSOFT
1991
Springer
15 years 1 months ago
1991
Springer
Abstract. CBS is a simple and natural CCS-like calculus where processes speak one at a time and are heard instantaneously by all others. Speech is autonomous, contention between sp...
AAAI
1994
14 years 11 months ago
1994
We introduce a new framework for the study of reasoning. The Learning (in order) to Reason approach developed here views learning as an integral part of the inference process, and ...
75
Voted
CLEF
2008
Springer
14 years 11 months ago
2008
Springer
ParaMor, our unsupervised morphology induction system performed well at Morpho Challenge 2008. When ParaMor's morphological analyses, which specialize at identifying inflecti...
108
click to vote
ESWS
2010
Springer
14 years 8 months ago
2010
Springer
Recent work in Ontology learning and Text mining has mainly focused on engineering methods to solve practical problem. In this thesis, we investigate methods that can substantially...
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
Final coalgebras for a functor serve as semantic domains for state based systems of various types. For example, formal languages, streams, nonwell-founded sets and behaviors of CCS...