4573 search results - page 845 / 915 » Automated Reasoning |
115
click to vote
CADE
2004
Springer
16 years 5 days ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
CADE
2001
Springer
16 years 5 days 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...
110
click to vote
CADE
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. The problem of computing Craig interpolants in SMT has recently received a lot of interest, mainly for its applications in formal verification. Efficient algorithms for ...
ECSQARU
2009
Springer
15 years 6 months ago
2009
Springer
sing Attacks to Attacks in Abstract Argumentation Frameworks Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, and Giovanni Guida Dipartimento di Elettronica per l’Automazi...
LPNMR
2007
Springer
15 years 6 months 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...