3691 search results - page 146 / 739 » Bayesian Logic Programs |
111
Voted
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
103
Voted
ICLP
1995
Springer
15 years 4 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
102
Voted
SLP
1993
15 years 2 months ago
1993
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
131
Voted
ENTCS
2007
15 years 11 days ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
194
Voted
ACMSE
2011
ACM
14 years 24 days ago
2011
ACM
Rising Field Programmable Gate Array (FPGA) market volumes combined with increasing industrial popularity have driven prices down and improved capability to the point that FPGA ha...