3513 search results - page 120 / 703 » Super Logic Programs |
67
Voted
ECSQARU
1997
Springer
15 years 2 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 ...
122
Voted
PTS
2010
14 years 8 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...
80
Voted
ILP
2000
Springer
15 years 1 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...
125
Voted
ECOWS
2006
Springer
15 years 1 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...
87
Voted
IPPS
2002
IEEE
15 years 3 months ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...