725 search results - page 85 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
136
click to vote
LICS
2005
IEEE
15 years 11 months ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
168
click to vote
SEMWEB
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We study the problem of evolution for Knowledge Bases (KBs) expressed in Description Logics (DLs) of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the t...
177
click to vote
PLDI
2004
ACM
15 years 11 months ago
2004
ACM
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
158
click to vote
ENTCS
2002
15 years 5 months ago
2002
In this paper we present a framework to program autonomous robots in the declarative multi-paradigm language Curry. This is an experiment to use high-level declarative programming...
165
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...