4192 search results - page 158 / 839 » Probabilistic Logic Programming |
176
click to vote
ILP
2005
Springer
15 years 12 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
176
click to vote
WCRE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—The principles and best practices of object oriented design require that modules in a program should match logical decomposition of the knowledge that the program implem...
175
click to vote
ICLP
1999
Springer
15 years 10 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
164
click to vote
TACS
2001
Springer
15 years 10 months ago
2001
Springer
We give a logic programming language based on Fiore, Plotkin and Turi’s binding algebras. In this language, we can use not only first-order terms but also terms involving variab...
215
click to vote
PLPV
2012
ACM
14 years 1 months ago
2012
ACM
Functional Reactive Programming (FRP) is a form of reactive programming whose model is pure functions over signals. FRP is often expressed in terms of arrows with loops, which is ...