73 search results - page 3 / 15 » Tight Bounds on the Descriptional Complexity of Regular Expr... |
IJCAI
2007
13 years 9 months ago
2007
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive quer...
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
MMB
2010
Springer
14 years 8 days ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
We propose an extension of the syntactic restriction for complex role inclusion axioms in the description logic SROIQ. Like the original restriction in SROIQ, our restrictions can ...
IJCAI
2007
13 years 9 months ago
2007
Integrating description logics (DL) and logic programming (LP) would produce a very powerful and useful formalism. However, DLs and LP are based on quite different principles, so ...