Sciweavers

1076 search results - page 18 / 216
» Operations on proofs and labels
Sort
View
BIRTHDAY
2003
Springer
14 years 23 days ago
A Hierarchical Completeness Proof for Propositional Temporal Logic
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
Ben C. Moszkowski
AAI
2010
94views more  AAI 2010»
13 years 2 months ago
Sequence-Indexed Linear-Time Temporal Logic: Proof System and Application
In this paper, we propose a proof system for reasoning on certain specifications of secure authentication systems. For this purpose, a new logic, sequence-indexed linear-time temp...
Ken Kaneiwa, Norihiro Kamide
IJCAI
1997
13 years 8 months ago
Automation of Diagrammatic Reasoning
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...
Mateja Jamnik, Alan Bundy, Ian Green
TSE
2010
110views more  TSE 2010»
13 years 5 months ago
Proofs from Tests
We present an algorithm Dash to check if a program P satisfies a safety property ϕ. The unique feature of the algorithm is that it uses only test generation operations, and nes ...
Nels E. Beckman, Aditya V. Nori, Sriram K. Rajaman...
DM
2007
119views more  DM 2007»
13 years 7 months ago
Short proofs for cut-and-paste sorting of permutations
We consider the problem of determining the maximum number of moves required to sort a permutation of [n] using cut-and-paste operations, in which a segment is cut out and then pas...
Daniel W. Cranston, Ivan Hal Sudborough, Douglas B...