GSoC final results #94
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
* develop: Add torrent files with all proofs used in the experiments
…ressor/package.scala Relates to Issues Paradoxika#79 and Paradoxika#76
… from root node and implement corresponding versions of Subsumption algorithms
relates to Issue Paradoxika#77
…undant parameters
ancestors were not computed correctly
New replace traversal checks if current node has unit clause as subclause instead of comparing to pivot elements. Also dagifies the proof on the way.
…ents and move pebbling algorithm Proof now can take a permutation map for premises as input. The measure method of the proof package object can now can measure the pebbling of a proof. Pebbling is now in at.logic.scala.algorithm.compressor and the apply method returns a proof.
… use a single traversal
…orderings representing different heuristics
…existing split algorithms
…sumption check faster
|
Paradoxika » Skeptik #82 FAILURE |
|
Paradoxika » Skeptik #83 FAILURE |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This is the pull request of my results of the Google Summer of Code 2013.
The main results are Subsumption, Recursive Split and Pebbling algorithms.
Besides that small changes in other classes are made.
For example the proof class got a new constructor, to use a specific topological order for constructing the indexed node set.