Questions tagged [inductive-logic-programming]
10 questions
2
votes
1 answer
How to generate negative examples in inductive logic programming?
I am trying to learn rules of puzzles and board games by observing a human using inductive logic programming. I use PROGOL which is a program for ILP written in Prolog. While for some games it is able to correctly give me the rules, for some others…

web_ninja
- 2,351
- 3
- 22
- 43
1
vote
1 answer
Is it possible to write a "zipAll" function for scala inductive list (shapeless.HList in scala 2 or Tuple in scala 3)?
To this date, the "zip" function in HList works like zip function or untyped List in scala. It will discard elements from the longer operand to be conformant to the shorter element:
val a = 1 :: 2 :: 3 :: HNil
val b = 4 :: 5 ::…

tribbloid
- 4,026
- 14
- 64
- 103
1
vote
0 answers
Data to function: What data would have to be passed to minikanren to get eval?
There is a video where minikanren is used to go from data to programs. That is, given data, it generates the program that generates the data.
So is it possible to generate a universal function such as eval? What data would have to be passed to it?

X10D
- 600
- 2
- 13
1
vote
0 answers
Good inductive logic programming system
Can you recommend a inductive logic programming system? Preferably one that uses Prolog syntax. Are there systems that do predicate invention and learning recursive rules? I am somewhat familiar with Aleph and Prolog. What is the state of the…
user3170496
0
votes
1 answer
Found a constructor of inductive type bool while a constructor of list is expected
I have the following question : Define the fonction value : list bool -> nat that return the value represented by a list of booleans(binary number to decimal number). For example, value [false;true;false;true] = 10.
I wrote this:
Fixpoint value (l:…

Alice
- 15
- 3
0
votes
1 answer
Inductive proposition for sublists in Coq
I am struggling with coming up with a notion of sublist of a list, which is created by deleting elements in the list (so that the order is preserved). I need to come up with an inductive proposition that decides if l1 is a sublist of l2.
So far:
I…

TexasRattleSnake
- 3
- 1
0
votes
2 answers
how can i prove the following algorithm?
Exp(n)
If n = 0
Return 1
End If
If n%2==0
temp = Exp(n/2)
Return temp × temp
Else //n is odd
temp = Exp((n−1)/2)
Return temp × temp × 2
End if
how can i prove by strong induction in n that for all n ≥ 1, the…

Alexander
- 1
- 1
0
votes
1 answer
How to get a theory by using Aleph with SWI-Prolog
I'm trying to get a theory by using the Aleph inductive logic programming system with SWI-Prolog (SWI-Prolog Pack)
My code is
:- use_module(library(aleph)).
:- if(current_predicate(use_rendering/1)).
:- use_rendering(prolog).
:- endif.
:- aleph.
:-…

Victor
- 13
- 2
0
votes
1 answer
Not getting a theory in Aleph for SWI Prolog
I'm trying to get Aleph to work and induce a simple theory: grandparent(X,Z):- father(X, Y), father(Y, Z). However i get back an atom (e.g. grandparent(john,johnJuniorJunior)). Hope somebody can help. Note that Aleph for SWI uses a single file as…
user3170496
0
votes
1 answer
How to generate arff file from ACE
I am using the ACE data mining package https://dtai.cs.kuleuven.be/ACE/doc/ACEuser-1.2.16.pdf which uses inductive logic programming.
I am using WARMR to find frequent queries.
In the manual it has a command 'generate_arff' but this command does…

user27815
- 4,767
- 14
- 28