159 search results - page 19 / 32 » Soft lambda-Calculus: A Language for Polynomial Time Computa... |
115
click to vote
AMW
2010
15 years 5 months ago
2010
Abstract. We study the problem of instance level (ABox) updates for Knowledge Bases (KBs) represented in Description Logics of the DL-Lite family. DLLite is at the basis of OWL 2 Q...
143
click to vote
AAAI
2006
15 years 5 months ago
2006
We present an algorithm that derives actions' effects and preconditions in partially observable, relational domains. Our algorithm has two unique features: an expressive rela...
112
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
149
click to vote
JACM
2010
15 years 2 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
142
Voted
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Refereed conferences require every submission to be reviewed by members of a program committee (PC) in charge of selecting the conference program. There are many software packages...