3047 search results - page 118 / 610 » On the Meaning of Logical Completeness |
100
click to vote
CICLING
2007
Springer
15 years 4 months ago
2007
Springer
Semantic parsing is the task of mapping a natural language sentence into a complete, formal meaning representation. Over the past decade, we have developed a number of machine lear...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
In connection with machine arithmetic, we are interested in systems of constraints of the form x + k y + k . Over integers, the satisfiability problem for such systems is polynomi...
AML
2002
14 years 9 months ago
2002
Abstract. It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbe...
101
click to vote
CASES
2005
ACM
14 years 12 months ago
2005
ACM
The concurrent synchronous language Esterel allows proto treat reactive systems in an abstract, concise manner. An Esterel program is typically first translated into other, non-s...
JFP
2000
14 years 9 months ago
2000
In this paper we present two type inference systems for detecting useless-code in higher-order typed functional programs. Type inference can be performed in an efficient and compl...