Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 30 matches
- 2011
- Paolo Frasconi, Francesca A. Lisi:
Inductive Logic Programming - 20th International Conference, ILP 2010, Florence, Italy, June 27-30, 2010. Revised Papers. Lecture Notes in Computer Science 6489, Springer 2011, ISBN 978-3-642-21294-9 [contents] - 2010
- Tarek Abudawood, Peter A. Flach:
Learning Multi-class Theories in ILP. ILP 2010: 6-13 - Érick Alphonse, Tobias Girschick, Fabian Buchwald, Stefan Kramer:
A Numerical Refinement Operator Based on Multi-Instance Learning. ILP 2010: 14-21 - Laura Antanas, Martijn van Otterlo, José Oramas M., Tinne Tuytelaars, Luc De Raedt:
Not Far Away from Home: A Relational Distance-Based Approach to Understanding Images of Houses. ILP 2010: 22-29 - Stefano Bragaglia, Fabrizio Riguzzi:
Approximate Inference for Logic Programs with Annotated Disjunctions. ILP 2010: 30-37 - Radomír Cernoch, Filip Zelezný:
Speeding Up Planning through Minimal Generalizations of Partially Ordered Plans. ILP 2010: 269-276 - James Cussens:
Approximate Bayesian Computation for the Parameters of PRISM Programs. ILP 2010: 38-46 - Nuno A. Fonseca, Max Pereira, Vítor Santos Costa, Rui Camacho:
Interactive Discriminative Mining of Chemical Fragments. ILP 2010: 59-66 - Bernd Gutmann, Manfred Jaeger, Luc De Raedt:
Extending ProbLog with Continuous Distributions. ILP 2010: 76-91 - Yi Huang, Volker Tresp, Markus Bundschus, Achim Rettinger, Hans-Peter Kriegel:
Multivariate Prediction for Learning on the Semantic Web. ILP 2010: 92-104 - Alberto Illobre, Jorge Gonzalez, Ramón P. Otero, José Santos Reyes:
Learning Action Descriptions of Opponent Behaviour in the Robocup 2D Simulation Environment. ILP 2010: 105-113 - Katsumi Inoue, Andrei Doncescu, Hidetomo Nabeshima:
Hypothesizing about Causal Networks with Positive and Negative Effects by Meta-level Abduction. ILP 2010: 114-129 - Beatriz García Jiménez, Agapito Ledezma, Araceli Sanchis:
MMRF for Proteome Annotation Applied to Human Protein Disease Prediction. ILP 2010: 67-75 - Srihari Kalgi, Chirag Gosar, Prasad Gawde, Ganesh Ramakrishnan, Kekin Gada, Chander Iyer, T. V. S. Kiran, Ashwin Srinivasan:
BET : An Inductive Logic Programming Workbench. ILP 2010: 130-137 - Michael Kifer:
Rule Interchange Format: Logic Programming's Second Wind? ILP 2010: 1 - Ondrej Kuzelka, Filip Zelezný:
Seeing the World through Homomorphism: An Experimental Study on Reducibility of Examples. ILP 2010: 138-145 - Matthieu Lopez, Lionel Martin, Christel Vrain:
Learning Discriminant Rules as a Minimal Saturation Search. ILP 2010: 146-157 - Stephen H. Muggleton, Jianzhong Chen, Hiroaki Watanabe, Stuart J. Dunbar, Charles Baxter, Richard A. Currie, José Domingo Salazar, Jan Taubert, Michael J. E. Sternberg:
Variation of Background Knowledge in an Industrial Application of ILP. ILP 2010: 158-170 - Naveen Nair, Anandraj Govindan, Chander Jayaraman, T. V. S. Kiran, Ganesh Ramakrishnan:
Pruning Search Space for Weighted First Order Horn Clause Satisfiability. ILP 2010: 171-180 - Yusuke Nakano, Nobuhiro Inuzuka:
Multi-relational Pattern Mining Based-on Combination of Properties with Preserving Their Structure in Examples. ILP 2010: 181-189 - Andrej Oblak, Ivan Bratko:
Learning from Noisy Data Using a Non-covering ILP Algorithm. ILP 2010: 190-197 - Niels Pahlavi, Stephen H. Muggleton:
Can HOLL Outperform FOLL? ILP 2010: 198-205 - Avi Pfeffer:
Practical Probabilistic Programming. ILP 2010: 2-3 - David Poole:
Probabilistic Relational Learning and Inductive Logic Programming at a Global Scale. ILP 2010: 4-5 - Luc De Raedt, Ingo Thon:
Probabilistic Rule Learning. ILP 2010: 47-58 - Christophe Rodrigues, Pierre Gérard, Céline Rouveirol:
Incremental Learning of Relational Action Models in Noisy Environments. ILP 2010: 206-213 - Jose Santos, Stephen H. Muggleton:
When Does It Pay Off to Use Sophisticated Entailment Engines in ILP? ILP 2010: 214-221 - Alireza Tamaddoni-Nezhad, Stephen H. Muggleton:
Stochastic Refinement. ILP 2010: 222-237 - David Vaz, Vítor Santos Costa, Michel Ferreira:
Fire! Firing Inductive Rules from Economic Geography for Fire Risk Detection. ILP 2010: 238-252 - Trevor Walker, Ciaran O'Reilly, Gautam Kunapuli, Sriraam Natarajan, Richard Maclin, David Page, Jude W. Shavlik:
Automating the ILP Setup Task: Converting User Advice about Specific Examples into General Background Knowledge. ILP 2010: 253-268
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-06-09 04:46 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint