Titlebook: Inductive Logic Programming; 11th International C Céline Rouveirol,Michéle Sebag Conference proceedings 2001 Springer-Verlag Berlin Heidelb

enterprise

A Refinement Operator for Theories, due to the commutativity of refinement operations while preserving weak completeness as well as a limited form of flexibility. The refinement operator presented in this paper represents a first step towards constructing more efficient and . ILP systems with precise theoretical guarantees.

社团

Glucose

Discovering Associations between Spatial Objects: An ILP Application,atial objects. It operates on a deductive relational database set up by selecting and transforming data stored in the underlying spatial database. Preliminary experimental results have been obtained by running SPADA on geo-referenced census data of Manchester Stockport, UK.

喷出

-Subsumption in a Constraint Satisfaction Perspective, this region has been shown of utmost relevance to ILP [.]. Experiments on artificial .-subsumption problems designed to illustrate the phase transition phenomenon, show that . is faster by several orders of magnitude than previous .-subsumption algorithms, within and outside the PT region.

方舟

ss .: improving over common numerical approaches yielding exponential sequential time or parallel polynomial time. Our results build on efficient algorithms and their analyses for real polynomial, matrix and operator powering which do not occur in the discrete case and may be of independent interest

恶意

nerve-sparing

Rodrigo Basilio,Gerson Zaverucha,Valmir C. Barbosaunning time ., that is, they are . with the parameter .. One of our main subroutines to obtain these algorithms is an . algorithm for . edge connected ., which could be of an independent interest. Finally, we also show that such an algorithm is not possible for ..

Forsake

Agnès Braud,Christel Vrainractically solvable problems and the practically unsolvable ones partially reminds of the never-ending search for the definition of “life” in biology or for the definitions of matter and energy in physics. Can the search for the formal notion of “practical solvability” also become a never-ending sto

词根词缀法

Martin Eineborg,Henrik Boströme, we show that generating all vertices of a polyhedron, given by its facets, is NP-complete (while the complexity status is still open in case of the polytopes, that is, bounded polyhedra). This problem is reduced to generating all negative cycles of a weighted digraph, which is NP-complete (for gr

小故事