6978 search results - page 139 / 1396 » On Proofs in System P |
148
click to vote
LOGCOM
2010
15 years 4 months ago
2010
Abstract. An approximate Herbrand theorem is established for firstorder infinite-valued Lukasiewicz Logic and used to obtain a proof-theoretic proof of Skolemization. These resul...
172
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We prove an exponential lower bound for tree-like Cutting Planes refutations of a set of clauses which has polynomial size resolution refutations. This implies an exponential sepa...
164
click to vote
PERVASIVE
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. A logic-based language is often adopted in systems for pervasive computing, because it provides a convenient way to define rules that change the behavior of the systems d...
164
click to vote
RE
2004
Springer
15 years 11 months ago
2004
Springer
Aspect-oriented software development (AOSD) techniques support systematic modularization and composition of crosscutting concerns. Though AOSD techniques have been proposed to han...
165
click to vote
CADE
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction appl...