2944 search results - page 384 / 589 » On Well Quasi-orders on Languages |
157
click to vote
BPM
2008
Springer
15 years 8 months ago
2008
Springer
Business processes can be very large and may contain several different concerns, scattered across the process and tangled with other concerns. Crosscutting concerns are difficult t...
194
click to vote
CADE
2008
Springer
15 years 8 months ago
2008
Springer
LogAnswer is an open domain question answering system which employs an automated theorem prover to infer correct replies to natural language questions. For this purpose LogAnswer o...
139
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
163
click to vote
AMAST
2006
Springer
15 years 8 months ago
2006
Springer
We present DO-Casl, a new member of the CASL family of specification languages. It is an extension of Casl-Ltl and it supports a methodology for conveniently writing loose specific...
181
click to vote
ASPDAC
2005
ACM
15 years 8 months ago
2005
ACM
– Clocking is an essential component of any embedded system design. However, traditional design techniques are either short of clocking support or too complex for users. The Unif...