Figure 4
Source publication
Automated Theorem Proving (ATP) is an established branch of Artificial
Intelligence. The purpose of ATP is to design a system which can automatically
figure out an algorithm either to prove or disprove a mathematical claim, on
the basis of a set of given premises, using a set of fundamental postulates and
following the method of logical inference....
Similar publications
My Ph.D. dissertation written under the supervision of Prof. Tomasz Placek at the Institute of Philosophy of the Jagiellonian University in Kraków.
In one of its most basic and informal shapes, the principle of the common cause states that any surprising correlation between two factors which are believed not to directly influence one another is du...
We introduce MSO graph storage types, and call a storage type MSO-expressible if it is isomorphic to some MSO graph storage type. An MSO graph storage type has MSO-definable sets of graphs as storage configurations and as storage transformations. We consider sequential automata with MSO graph storage and associate with each such automaton a string...
Model checkers use automated state exploration in order to prove various
properties such as reachability, non-reachability, and bisimulation over state
transition systems. While model checkers have proved valuable for locating
errors in computer models and specifications, they can also be used to prove
properties that might be consumed by other com...
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in many areas of mathematics and computing, researchers usually fall back to point-wise reasoning when it comes to...
Graph embedding is an important technique that maps a logical graph into a host graph, usually an interconnection network. In this paper, we compute the exact wirelength of embedding Christmas trees into trees. Moreover, we present an algorithm for embedding Christmas trees into caterpillars with dilation 3 proving that the lower bound obtained in...
