681 search results - page 39 / 137 » Combining Theorem Proving with Natural Language Processing |
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
14 years 9 months ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
102
click to vote
ICMI
2010
Springer
14 years 7 months ago
2010
Springer
Identifying verbally and non-verbally referred-to objects is an important aspect of human-robot interaction. Most importantly, it is essential to achieve a joint focus of attentio...
125
click to vote
ICLP
2011
Springer
14 years 1 months ago
2011
Springer
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
WWW
2010
ACM
15 years 4 months ago
2010
ACM
We present a tool for helping XML schema designers to obtain a high quality level for their specifications. The tool allows one to analyze relations between classes of XML docume...
106
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak ...