79 search results - page 10 / 16 » Splitting Logics |
143
click to vote
CADE
2009
Springer
16 years 4 months ago
2009
Springer
This paper is concerned with the problem of checking whether a given subset of an unsatisfiable Boolean CNF formula takes part in the basic causes of the inconsistency of . More ...
139
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...
116
click to vote
RV
2009
Springer
15 years 10 months ago
2009
Springer
Synthesizing monitor circuits for LTL formulas is expensive, because the number of flip-flops in the circuit is exponential in the length of the formula. As a result, the IEEE st...
PADL
2001
Springer
15 years 8 months ago
2001
Springer
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
114
click to vote
AAAI
2008
15 years 6 months ago
2008
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...