123 search results - page 9 / 25 » The Deduction Theorem for Strong Propositional Proof Systems |
102
click to vote
JAR
2000
14 years 11 months ago
2000
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
FMCAD
2007
Springer
15 years 6 months ago
2007
Springer
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...
ENTCS
2006
14 years 11 months ago
2006
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
CSL
2007
Springer
15 years 6 months ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
STACS
2010
Springer
15 years 6 months ago
2010
Springer
The existence of a (p-)optimal propositional proof system is a major open question in (proof) complexity; many people conjecture that such systems do not exist. Kraj´ıˇcek and P...