756 search results - page 127 / 152 » Using Logic Programs to Reason about Infinite Sets |
CINQ
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
AAAI
1990
13 years 9 months ago
1990
Programs such as Bacon, Abacus, Coper, Kepler and others are designed to find functional relationships of scientific significance in numerical data without relying on the deep dom...
KBSE
2010
IEEE
13 years 6 months ago
2010
IEEE
Decision procedures have long been a fixture in program analysis, and reasoning about string constraints is a key element in many program analyses and testing frameworks. Recent ...
LOPSTR
2009
Springer
14 years 3 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
AGENTS
2001
Springer
14 years 29 days ago
2001
Springer
We present and implement an infrastructure for automating the negotiation of business contracts. Underlying our system is a declarative language for both (1) fully-specified, exe...