Lógica computacional y teoría de modelos (2019-20) Lógica computacional y teoría de modelos (2019-20)

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% > Enunciado                                                               %%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% Un grafo dirigido G es un conjunto de nodos, representados mediante el
% predicado nodo, y un conjunto de arcos, representado mediante el
% predicado arco. Definir la relación conectados tal que conectados(X,Y)
% se verifica si existe un camino en G que conecta dichos nodos. Usar el
% predicado arco(X,Y) para representar un arco de X a Y, pero no
% necesariamente al revés.


%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% > Programa                                                                %%
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%