58 search results - page 5 / 12 » Resolution Proof Systems with Weak Transformation Rules |
CG
2004
Springer
13 years 7 months ago
2004
Springer
We provide a formal proof of equivalence between the class of fractals created by Recursive Turtle Programs (RTP) and Iterated Affine Transformations (IAT). We begin by reviewing ...
FOSSACS
2010
Springer
14 years 2 months ago
2010
Springer
Leftist grammars [Motwani et al., STOC 2000] are special semi-Thue systems where symbols can only insert or erase to their left. We develop a theory of leftist grammars seen as wor...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
IEE
2007
13 years 7 months ago
2007
Software development techniques are continuously evolving with the goal of solving the main problems that still affect the building and maintenance of software systems: time, cost...
JAIR
2007
13 years 7 months ago
2007
Exact Max-SAT solvers, compared with SAT solvers, apply little inference at each node of the proof tree. Commonly used SAT inference rules like unit propagation produce a simpliï¬...