503 search results - page 28 / 101 » Interpolative Boolean Logic |
132
click to vote
IDEAS
2002
IEEE
15 years 7 months ago
2002
IEEE
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
125
Voted
FSTTCS
2010
Springer
15 years 15 days ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
125
Voted
POPL
2010
ACM
15 years 2 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
134
Voted
TACAS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
104
click to vote
SAT
2004
Springer
15 years 7 months ago
2004
Springer
Despite the widespread use and study of Boolean satisfiability for a diverse range of problem domains, encoding of problems is usually given to general propositional logic with li...