3845 search results - page 145 / 769 » Belief Logic Programming |
IPPS
1999
IEEE
15 years 2 months ago
1999
IEEE
In order for parallel logic programming systems to become popular, they should serve the broadest range of applications. To achieve this goal, designers of parallel logic programm...
ESWA
2006
14 years 10 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...
108
click to vote
CL
1999
Springer
14 years 9 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...
ICLP
2007
Springer
15 years 4 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...
LOPSTR
2007
Springer
15 years 4 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...