4617 search results - page 312 / 924 » Automation of Diagrammatic Reasoning |
165
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We describe the formalisation of the normal forms of context-free grammars (CFGs) using the HOL4 theorem prover. These straightforward pen and paper proofs easily understood from t...
176
click to vote
CSL
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. This paper shows undecidability of type-checking and typeinference problems in domain-free typed lambda-calculi with existential types: a negation and conjunction fragmen...
166
click to vote
DLOG
2008
15 years 7 months ago
2008
Following the approaches and motivations given in recent works about action languages over description logics, we propose an action formalism based on a constructive semantics for ...
187
click to vote
CSL
2006
Springer
15 years 6 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
149
click to vote
CSL
2006
Springer
15 years 6 months ago
2006
Springer
This paper describes a hand-written rule-based grapheme-to-phoneme (GTP) conversion system for Korean built within the Festival text-to-speech (TTS) synthesis framework. The core ...