4192 search results - page 151 / 839 » Probabilistic Logic Programming |
113
Voted
ESWA
2006
15 years 2 months ago
2006
The paper demonstrates the efficient use of hybrid intelligent systems for solving the classification problem of bankruptcy. The aim of the study is to obtain classification schem...
163
Voted
CL
1999
Springer
15 years 2 months ago
1999
Springer
Van Emden's incremental queries address the inadequacy of current Prolog-style querying mechanism in most logic programming systems for interactive problem-solving. In the co...
130
Voted
ICLP
2007
Springer
15 years 8 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
133
click to vote
LOPSTR
2007
Springer
15 years 8 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
152
click to vote
ASIAN
2003
Springer
15 years 7 months ago
2003
Springer
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...