22,522 Hits in 2.1 sec

On the utility of predicate invention in inductive logic programming [chapter]

Irene Stahl
1994 Lecture Notes in Computer Science  
We prove that for some restricted languages predicate invention does not help in case that the learning task fails, and characterize the languages for which predicate invention is useful as bias shift  ...  The task of predicate invention in ILP is to extend the hypothesis language with new predicates in case that the vocabulary given initially is insufficient for the learning task.  ...  Extending the given vocabulary with newly invented predicates, for short predicate invention (PI), is one possibility to shift the bias.  ... 
doi:10.1007/3-540-57868-4_64 fatcat:4eocmnkog5e7damzqeb3kcmv5a

Theory reconstruction: a representation learning view on predicate invention [article]

Sebastijan Dumancic and Wannes Meert and Hendrik Blockeel
2016 arXiv   pre-print
Our intention is to start a discussion to define a unifying framework for predicate invention and theory revision.  ...  The intention of this proposal is to bridge the relational and deep learning communities on the problem of predicate invention.  ...  This formulation intends to establish a common ground between relational and deep learning, and start a discussion to define a framework for predicate invention.  ... 
arXiv:1606.08660v2 fatcat:hza2ker7hvgurbbqgcj7abl32m

The appropriateness of predicate invention as bias shift operation in ILP

Irene Stahl
1995 Machine Learning  
We prove that for some restricted languages predicate invention does not help when the learning task fails and we characterize the languages for which predicate invention is useful.  ...  We investigate the decidability of the blas shift problem for these languages and discuss the capabilities of predicate invention as a bias shift operation.  ...  I want to thank Birgit Tausend, Peter Forster and Rüdiger Wirth for reading and commenting on earlier drafts, and Klaus Reinhardt for his inspiring proof ideas.  ... 
doi:10.1007/bf00993476 fatcat:bysxsda7dvbbdhudofo65ppo74

Combining Top-down and Bottom-up Techniques in Inductive Logic Programming [chapter]

John M. Zelle, Raymond J. Mooney, Joshua B. Konvisser
1994 Machine Learning Proceedings 1994  
It also includes a method for predicate invention similar to Champ and an elegant solution to the noisy oracle" problem which allows the system to learn recursive programs without requiring a complete  ...  Systematic experimental comparisons to both Golem and Foil on a range of problems are used to clearly demonstrate the advantages of the approach.  ...  In particular, ablation studies on the speci c utility of predicate invention are indicated.  ... 
doi:10.1016/b978-1-55860-335-6.50049-0 dblp:conf/icml/ZelleMK94 fatcat:z7rpqks46zbgxiixl34ru5i2nu

An extended transformation approach to inductive logic programming

Nada Lavrač, Peter A. Flach
2001 ACM Transactions on Computational Logic  
The proposed approach is illustrated on the "trains" and "mutagenesis" ILP domains.  ...  We are grateful to Nicolas Lachiche for joint work on feature construction in 1BC, to Dragan Gamberger for joint work on irrelevant literal elimination, and to Sašo Džeroski and Marko Grobelnik for the  ...  The work reported in this paper was partially supported by the British Royal Society, the British Council, the Slovenian Ministry of Science and Technology, and the Esprit Framework V project Data Mining  ... 
doi:10.1145/383779.383781 fatcat:zxmwle4wubaz3jrfamdtyq7jxq

Best-effort inductive logic programming via fine-grained cost-based hypothesis generation

Peter Schüller, Mishal Benz
2018 Machine Learning  
The system searches for a hypothesis that entails a single example at a time, utilizing an ASP encoding derived from the encoding used in XHAIL.  ...  The Inspire system iteratively increases the rule cost limit and thereby increases the search space until it finds a suitable hypothesis.  ...  invented predicates).  ... 
doi:10.1007/s10994-018-5708-2 fatcat:4ztmhs333rhqrp5nj6ebfmkcwm

Best-Effort Inductive Logic Programming via Fine-grained Cost-based Hypothesis Generation [article]

Peter Schüller, Mishal Benz
2018 arXiv   pre-print
The system searches for a hypothesis that entails a single example at a time, utilizing an ASP encoding derived from the encoding used in XHAIL.  ...  The Inspire system iteratively increases the rule cost limit and thereby increases the search space until it finds a suitable hypothesis.  ...  Important theoretical foundations of ILP comprise Inverse Resolution and Predicate Invention (Muggleton, 1995; Muggleton and Buntine, 1992) .  ... 
arXiv:1707.02729v2 fatcat:myo4hflazzaalds2vqaanwp4ci

Crowdsourcing program preconditions via a classification game

