Sciweavers

16 search results - page 3 / 4
» A New n-ary Existential Quantifier in Description Logics
Sort
View
DLOG
2001
13 years 9 months ago
Using Lazy Unfolding for the Computation of Least Common Subsumers
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...
Anni-Yasmin Turhan, Ralf Molitor
SYNTHESE
2008
71views more  SYNTHESE 2008»
13 years 7 months ago
Formalizing common sense: an operator-based approach to the Tibbles-Tib problem
The paper argues, that a direct formalization of the way common sense thinks about the numerical identity of enduring entities, requires that traditional predicate logic is develo...
Ingvar Johansson
CSL
2006
Springer
13 years 11 months ago
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
Lukasz Kaiser
CONSTRAINTS
2007
83views more  CONSTRAINTS 2007»
13 years 7 months ago
Generic Incremental Algorithms for Local Search
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...
Magnus Ågren, Pierre Flener, Justin Pearson
ICFP
2002
ACM
14 years 7 months ago
Typing dynamic typing
Even when programming in a statically typed language we every now and then encounter statically untypable values; such values result from interpreting values or from communicating...
Arthur I. Baars, S. Doaitse Swierstra