Sciweavers

2214 search results - page 204 / 443
» Complexity of Reasoning
Sort
View
ER
2010
Springer
132views Database» more  ER 2010»
15 years 1 months ago
Full Satisfiability of UML Class Diagrams
UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constraints expr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
131
Voted
DLOG
2009
15 years 1 months ago
A Matter of Principles: Towards the Largest DLP Possible
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
Markus Krötzsch, Sebastian Rudolph
157
Voted
FI
2011
146views more  FI 2011»
14 years 10 months ago
A Service Oriented Architecture for Personalized Universal Media Access
: Multimedia streaming means delivering continuous data to a plethora of client devices. Besides the actual data transport, this also needs a high degree of content adaptation resp...
Sascha Tönnies, Benjamin Köhncke, Patric...
SOFSEM
2012
Springer
13 years 11 months ago
Recent Challenges and Ideas in Temporal Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
Orna Kupferman
164
Voted
TMC
2012
13 years 6 months ago
A Statistical Mechanics-Based Framework to Analyze Ad Hoc Networks with Random Access
—Characterizing the performance of ad hoc networks is one of the most intricate open challenges; conventional ideas based on information-theoretic techniques and inequalities hav...
Sunil Srinivasa, Martin Haenggi