|
|
|
|
| LEADER |
03138nam a2200517 4500 |
| 001 |
978-3-540-44960-7 |
| 003 |
DE-He213 |
| 005 |
20191024061100.0 |
| 007 |
cr nn 008mamaa |
| 008 |
121227s2000 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540449607
|9 978-3-540-44960-7
|
| 024 |
7 |
|
|a 10.1007/3-540-44960-4
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a Q334-342
|
| 072 |
|
7 |
|a UYQ
|2 bicssc
|
| 072 |
|
7 |
|a COM004000
|2 bisacsh
|
| 072 |
|
7 |
|a UYQ
|2 thema
|
| 082 |
0 |
4 |
|a 006.3
|2 23
|
| 245 |
1 |
0 |
|a Inductive Logic Programming
|h [electronic resource] :
|b 10th International Conference, ILP 2000, London, UK, July 24-27, 2000 Proceedings /
|c edited by James Cussens, Alan Frisch.
|
| 250 |
|
|
|a 1st ed. 2000.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2000.
|
| 300 |
|
|
|a X, 262 p.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Artificial Intelligence ;
|v 1866
|
| 505 |
0 |
|
|a Invited Paper -- ILP: Just Do It -- Contributed Papers -- A New Algorithm for Learning Range Restricted Horn Expressions -- A Refinement Operator for Description Logics -- Executing Query Packs in ILP -- A Logical Database Mining Query Language -- Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions -- Extending K-Means Clustering to First-Order Representations -- Theory Completion Using Inverse Entailment -- Solving Selection Problems Using Preference Relation Based on Bayesian Learning -- Concurrent Execution of Optimal Hypothesis Search for Inverse Entailment -- Using ILP to Improve Planning in Hierarchical Reinforcement Learning -- Towards Learning in CARIN-ALN -- Inverse Entailment in Nonmonotonic Logic Programs -- A Note on Two Simple Transformations for Improving the Efficiency of an ILP System -- Searching the Subsumption Lattice by a Genetic Algorithm -- New Conditions for the Existence of Least Generalizations under Relative Subsumption.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
1 |
4 |
|a Artificial Intelligence.
|0 http://scigraph.springernature.com/things/product-market-codes/I21000
|
| 650 |
2 |
4 |
|a Software Engineering/Programming and Operating Systems.
|0 http://scigraph.springernature.com/things/product-market-codes/I14002
|
| 650 |
2 |
4 |
|a Programming Techniques.
|0 http://scigraph.springernature.com/things/product-market-codes/I14010
|
| 700 |
1 |
|
|a Cussens, James.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Frisch, Alan.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783662170038
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540677956
|
| 830 |
|
0 |
|a Lecture Notes in Artificial Intelligence ;
|v 1866
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-44960-4
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 912 |
|
|
|a ZDB-2-BAE
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
