Sciweavers

1061 search results - page 64 / 213
» Dependently Sorted Logic
Sort
View
DLOG
2009
13 years 7 months ago
Relativizing Concept Descriptions to Comparison Classes
Context-sensitivity has been for long a subject of study in linguistics, logic and computer science. Recently the problem of representing and reasoning with contextual knowledge ha...
Szymon Klarman, Stefan Schlobach
VLDB
1992
ACM
116views Database» more  VLDB 1992»
14 years 2 months ago
Supporting Lists in a Data Model (A Timely Approach)
This paper considers the problem of adding list as a type constructor to an object-oriented data model. In particular, we are concerned with how lists in a database can be constru...
Joel E. Richardson
COMMA
2008
13 years 11 months ago
Requirements for reflective argument visualization tools: A Case for Using Validity as a Normative Standard
This paper formulates in the first part some requirements for a certain sort of computational argumentation systems, namely those which are designed for a very specific purpose: to...
Michael H. G. Hoffmann
ESA
2010
Springer
172views Algorithms» more  ESA 2010»
13 years 11 months ago
Algorithmic Meta-theorems for Restrictions of Treewidth
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
Michael Lampis
ADC
2004
Springer
88views Database» more  ADC 2004»
14 years 1 months ago
An Efficient Method for Indexing Now-relative Bitemporal data
Most modern database applications contain a significant amount of time dependent data and a substantial proportion of this data is now-relative, i.e. current now. While much resea...
Bela Stantic, Sankalp Khanna, John Thornton