53 search results - page 11 / 11 » Logic Programming with Defaults and Argumentation Theories |
CADE
2001
Springer
14 years 5 months ago
2001
Springer
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
PPDP
2007
Springer
13 years 11 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
OOPSLA
2005
Springer
13 years 10 months ago
2005
Springer
Designing component-based application that meets performance requirements remains a challenging problem, and usually requires a prototype to be constructed to benchmark performanc...