151
click to vote
FOIKS
2006
Springer
15 years 7 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
148
click to vote
FOIKS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...
119
click to vote
FOIKS
2006
Springer
15 years 7 months ago
2006
Springer
The Nested List Normal Form is proposed as a syntactic normal form for semantically well-designed database schemata obtained from any arbitrary finite nesting of records and lists....
135
click to vote
FOIKS
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is on query modification: ...
126
Voted
FOIKS
2006
Springer
15 years 7 months ago
2006
Springer
