183 reputation
5
bio website twitter.com/trylks
location
age
visits member for 1 year, 8 months
seen Mar 30 at 22:08
stats profile views 8

I'm trying to transcend my human limitations.

Thank you for your help, if there is something I can help you about just tell me.

I'm sorry if I did something wrong, rest assured that was not my intention.

If there is anything more you want to know about me, questions are welcome, feel free to ask.


Mar
30
awarded  Scholar
Mar
30
accepted What's the point of $\eta$-conversion in lambda calculus?
Jan
29
awarded  Nice Question
Jan
24
revised Minimize a datalog program
added 33 characters in body
Jan
24
revised Minimize a datalog program
added 926 characters in body
Jan
24
comment Minimize a datalog program
The datalog programs are recursive. The recursive predicates can be binary or unary. I can restrict recursion to unary predicates and then try to check if the solution is applicable to datalog w/ recursive binary predicates, which where causing a lot of trouble anyway. I'm editing the original post to add this and an example, I can link it if that's more readable. I'm currently working on nice looking examples, I hope this is enough (specially without an algorithm). Sorry for the hard question, I really thought this was solved decades ago, now I see it's by far not as simple as I thought.
Jan
20
comment Minimize a datalog program
Edited. I think that's everything. Sorry for not identifying these restrictions before.
Jan
20
revised Minimize a datalog program
added 360 characters in body
Jan
19
comment Minimize a datalog program
I mean the latter. Sorry if the terminology isn't correct. The clauses contain no disjunctions, only an implication and an atom in the head. Alternate definition: clauses are composed by disjunctions (no conjunctions) and there is only one non-negated predicate.
Jan
18
comment Minimize a datalog program
The cycles can be arbitrarily broken if I'm not mistaken, I'll proceed with the implementation, but this is not my only task, so it's going to take a while. Thank you.
Jan
18
comment Minimize a datalog program
After reading the papers I think this doesn't apply. Datalog program containment is undecidable, so I cannot verify the correctness for an arbitrary output, but my output is not arbitrary, if I can proof every step is correct then the result must be correct as well. Some transformations are valid and that (at least) seems fairly provable.
Jan
14
comment Minimize a datalog program
In that case a removed clause could be useful to remove another clause, and the latter would not be removed if the former was removed first. It would be feasible ordering the clauses in a lattice if there were no cycles, but I'm afraid I have cycles. And I guess I'd have to cite the SoA anyway (and that's why I was asking for the terminology).
Jan
14
comment Minimize a datalog program
Thank you for your reply. I think that for non-recursive datalog checking whether two programs are equivalent should be feasible, since all the inferences that can be done are finite and we can compare them after that. I may have other relevant properties in my datalog and I may not be aware of them because overlooked their relevance, so I'll re-analyze that after reading the papers. Tsuyoshi Ito you are right. The subset of the clauses would be referred not only to the original clauses but to the set of clauses that can be deduced from the original program.
Jan
11
comment Minimize a datalog program
If we have a datalog program with the four clauses we can discard the fourth, because it can be derived from the other three.
Jan
10
awarded  Editor
Jan
10
revised Minimize a datalog program
added 25 characters in body
Jan
10
comment Minimize a datalog program
I've updated the original example to contain a conjunction. I thought about the dominator tree, but could not find a good way to apply it either. Sorry if I was unclear about this.
Jan
10
asked Minimize a datalog program
Sep
20
awarded  Teacher
Sep
19
awarded  Student