000 03995nam a22005895i 4500
001 978-3-540-30109-7
003 DE-He213
005 20240423130022.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540301097
_9978-3-540-30109-7
024 7 _a10.1007/b10011
_2doi
050 4 _aQA76.758
072 7 _aUMZ
_2bicssc
072 7 _aCOM051230
_2bisacsh
072 7 _aUMZ
_2thema
082 0 4 _a005.1
_223
245 1 0 _aInductive Logic Programming
_h[electronic resource] :
_b14th International Conference, ILP 2004, Porto, Portugal, September 6-8, 2004, Proceedings /
_cedited by Rui Camacho, Ross King, Ashwin Srinivasan.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aIX, 358 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v3194
505 0 _aInvited Papers -- Automated Synthesis of Data Analysis Programs: Learning in Logic -- At the Interface of Inductive Logic Programming and Statistics -- From Promising to Profitable Applications of ILP: A Case Study in Drug Discovery -- Systems Biology: A New Challenge for ILP -- Scaling Up ILP: Experiences with Extracting Relations from Biomedical Text -- Research Papers -- Macro-Operators Revisited in Inductive Logic Programming -- Bottom-Up ILP Using Large Refinement Steps -- On the Effect of Caching in Recursive Theory Learning -- FOIL-D: Efficiently Scaling FOIL for Multi-relational Data Mining of Large Datasets -- Learning an Approximation to Inductive Logic Programming Clause Evaluation -- Learning Ensembles of First-Order Clauses for Recall-Precision Curves: A Case Study in Biomedical Information Extraction -- Automatic Induction of First-Order Logic Descriptors Type Domains from Observations -- On Avoiding Redundancy in Inductive Logic Programming -- Generalization Algorithms for Second-Order Terms -- Circumscription Policies for Induction -- Logical Markov Decision Programs and the Convergence of Logical TD(?) -- Learning Goal Hierarchies from Structured Observations and Expert Annotations -- Efficient Evaluation of Candidate Hypotheses in -log -- An Efficient Algorithm for Reducing Clauses Based on Constraint Satisfaction Techniques -- Improving Rule Evaluation Using Multitask Learning -- Learning Logic Programs with Annotated Disjunctions -- A Simulated Annealing Framework for ILP -- Modelling Inhibition in Metabolic Pathways Through Abduction and Induction -- First Order Random Forests with Complex Aggregates -- A Monte Carlo Study of Randomised Restarted Search in ILP -- Addendum -- Learning, Logic, and Probability: A Unified View.
650 0 _aSoftware engineering.
650 0 _aArtificial intelligence.
650 0 _aComputer programming.
650 0 _aMachine theory.
650 1 4 _aSoftware Engineering.
650 2 4 _aArtificial Intelligence.
650 2 4 _aProgramming Techniques.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aCamacho, Rui.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKing, Ross.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSrinivasan, Ashwin.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540229414
776 0 8 _iPrinted edition:
_z9783662178300
830 0 _aLecture Notes in Artificial Intelligence,
_x2945-9141 ;
_v3194
856 4 0 _uhttps://doi.org/10.1007/b10011
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c184154
_d184154