1818 search results - page 11 / 364 » Granularity-Adaptive Proof Presentation |
ECCC
2011
13 years 2 months ago
2011
An input-oblivious proof system is a proof system in which the proof does not depend on the claim being proved. Input-oblivious versions of NP and MA were introduced in passing by...
WOLLIC
2010
Springer
13 years 5 months ago
2010
Springer
We provide a formalisation of the theory of pushdown automata (PDAs) using the HOL4 theorem prover. It illustrates how provers such as HOL can be used for mechanising complicated p...
ITP
2010
13 years 11 months ago
2010
We present a formalisation of separation logic which, by avoiding the use of existential quantifiers, allows proofs that only use standard equational rewriting methods as found in...
CNL
2009
13 years 8 months ago
2009
Abstract. This paper discusses the semi-formal language of mathematics and presents the Naproche CNL, a controlled natural language for mathematical authoring. Proof Representation...
ENTCS
2007
13 years 7 months ago
2007
Most of the state-of-the-art proof assistants are based on procedural proof languages, scripts, and rely on LCF tacticals as the primary tool for tactics composition. In this pape...