Sciweavers

780 search results - page 144 / 156
» Reasoning about sets using redescription mining
Sort
View
143
Voted
ECAI
2010
Springer
15 years 4 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
172
Voted
CSL
2007
Springer
15 years 9 months ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ï...
Arnold Beckmann
SIGMOD
2006
ACM
111views Database» more  SIGMOD 2006»
16 years 3 months ago
Reconciling while tolerating disagreement in collaborative data sharing
In many data sharing settings, such as within the biological and biomedical communities, global data consistency is not always attainable: different sites' data may be dirty,...
Nicholas E. Taylor, Zachary G. Ives
149
Voted
SIGSOFT
2008
ACM
16 years 4 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren
133
Voted
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 5 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...