150 search results - page 14 / 30 » Understanding Promise Theory Using Rewriting Logic |
113
click to vote
PODS
1991
ACM
15 years 28 days ago
1991
ACM
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
157
click to vote
POPL
2007
ACM
15 years 9 months ago
2007
ACM
It is well recognized that JavaScript can be exploited to launch browser-based security attacks. We propose to battle such attacks using program instrumentation. Untrusted JavaScr...
114
click to vote
ICDT
2010
ACM
15 years 23 days ago
2010
ACM
Stochastic context-free grammars (SCFGs) have long been recognized as useful for a large variety of tasks including natural language processing, morphological parsing, speech reco...
IJCAI
2003
14 years 10 months ago
2003
A promising technique used in some planning systems to improve their performance is the use of domain dependent search control knowledge. We present a procedure for compiling sear...
FAC
2008
14 years 9 months ago
2008
Substitution is fundamental to the theory of logic and computation. Is substitution something that we define on syntax on a case-by-case basis, or can we turn the idea of substitut...