Sciweavers

188 search results - page 21 / 38
» Logic of Proofs for Bounded Arithmetic
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 6 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
KI
2010
Springer
14 years 6 months ago
Differential Dynamic Logics
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equa...
André Platzer
98
Voted
POPL
2010
ACM
15 years 9 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
ICLP
1997
Springer
15 years 3 months ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
LCC
1994
209views Algorithms» more  LCC 1994»
15 years 3 months ago
On Herbrand's Theorem
We firstly survey several forms of Herbrand's theorem. What is commonly called "Herbrand's theorem" in many textbooks is actually a very simple form of Herbrand...
Samuel R. Buss