1582 search results - page 180 / 317 » On Higher-Order Description Logics |
131
click to vote
MLG
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
ROBOCUP
1999
Springer
15 years 2 months ago
1999
Springer
In this paper, we present a multi-layered architecture for spatial and temporal agents. The focus is laid on the declarativity of the approach, which makes agent scripts expressive...
109
click to vote
AMAI
2004
Springer
14 years 10 months ago
2004
Springer
Prototyping is a valuable technique to help software engineers explore the design space while gaining insight on the dynamics of the system. In this paper, we describe a method for...