Sciweavers

100 search results - page 20 / 20
» A Schemata Calculus for Propositional Logic
Sort
View
ICALP
2004
Springer
13 years 11 months ago
Linear and Branching Metrics for Quantitative Transition Systems
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 6 months ago
Canonical calculi with (n,k)-ary quantifiers
Propositional canonical Gentzen-type systems, introduced in [2], are systems which in addition to the standard axioms and structural rules have only logical rules in which exactly ...
Arnon Avron, Anna Zamansky
CADE
1998
Springer
13 years 10 months ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...
ATVA
2007
Springer
87views Hardware» more  ATVA 2007»
14 years 13 days ago
Latticed Simulation Relations and Games
Multi-valued Kripke structures are Kripke structures in which the atomic propositions and the transitions are not Boolean and can take values from some set. In particular, latticed...
Orna Kupferman, Yoad Lustig
CASC
2006
Springer
128views Mathematics» more  CASC 2006»
13 years 10 months ago
New Domains for Applied Quantifier Elimination
We address various aspects of our computer algebra-based computer logic system redlog. There are numerous examples in the literature for successful applications of redlog to practi...
Thomas Sturm