Sciweavers

835 search results - page 49 / 167
» Geometric Logic in Computer Science
Sort
View
MFCS
2005
Springer
14 years 2 months ago
The Complexity of Model Checking Higher Order Fixpoint Logic
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
Martin Lange, Rafal Somla
SIGCSE
2009
ACM
139views Education» more  SIGCSE 2009»
14 years 9 months ago
Abstraction and extensibility in digital logic simulation software
ion and Extensibility in Digital Logic Simulation Software Richard M. Salter and John L. Donaldson Computer Science Department Oberlin College Oberlin, OH 44074 rms@cs.oberlin.edu,...
Richard M. Salter, John L. Donaldson
WOLLIC
2010
Springer
14 years 19 days ago
A CTL-Based Logic for Program Abstractions
sed Logic for Program Abstractions Martin Lange1 and Markus Latte2 1 Dept. of Computer Science, University of Kassel, Germany 2 Dept. of Computer Science, Ludwig-Maximilians-Univer...
Martin Lange, Markus Latte
TARK
1992
Springer
14 years 23 days ago
Topological Reasoning and The Logic of Knowledge
We present a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The most natural interpretation of the logi...
Lawrence S. Moss, Rohit Parikh
WG
2004
Springer
14 years 2 months ago
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...
Tim Nieberg, Johann Hurink, Walter Kern