3470 search results - page 590 / 694 » Head-Elementary-Set-Free Logic Programs |
COCOON
2003
Springer
14 years 3 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...
GECCO
2003
Springer
14 years 3 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...
ISSS
2002
IEEE
14 years 3 months ago
2002
IEEE
We propose a high-level analytical model for estimating the energy and/or power dissipation in VLSI processor (systolic) array implementations of loop programs, particularly for i...
CL
2000
Springer
14 years 2 months ago
2000
Springer
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
ICML
2008
IEEE
14 years 11 months ago
2008
IEEE
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...