Sciweavers

915 search results - page 2 / 183
» Proof labeling schemes
Sort
View
87
Voted
ATVA
2009
Springer
149views Hardware» more  ATVA 2009»
15 years 5 months ago
A Decompositional Proof Scheme for Automated Convergence Proofs of Stochastic Hybrid Systems
In this paper, we describe a decompositional approach to convergence proofs for stochastic hybrid systems given as probabilistic hybrid automata. We focus on a concept called “st...
Jens Oehlerking, Oliver E. Theel
99
Voted
JAL
2006
100views more  JAL 2006»
14 years 11 months ago
Distance and routing labeling schemes for non-positively curved plane graphs
Distance labeling schemes are schemes that label the vertices of a graph with short labels in such a way that the distance between any two vertices u and v can be determined effic...
Victor Chepoi, Feodor F. Dragan, Yann Vaxès
AISC
2008
Springer
15 years 28 days ago
A Tactic Language for Hiproofs
Abstract. We introduce and study a tactic language, Hitac, for constructing hierarchical proofs, known as hiproofs. The idea of hiproofs is to superimpose a labelled hierarchical n...
David Aspinall, Ewen Denney, Christoph Lüth
81
Voted
JANCL
2007
74views more  JANCL 2007»
14 years 10 months ago
Operations on proofs and labels
Logic of proofs LP introduced by S. Artemov in 1995 describes properties of proof predicate “t is a proof of F” in the propositional language extended by atoms of the form [[t...
Tatiana Yavorskaya, Natalia Rubtsova
108
Voted
TABLEAUX
2009
Springer
15 years 3 months ago
Proof Search and Counter-Model Construction for Bi-intuitionistic Propositional Logic with Labelled Sequents
Abstract. Bi-intuitionistic logic is a conservative extension of intuitionistic logic with a connective dual to implication, called exclusion. We present a sound and complete cut-f...
Luis Pinto, Tarmo Uustalu