977 search results - page 12 / 196 » Logic programming with infinite sets |
122
Voted
ANNPR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
128
click to vote
AGP
2003
IEEE
15 years 5 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
197
Voted
ICLP
2009
Springer
16 years 1 months ago
2009
Springer
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...
131
click to vote
CORR
2010
Springer
15 years 14 days ago
2010
Springer
We introduce streaming data string transducers that map input data strings to output data strings in a single left-to-right pass in linear time. Data strings are (unbounded) seque...