Results 1  10
of
3,572
Writing PVS proof strategies
 Design and Application of Strategies/Tactics in Higher Order Logics (STRATA 2003), number CP2003212448 in NASA Conference Publication
, 2003
"... Abstract. PVS (Prototype Verification System) is a comprehensive framework for writing formal logical specifications and constructing proofs. An interactive proof checker is a key component of PVS. The capabilities of this proof checker can be extended by defining proof strategies that are similar t ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. PVS (Prototype Verification System) is a comprehensive framework for writing formal logical specifications and constructing proofs. An interactive proof checker is a key component of PVS. The capabilities of this proof checker can be extended by defining proof strategies that are similar
Proof Strategies in Linear Logic
 JOURNAL OF AUTOMATED REASONING
, 1994
"... Linear logic, introduced by J.Y.Girard, is a refinement of classical logic providing means for controlling the allocation of "resources". It has aroused considerable interest both from proof theorists and computer scientists. In this paper we investigate methods for automated theorem prov ..."
Abstract

Cited by 26 (2 self)
 Add to MetaCart
proving in propositional linear logic. Both the "bottomup" and "topdown" (resolution) proof strategies are analyzed  various modifications of sequent rules and efficient search strategies are presented along with the experiments performed with the implemented theorem provers.
The Mechanization of the Diagonalization Proof Strategy
 FACHBEREICH INFORMATIK, UNIVERSITAT DES SAARLANDES, IM STADTWALD
, 1996
"... We present an empirical study of mathematical proofs by diagonalization, the aim is their mechanization based on proof planning techniques. We show that these proofs can be constructed according to a strategy that (i) finds an indexing relation, (ii) constructs a diagonal element, and (iii) makes th ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present an empirical study of mathematical proofs by diagonalization, the aim is their mechanization based on proof planning techniques. We show that these proofs can be constructed according to a strategy that (i) finds an indexing relation, (ii) constructs a diagonal element, and (iii) makes
A graphical language for proof strategies
 In LPAR, volume 8312 of LNCS
, 2013
"... Abstract. Complex automated proof strategies are often difficult to extract, visualise, modify, and debug. Traditional tactic languages, often based on stackbased goal propagation, make it easy to write proofs that obscure the flow of goals between tactics and are fragile to minor changes in input ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. Complex automated proof strategies are often difficult to extract, visualise, modify, and debug. Traditional tactic languages, often based on stackbased goal propagation, make it easy to write proofs that obscure the flow of goals between tactics and are fragile to minor changes
StrategyProofness and Arrow’s Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions
 J. Econ. Theory
, 1975
"... Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I pro ..."
Abstract

Cited by 553 (0 self)
 Add to MetaCart
Consider a committee which must select one alternative from a set of three or more alternatives. Committee members each cast a ballot which the voting procedure counts. The voting procedure is strategyproof if it always induces every committee member to cast a ballot revealing his preference. I
Towards Automated Proof Strategy Generalisation
 CoRR
"... The ability to automatically generalise (interactive) proofs and use such generalisations to discharge related conjectures is a very hard problem which remains unsolved; this paper shows how we hope to make a start on solving this problem. We develop a notion of goal types to capture key propertie ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
erties of goals, which enables abstractions over the specific order and number of subgoals arising when composing tactics. We show that the goal types form a lattice, and utilise this property in the techniques we develop to automatically generalise proof strategies in order to reuse it for proofs of related
Predicate transformation as a proof strategy
 COMPUTING SCIENCE DEPARTMENT, UNIVERSITY OF NIJMEGEN
, 2002
"... A verification strategy implementing precondition generation is presented. It automatically constructs a weak precondition for the statements of a Java subset. The strategy uses the rules of an underlying Hoare logic. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A verification strategy implementing precondition generation is presented. It automatically constructs a weak precondition for the statements of a Java subset. The strategy uses the rules of an underlying Hoare logic.
Completeness Proof Strategies for Euler Diagram Logics
"... Abstract. Visual logics based on Euler diagrams have recently been developed, including generalized constraint diagrams and concept diagrams. Establishing the metatheories of these logics includes providing completeness proofs where possible. Completeness has been established for such logics, includ ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
, including Euler diagrams, spider diagrams and a fragment of the constraint diagram logic. In this paper, we identify commonality in their completeness proof strategies, showing how, as expressiveness increases, the strategy readily extends. We identify a fragment of concept diagrams and demonstrate
Building and Executing Proof Strategies in a Formal Metatheory
 ADVANCES IN ARTIFICAL INTELLIGENCE: PROCEEDINGS OF THE THIRD CONGRESS OF THE ITALIAN ASSOCIATION FOR ARTIFICIAL INTELLIGENCE, IA*AI'93, VOLUME 728 OF LECTURE NOTES IN COMPUTER SCIENCE
, 1993
"... This paper describes how "safe" proof strategies are represented and executed in the interactive theorem prover GETFOL. A formal metatheory (MT) describes and allows to reason about object level inference. A class of MT terms, called logic tactics, is used to represent proof strategies. ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
This paper describes how "safe" proof strategies are represented and executed in the interactive theorem prover GETFOL. A formal metatheory (MT) describes and allows to reason about object level inference. A class of MT terms, called logic tactics, is used to represent proof strategies
Results 1  10
of
3,572