4940 search results - page 336 / 988 » On the Complexity of Universal Programs |
172
click to vote
LPNMR
2007
Springer
16 years 25 days ago
2007
Springer
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
199
click to vote
FLOPS
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
230
click to vote
IFIP
2001
Springer
15 years 11 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
233
click to vote
ERSHOV
2009
Springer
15 years 10 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
179
click to vote
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...