700 search results - page 90 / 140 » On Termination of Constraint Logic Programs |
92
Voted
GECCO
2003
Springer
15 years 4 months ago
2003
Springer
This paper proposes a method for dealing with numerical attributes in inductive concept learning systems based on genetic algorithms. The method uses constraints for restricting th...
173
click to vote
POPL
2004
ACM
15 years 11 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
72
Voted
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
100
click to vote
CADE
2002
Springer
15 years 11 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
127
click to vote
WOA
2004
15 years 15 days ago
2004
Abstract-- In this paper we present the communication architecture of the DALI Logic Programming Agent-Oriented language and we discuss its semantics. We have designed a meta-level...