838 search results - page 50 / 168 » From Natural Language to Formal Proof Goal |
161
click to vote
EACL
2003
ACL Anthology
15 years 7 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
164
click to vote
FM
2001
Springer
15 years 10 months ago
2001
Springer
The Irish School of Constructive Mathematics (M♣ c ), which extends the VDM, exploits an algebraic notation based upon monoids and their morphisms for the purposes of abstract mo...
213
click to vote
TOPLAS
2002
15 years 5 months ago
2002
We present an efficient encoding of core Java constructs in a simple, implementable typed intermediate language. The encoding, after type erasure, has the same operational behavio...
149
click to vote
LREC
2010
15 years 7 months ago
2010
Grammars play an important role in many Natural Language Processing (NLP) applications. The traditional approach to creating grammars manually, besides being labor-intensive, has ...
164
click to vote
LREC
2010
15 years 7 months ago
2010
Ontology-based semantic annotation aims at putting fragments of a text in correspondence with proper elements of an ontology such that the formal semantics encoded by the ontology...