Filters








4 Hits in 7.7 sec

An extended transformation approach to inductive logic programming

Nada Lavrač, Peter A. Flach
2001 ACM Transactions on Computational Logic  
The main restriction of propositionalization methods such as LINUS is that they are unable to deal with nondeterminate local variables in the body of hypothesis clauses.  ...  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  ... 
doi:10.1145/383779.383781 fatcat:zxmwle4wubaz3jrfamdtyq7jxq

Learning in Clausal Logic: A Perspective on Inductive Logic Programming [chapter]

Peter Flach, Nada Lavrač
2002 Lecture Notes in Computer Science  
Recently, some researchers have started using alternatives to Prolog featuring strong typing and real functions, which alleviate the need for some of the above ad-hoc mechanisms.  ...  Many of the techniques devised by Shapiro, such as top-down search of program clauses by refinement operators, the use of intensional background knowledge, and the capability of inducing recursive clauses  ...  Acknowledgements We thank two anonymous reviewers for their helpful comments.  ... 
doi:10.1007/3-540-45628-7_17 fatcat:i24bt6wv65crjjfybhcm7uwda4

Linear objects: Logical processes with built-in inheritance

Jean-Marc Andreoli, Remo Pareschi
1991 New generation computing  
Journal of Symbolic Logic, 12:1{11, 1947. 81] V. Pratt. Event spaces and their linear  ...  On a version of the constructive predicate calculus without structural rules. Soviet Math. Doklady, 6:416{419, 1965. 80] E.L. Post. Recursive unsolvability of a problem of Thue.  ...  de nition of negation is recursively unsolvable.  ... 
doi:10.1007/bf03037173 fatcat:qhsukwvkdresrlwwu6s2kvvosa

OASIcs, Volume 86, Gabbrielli's Festschrift, Complete Volume [article]

Frank S. de Boer, Jacopo Mauro
2020
Acknowledgements We thank the anonymous reviewers for their detailed suggestions and comments that helped us to improve the presentation of our paper.  ...  Acknowledgements We are very pleased to dedicate this work to Maurizio, whose notable contributions to the theory of programming languages are well known and appreciated by the scientific community.  ...  The method illustrated above gives a quick and easy way to determine the complexity of the attack also in these cases.  ... 
doi:10.4230/oasics.gabbrielli fatcat:quirdjgconeajayodg7uri43x4