1717 search results - page 149 / 344 » A Computable Spectral Theorem |
132
Voted
SAT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
143
click to vote
MFCS
2005
Springer
15 years 10 months ago
2005
Springer
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
156
click to vote
TYPES
2004
Springer
15 years 10 months ago
2004
Springer
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
138
click to vote
EKAW
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. In this paper we study dynamic properties of knowledge-based systems. We argue the importance of such dynamic properties for the construction and analysis of knowledge-ba...
123
click to vote
FM
1994
Springer
15 years 8 months ago
1994
Springer
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...