325 search results - page 20 / 65 » Proofs of Restricted Shuffles |
158
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
203
click to vote
AMAST
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. This paper introduces matching logic, a novel framework for defining axiomatic semantics for programming languages, inspired from operational semantics. Matching logic sp...
140
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
122
click to vote
CTRS
1990
15 years 10 months ago
1990
A new positive-unit theorem-proving procedure for equational Horn clauses is presented. It uses a term ordering to restrict paxamodulation to potentiallymaximal sides of equations...
188
click to vote
TPHOL
2008
IEEE
16 years 12 days ago
2008
IEEE
g to the well-known “LCF approach” of secure inferences as abstract datatype constructors in ML [16]; explicit proof terms are also available [8]. Isabelle/Isar provides sophis...