Sciweavers

229 search results - page 13 / 46
» Natural Language Proof Explanation
Sort
View
LPAR
2001
Springer
13 years 11 months ago
A Computer Environment for Writing Ordinary Mathematical Proofs
The EPGY Theorem-Proving Environment is designed to help students write ordinary mathematical proofs. The system, used in a selection of computer-based proof-intensive mathematics ...
David McMath, Marianna Rozenfeld, Richard Sommer
TKDE
2008
125views more  TKDE 2008»
13 years 6 months ago
Discovering and Explaining Abnormal Nodes in Semantic Graphs
An important problem in the area of homeland security is to identify abnormal or suspicious entities in large datasets. Although there are methods from data mining and social netwo...
Shou-de Lin, Hans Chalupsky
ACL
1997
13 years 8 months ago
Co-evolution of Language and of the Language Acquisition Device
A new account of parameter setting during grammatical acquisition is presented in terms of Generalized Categorial Grammar embedded in a default inheritance hierarchy, providing a ...
Ted Briscoe
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 6 months ago
Analytic aspects of the shuffle product
There exist very lucid explanations of the combinatorial origins of rational and algebraic functions, in particular with respect to regular and context free languages. In the searc...
Marni Mishna, Mike Zabrocki
LATINCRYPT
2010
13 years 5 months ago
On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations
We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We...
S. Dov Gordon, Hoeteck Wee, David Xiao, Arkady Yer...