You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
139 lines
2.7 KiB
139 lines
2.7 KiB
% Template for Exams
|
|
%
|
|
\input{util/version}
|
|
\documentclass{article}
|
|
|
|
\input{util/packages}
|
|
\input{util/math_macros}
|
|
\input{util/styling_macros}
|
|
\input{util/constants}
|
|
\input{util/chapter}
|
|
\input{util/tcolorbox}
|
|
|
|
\pagestyle{fancy}
|
|
|
|
\fancyfoot[C]{}
|
|
\fancyfoot[R]{Page \thepage\ of \pageref{LastPage}}
|
|
\fancypagestyle{autoempty}{
|
|
\fancyhf{}
|
|
\fancyfoot[R]{Page \thepage\ of \pageref{LastPage}}
|
|
\renewcommand{\footrulewidth}{.4pt}
|
|
\renewcommand{\headrulewidth}{.4pt}
|
|
}
|
|
\renewcommand{\footrulewidth}{\headrulewidth}
|
|
%\renewcommand{\headrule}{\ifthenelse{\isodd{\thepage}}{\hrule}{}}
|
|
\makeatletter
|
|
\def\cleardoublepage{\clearpage\if@twoside \ifodd\c@page\else
|
|
\hbox{}
|
|
\thispagestyle{autoempty}
|
|
\newpage
|
|
\if@twocolumn\hbox{}\newpage\fi\fi\fi}
|
|
\makeatother
|
|
|
|
\newcounter{beforeCounter}
|
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
|
|
|
\begin{document}
|
|
|
|
\begin{titlepage}
|
|
\begin{center}
|
|
|
|
{\Large {\bf{Questionnaire ``Logic and Computability''}}}
|
|
|
|
\hspace{3cm}
|
|
|
|
|
|
{\Large {\bf{Summer Term 2023}}}
|
|
|
|
\tableofcontents
|
|
|
|
\end{center}
|
|
\end{titlepage}
|
|
|
|
\thispagestyle{empty}
|
|
|
|
\setcounter{page}{1}
|
|
|
|
\clearpage
|
|
|
|
|
|
|
|
\ifchapterproplogic
|
|
\setsectionnum{0}
|
|
\section{Propositional Logic}
|
|
\input{propositional_logic/propositional_logic.tex}
|
|
\pagebreak
|
|
\fi
|
|
|
|
\ifchaptersatsolver
|
|
\setsectionnum{1}
|
|
\section{SAT Solvers}
|
|
\input{sat_solvers_dpll/sat_solvers_dpll.tex}
|
|
\pagebreak
|
|
\fi
|
|
|
|
\ifchapterbdd
|
|
\setsectionnum{2}
|
|
\section{Binary Decision Diagrams}
|
|
\input{bdds/bdds.tex}
|
|
\pagebreak
|
|
\fi
|
|
|
|
\ifchapterndprop
|
|
\setsectionnum{3}
|
|
\section{Natural Deduction for Propositional Logic}
|
|
\input{natural_deduction_propositional_logic/natural_deduction_prop_logic.tex}
|
|
\pagebreak
|
|
\fi
|
|
|
|
\ifchaptereqchecking
|
|
\setsectionnum{4}
|
|
\section{Combinational Equivalence Checking}
|
|
\input{equivalence_checking/equivalence_checking.tex}
|
|
\pagebreak
|
|
\fi
|
|
\ifchaptersmtzthree
|
|
\setsectionnum{5}
|
|
\section{SMT Solvers and Z3}
|
|
\input{smt_and_z3/smt_and_z3.tex}
|
|
\pagebreak
|
|
\fi
|
|
|
|
\ifchapterpredlogic
|
|
\setsectionnum{6}
|
|
\section{Predicate Logic}
|
|
\input{predicate_logic/predicate_logic.tex}
|
|
\pagebreak
|
|
\fi
|
|
|
|
\ifchapterndpred
|
|
\setsectionnum{7}
|
|
\section{Natural Deduction for Predicate Logic}
|
|
\input{natural_deduction_predicate_logic/natural_deduction_predicate_logic.tex}
|
|
\pagebreak
|
|
\fi
|
|
\ifchaptersmt
|
|
\setsectionnum{8}
|
|
\section{Satisfiability Modulo Theories}
|
|
\input{smt/smt.tex}
|
|
\pagebreak
|
|
\fi
|
|
|
|
|
|
\ifchaptersymbenc
|
|
\setsectionnum{9}
|
|
\section{Symbolic Encoding}
|
|
\input{symbolic_encoding/symbolic_encoding.tex}
|
|
\pagebreak
|
|
\fi
|
|
|
|
\ifchaptertemporal
|
|
\setsectionnum{10}
|
|
\section{Temporal Logic}
|
|
\input{temporal_logic/temporal_logic.tex}
|
|
\pagebreak
|
|
\fi
|
|
%---------------------------------------------------------
|
|
|
|
|
|
\end{document}
|