Sciweavers

6978 search results - page 363 / 1396
» On Proofs in System P
Sort
View
186
Voted
AML
2002
36views more  AML 2002»
15 years 6 months ago
Shelah's stability spectrum and homogeneity spectrum in finite diagrams
We present Saharon Shelah's Stability Spectrum and Homogeneity Spectrum theorems, as well as the equivalence between the order property and instability in the framework of Fin...
Rami P. Grossberg, Olivier Lessmann
LOGCOM
2010
88views more  LOGCOM 2010»
15 years 5 months ago
Tableaux for Public Announcement Logic
Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In thi...
Philippe Balbiani, Hans P. van Ditmarsch, Andreas ...
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
16 years 6 days ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe
AADEBUG
1993
Springer
15 years 11 months ago
Slicing Programs with Arbitrary Control-flow
Program slicing is a program transformation that is useful in program debugging, program maintenance, and other applications that involve understanding program behavior. Given a p...
Thomas Ball, Susan Horwitz
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 8 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su