4617 search results - page 878 / 924 » Automation of Diagrammatic Reasoning |
124
click to vote
CADE
2005
Springer
16 years 2 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
135
click to vote
CADE
2004
Springer
16 years 2 months 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...
114
click to vote
CADE
2001
Springer
16 years 2 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...
132
click to vote
CADE
2009
Springer
15 years 8 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 ...
142
click to vote
WOLLIC
2009
Springer
15 years 8 months ago
2009
Springer
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...