977 search results - page 149 / 196 » Logic programming with infinite sets |
115
Voted
COCOON
2003
Springer
15 years 5 months ago
2003
Springer
We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as...
104
Voted
GECCO
2003
Springer
15 years 5 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...
100
Voted
TLDI
2005
ACM
15 years 6 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
AGP
1999
IEEE
15 years 4 months ago
1999
IEEE
We address the problem of complementing higher-order patterns without repetitions of free variables. Differently from the first-order case, the complement of a pattern cannot, in ...
111
Voted
JCP
2006
15 years 14 days ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...