Sciweavers

113 search results - page 2 / 23
» LTL Can Be More Succinct
Sort
View
CONCUR
2001
Springer
13 years 9 months ago
Extended Temporal Logic Revisited
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
ACTA
2010
109views more  ACTA 2010»
13 years 5 months ago
On regular temporal logics with past
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange
CSL
2003
Springer
13 years 10 months ago
Comparing the Succinctness of Monadic Query Languages over Finite Trees
Abstract. We study the succinctness of monadic second-order logic and a variety of monadic fixed point logics on trees. All these languages are known to have the same expressive p...
Martin Grohe, Nicole Schweikardt
CCCG
2008
13 years 6 months ago
Computing Dehn Twists and Geometric Intersection Numbers in Polynomial Time
Simple curves on surfaces are often represented as sequences of intersections with a triangulation. However, there are much more succinct ways of representing simple curves used i...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
KDD
2008
ACM
166views Data Mining» more  KDD 2008»
14 years 5 months ago
Generating succinct titles for web URLs
How can a search engine automatically provide the best and most appropriate title for a result URL (link-title) so that users will be persuaded to click on the URL? We consider th...
Deepayan Chakrabarti, Ravi Kumar, Kunal Punera