58 search results - page 9 / 12 » Progress in the Development of Automated Theorem Proving for... |
LOPSTR
1997
Springer
13 years 11 months ago
1997
Springer
Schema-based program transformation [8] has been proposed as an effective technique for the optimisation of logic programs. Schemata are applied to a logic program, mapping ineffi...
PADL
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. Modern web forms interact with the user in real-time by detecting errors and filling-in implied values, which in terms of automated reasoning amounts to SAT solving and ...
CSL
2004
Springer
14 years 1 months ago
2004
Springer
Locality notions in logic say that the truth value of a formula can be determined locally, by looking at the isomorphism type of a small neighborhood of its free variables. Such n...
TAP
2010
Springer
13 years 5 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
Relational databases have had great industrial success in computer science. The power of the paradigm is made clear both by its widespread adoption and by theoretical analysis. Tod...