2067 search results - page 69 / 414 » Logics of propositional control |
136
click to vote
CADE
2012
Springer
13 years 4 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
CADE
2008
Springer
16 years 1 months ago
2008
Springer
Bit vectors and bit operations are proposed for efficient propositional inference. Bit arithmetic has efficient software and hardware implementations, which can be put to advantage...
109
click to vote
SOFSEM
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
IGPL
2008
15 years 1 months ago
2008
We study a logic whose formulae are interpreted as properties of a finite set over some universe. The language is propositional, with two unary operators inclusion and extension, ...
107
click to vote
TABLEAUX
2009
Springer
15 years 8 months ago
2009
Springer
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the ...