3358 search results - page 283 / 672 » Dynamic Description Logics |
180
click to vote
FROCOS
2007
Springer
16 years 1 months ago
2007
Springer
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...
213
click to vote
ILP
2007
Springer
16 years 1 months ago
2007
Springer
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
161
click to vote
ISMIS
2003
Springer
16 years 1 days ago
2003
Springer
We discuss how mobile agents, moving in the Internet from node to node, can communicate with each other by forwarding messages in a robust way. As a solution, we present the genera...
192
click to vote
PPDP
1999
Springer
15 years 11 months ago
1999
Springer
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
174
click to vote
ECSQARU
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...