3738 search results - page 573 / 748 » Parametrized Logic Programming |
104
click to vote
AAAI
1994
15 years 1 months ago
1994
or untagged treebanks. ' When trained on an untagged This paper presents a method for constructing deterministic Prolog parsers from corpora of parsed sentences. Our approach ...
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
114
Voted
CNL
2009
15 years 1 months ago
2009
Abstract. This paper discusses the semi-formal language of mathematics and presents the Naproche CNL, a controlled natural language for mathematical authoring. Proof Representation...
91
Voted
CORR
2008
Springer
15 years 17 days ago
2008
Springer
Abstract. Data exchanges between Web services engaged in a composition raise several heterogeneities. In this paper, we address the problem of data cardinality heterogeneity in a c...
89
Voted
ENTCS
2008
15 years 16 days ago
2008
We present a system of refinement types for LF in the style of recent formulations where only canonical forms are well-typed. Both the usual LF rules and the rules for type refine...