Daniel Fava, Dan Shapiro, Joseph Osborn, Martin Schäef, E. James Whitehead
2016 Proceedings of the 38th International Conference on Software Engineering - ICSE '16  
We show that Binary Fission players discover concise, general, novel, and human readable program preconditions.  ...  The players have no special expertise in formal methods or programming, and are not specifically aware they are solving verification tasks.  ...  Automated methods rely on search, and expectations to constrain the predicate invention process.  ... 
doi:10.1145/2884781.2884865 dblp:conf/icse/FavaSOSW16 fatcat:3bpdnngzvrfj3f3aqdghq6eoem

Function-oriented Inclusive Design

Markus Modzelewski, Michael Lawo
2014 Position Papers of the 2014 Federated Conference on Computer Science and Information Systems  
New devices are invented as hybrids between existing devices. Products can be individually adapted for end customers.  ...  Although the current product development processes already include contextual information about target customer groups and scenario of use, this information is strongly linked to single devices.  ...  The additional predicate contains the file path of a CAD file is utilized for the next step of template presentation.  ... 
doi:10.15439/2014f36 dblp:conf/fedcsis/ModzelewskiL14 fatcat:xsosq6qvyzbtjl7wfu7ss2kgz4

Page 279 of The Weekly Entertainer, and West of England Miscellany Vol. 8, Issue 194 [page]

1786 The Weekly Entertainer, and West of England Miscellany  
of great importance and extenfive utility.  ...  The axiom from which he fets out, and in which the whole terminates, is, that whatever is predicated of a genus, may be predicated of every {pecies and individual contained under it.  ... 

Page 170 of The Medical Repository Vol. 5, Issue 2 [page]

1801 The Medical Repository  
allegations, to introduce them to the apprehension, and subject them to the most rigid investigation of mankind, it was ey necessary to invent a new language, predicated on the trut of what was thus asserted  ...  discussion, which has already advanced chemistry to a perfection, a dignity, and a utility, 1t could not before have aspired to.  ... 

Human Gaze Assisted Artificial Intelligence: A Review

Ruohan Zhang, Akanksha Saran, Bo Liu, Yifeng Zhu, Sihang Guo, Scott Niekum, Dana Ballard, Mary Hayhoe
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
We provide a high-level overview of the research efforts in these fields, including collecting human gaze data sets, modeling gaze behaviors, and utilizing gaze information in various applications, with  ...  We discuss future challenges and potential applications that work towards a common goal of human-centered artificial intelligence.  ...  The problems with predicate invention are similar to those with feature construction: too many options to invent new predicates and too few options to assess the utility of candidates.  ... 
doi:10.24963/ijcai.2020/678 dblp:conf/ijcai/Kramer20 fatcat:qfqonu7psrcjza3qfntjvpxo7i

Inductive logic programming: Derivations, successes and shortcomings [chapter]

Stephen Muggleton
1993 Lecture Notes in Computer Science  
A new general-purpose, efficient approach to predicate invention is demonstrated. ILP is underconstrained by its logical specification.  ...  Some present limitations and research directions for the field are identified.  ...  The author would like to thank Luc de Raedt for helpful and interesting discussions on the topics in this paper. This work was supported by the Esprit Basic Research Action ILP, project 6020.  ... 
doi:10.1007/3-540-56602-3_125 fatcat:qiqlnb4ohvg4xe52vdtfxeg6o4

Refinement Type Directed Search for Meta-Interpretive-Learning of Higher-Order Logic Programs [article]

Rolf Morel
2021 arXiv   pre-print
space and synthesis time, in terms of the number of typed background predicates.  ...  Additionally we are able to infer polymorphic types of synthesized clauses and of entire programs. The other advancement is in developing an approach to leveraging refinement types in ILP.  ...  Let (B, E) be a MIL input and H a hypothesis. Then a predicate p is an invention if it is in the predicate signature of H and not in the predicate signature of B ∪ E.  ... 
arXiv:2102.12553v1 fatcat:2kzu7fb7efg4no4cqyngzmpvvq

The DLVHEX System

Thomas Eiter, Stefano Germano, Giovambattista Ianni, Tobias Kaminski, Christoph Redl, Peter Schüller, Antonius Weinzierl
2018 Künstliche Intelligenz  
DLVHEX is a solver for HEX that permits cyclic reasoning over external atoms and external value invention.  ...  Consider the following simple example: where the status of some robots is determined by reading and interpreting their battery level.  ...  ](c 1 , . . . , c l ) in rule bodies, where &g is an external predicate, p 1 , . . . , p k are input predicate names or constants, and c 1 , . . . , c l are output terms.  ... 
doi:10.1007/s13218-018-0535-y fatcat:r4cvjqtijvbuhb2pqufomqt5ca
« Previous Showing results 1 — 15 out of 22,522 results