4573 search results - page 422 / 915 » Automated Reasoning |
175
click to vote
ICLP
1997
Springer
15 years 11 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
165
click to vote
ICLP
1997
Springer
15 years 11 months ago
1997
Springer
Hybrid Probabilistic Programs (HPPs) are logic programs that allow the programmer to explicitly encode his knowledge of the dependencies between events being described in the prog...
153
click to vote
ICLP
1997
Springer
15 years 11 months ago
1997
Springer
We introduce and explore a property of deductive data bases with updates wich we call total homeostaticity, and which substantially generalizes the following their property: ”fo...
200
click to vote
ILP
1997
Springer
15 years 11 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
200
click to vote
LOPSTR
1997
Springer
15 years 11 months ago
1997
Springer
Synthesis of logic programs is considered as a special instance of logic programming. We describe experience made within a logical metaprogramming environment whose central compone...