4513 search results - page 167 / 903 » Logic programming with satisfiability |
134
click to vote
LPKR
1997
Springer
15 years 7 months ago
1997
Springer
In this overview we show how Knowledge Representation (KR) can be done with the help of generalized logic programs. We start by introducing the core of PROLOG, which is based on de...
124
Voted
ESOP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
116
Voted
ECSQARU
1997
Springer
15 years 7 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 ...
119
Voted
ILP
2000
Springer
15 years 7 months ago
2000
Springer
First-order probabilistic models are recognized as efficient frameworks to represent several realworld problems: they combine the expressive power of first-order logic, which serv...
181
Voted
ECOWS
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we present an approach to hybrid semantic web service matching based on both logic programming, and syntactic similarity measurement. The implemented matchmaker, ca...