Sciweavers

503 search results - page 4 / 101
» Interpolative Boolean Logic
Sort
View
ENTCS
2008
126views more  ENTCS 2008»
13 years 11 months ago
Admissibility of Cut in Coalgebraic Logics
We study sequent calculi for propositional modal logics, interpreted over coalgebras, with admissibility of cut being the main result. As applications we present a new proof of th...
Dirk Pattinson, Lutz Schröder
ENTCS
2007
119views more  ENTCS 2007»
13 years 10 months ago
Interpolant Learning and Reuse in SAT-Based Model Checking
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
João Marques-Silva
SLP
1993
117views more  SLP 1993»
14 years 5 days ago
Boolean Constraint Solving Using clp(FD)
We present a boolean constraint logic language clp(B/FD) built upon a language over finite domains clp(FD) which uses a local propagation constraint solver. It is based on a sing...
Philippe Codognet, Daniel Diaz
RELMICS
1998
Springer
14 years 3 months ago
Coping with semilattices of relations in logics with relative accessibility relations
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...
Stéphane Demri