1144 search results - page 189 / 229 » Logic programming for combinatorial problems |
WSC
1997
13 years 9 months ago
1997
This paper investigates an attempt to combine different simulation tools in order to build a simulation environment that can be used to model complex system behaviour. The compone...
AAAI
1994
13 years 9 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
There has been much work in recent years on extending ML with recursive modules. One of the most difficult problems in the development of such an extension is the double vision pr...
WLP
1997
Springer
13 years 12 months ago
1997
Springer
eduction strategies for logic programs often use an abstraction operator to guarantee the niteness of the set of goals for which partial deductions are . Findingan abstraction ope...
PLDI
2006
ACM
14 years 1 months ago
2006
ACM
Type systems for secure information flow are useful for efficiently checking that programs have secure information flow. They are, however, conservative, so that they often rej...