gleiss / saturation-visualization Goto Github PK
View Code? Open in Web Editor NEWA visualization tool, which enables an efficient and interactive analysis of Vampire proof attempts.
A visualization tool, which enables an efficient and interactive analysis of Vampire proof attempts.
remove each node which is not in nodes and doesn't have a transitive parent node which is in nodes.
We use different visual representations for different nodes, e.g. for hidden nodes, nodes from preprocessing, theory axioms, ...
It would be good if we have an enum of all the possible representations (hidden, preprocessing, theoryAxiom, passive, active, maybe other stuff in the future).
We then can refactor the main functionality of get_layout into two sub-methods:
remove each node which is not in nodes and is not a transitive parents of a node in nodes.
remove each node which is never active and is not transitive parent of any node which is active at some point.
Add a button to the find/select block, which selects all common consequences of a set of selected nodes.
Given a set of ids, one can get the id of common consequences using the findCommonConsequences()-method already implemented in the file search.py.
Makes it possible to click through the search result.
Similar to the already existing "select parents"-button, but for selecting children.
The children-ids of a node can be obtained using the already implemented children()-method from the Dag-class.
remove each node which is either a theory axiom or only derived from theory axioms.
Our nodes should correspond to clauses, together with the following information:
We want to change the Node-class accordingly:
The right column of the tool currently contains two blocks of functionality:
We want to add a third block, which displays information (name, number and inference) about the currently selected node (if exactly one node is selected).
(Later this third block will also get functionality to change how the node is displayed)
Would be great to display the name of the uploaded file as I use multiple tabs with different vampire outputs to compare!
Would be great to parse --proof_extra full to display age and weight of a selected clause in the graph.
Currently get_layout uses the node-id to determine whether it should display the node or not.
We want to change this to:
currently width changes depending on width of search results
The proof output is a series of events, where each event has one of the following forms:
where Clause is of the form
We want to parse these events into the modified Node-class.
To compute passiveTime and activeTime, we should use a counter which tracks the number of already parsed passive and active lines / events.
The user should be able to highlight certain nodes using a checkbox, which is located in the third block of the right column.
Highlighted nodes could be colored e.g. red or orange.
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.