130 search results - page 16 / 26 » The road to two theorems of logic |
111
click to vote
FMCAD
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We relate two well-studied methodologies in deductive verification of operationally modeled sequential programs, namely the use of inductive invariants and clock functio...
111
click to vote
AGP
1995
IEEE
15 years 3 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
CADE
2004
Springer
16 years 6 days ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
TASE
2009
IEEE
15 years 6 months ago
2009
IEEE
A modelling language can be defined by a metamodel in UML class diagram. This paper defines the semantics of such metamodels through two mappings: a signature mapping from metamod...
102
click to vote
BIRTHDAY
1997
Springer
15 years 4 months ago
1997
Springer
We compare the expressive power on finite models of two extensions of first order logic L with equality. L(Ct) is formed by adding an operator count{x : ϕ}, which builds a term ...