Sciweavers

10715 search results - page 123 / 2143
» Proofs from Tests
Sort
View
112
Voted
DCG
2010
146views more  DCG 2010»
15 years 27 days ago
An Elementary Deduction of the Topological Radon Theorem from Borsuk-Ulam
Abstract. The Topological Radon Theorem states that, for every continuous function from the boundary of a (d + 1)-dimensional simplex into Rn , there exist a pair of disjoint faces...
Craig R. Guilbault
TPHOL
2007
IEEE
15 years 9 months ago
Extracting Purely Functional Contents from Logical Inductive Types
We propose a method to extract purely functional contents from logical inductive types in the context of the Calculus of Inductive Constructions. This method is based on a mode con...
David Delahaye, Catherine Dubois, Jean-Fréd...
KRDB
2001
110views Database» more  KRDB 2001»
15 years 4 months ago
Path Constraints from a Modal Logic Point of View
We analyze several classes of path constraints for semistructured data in a unified framework and prove some decidability and complexity results for these constraints by embedding...
Natasha Alechina, Stéphane Demri, Maarten d...
DFG
2009
Springer
15 years 10 months ago
Models of Non-atomic Congestion Games - From Unicast to Multicast Routing
Abstract. We give an overview of important results for non-atomic congestion games in their traditional form along with self-contained and short proofs and then present new results...
Lasse Kliemann, Anand Srivastav
156
Voted
LICS
2008
IEEE
15 years 10 months ago
From Axioms to Analytic Rules in Nonclassical Logics
We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent inference rules in sequent and hypersequent calculi. This allows for the automat...
Agata Ciabattoni, Nikolaos Galatos, Kazushige Teru...