Stephanie Spranger

dblp:s/StephanieSpranger · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Computational complexity · 100%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%
Databases, data mining, and information retrieval
1 paper
Data models and query languages · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
temporal reasoning
0.112005
CaTTS: calendar types and constraints for Web applications · WWW 2005
Data models and query languages › schema languages
XML schema
0.112005
CaTTS: calendar types and constraints for Web applications · WWW 2005
Computational complexity
constraint satisfaction
0.112005
CaTTS: calendar types and constraints for Web applications · WWW 2005
Computational complexity › constraint satisfaction › infinite-domain constraint satisfaction
temporal constraint satisfaction
0.112005
CaTTS: calendar types and constraints for Web applications · WWW 2005

Methods — techniques the papers use, named apart from their topics

static type checking · 0.2constraint solving · 0.2
YearPublicationVenuePosition
2005 Calendars and Topologies as Types
François Bry, Bernhard Lorenz, Stephanie Spranger
KES (4)3
2005 CaTTS: calendar types and constraints for Web applications
abstract
Data referring to cultural calendars such as the widespread Gregorian dates but also dates after the Chinese, Hebrew, or Islamic calendars as well as data referring to professional calendars like fiscal years or teaching terms are omnipresent on the Web. Formalisms such as XML Schema have acknowledged this by offering a rather extensive set of Gregorian dates and times as basic data types. This article introduces into CaTTS, the Calendar and Time Type System. CaTTS goes far beyond predefined date and time types after the Gregorian calendar as supported by XML Schema. CaTTS first gives rise to declaratively specify more or less complex cultural or professional calendars including specificities such as leap seconds, leap years, and time zones. CaTTS further offers a tool for the static type checking (of data typed after calendar(s) defined in CaTTS). CaTTS finally offers a language for declaratively expressing and a solver for efficiently solving temporal constraints (referring to calendar(s) expressed in CaTTS). CaTTS complements data modeling and reasoning methods designed for generic Semantic Web applications such as RDF or OWL with methods specific to the particular application domain of calendars and time.
François Bry, Frank-André Rieß, Stephanie Spranger
WWW3