1226 search results - page 68 / 246 » Proofs, Programs and Abstract Complexity |
117
click to vote
CORR
2000
Springer
15 years 3 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
134
Voted
STOC
1993
ACM
15 years 7 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
137
click to vote
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
Ensuring correctness of software by formal methods is a very relevant and widely studied problem. Automatic verification of software using model checkers from the state space exp...
147
click to vote
FLOPS
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. We present a declarative method for diagnosing missing computed answers in CFLP(D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instant...
138
click to vote
ICTCS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Non-interference is a desirable property of systems in a multilevel security architecture, stating that confidential information is not disclosed in public output. The c...