\begin{thebibliography}{10}

\bibitem{Boyd2021}
S.~Boyd and L.~Vandenberghe.
\newblock {\em {Convex Optimization}}.
\newblock Cambridge University Press, Cambridge, UK, 2021.

\bibitem{Buss1996}
S.R. Buss and P.~Clote.
\newblock {Cutting Planes, Connectivity, and Threshold Logic}.
\newblock {\em {Archive for Mathematic Logic}}, 35:33--62, 1996.

\bibitem{Chvatal1973}
V.~Chvatal.
\newblock {Edmonds Polytopes and a Hierarchy of Combinatorial Problems}.
\newblock {\em {Discrete Mathematics}}, 4:305--337, 1973.

\bibitem{Chvatal1985}
V.~Chvatal.
\newblock {Cutting Planes in Combinatorics}.
\newblock {\em {European Journal of Combinatorics}}, 6:217--226, 1985.

\bibitem{Cook1987}
W.~Cook, C.R. Coullard, and G.~Turan.
\newblock {On the Complexity of Cutting-Plane Proofs}.
\newblock {\em {Discrete Applied Mathematics}}, 18:25--38, 1987.

\bibitem{Devriendt2021}
J.~Devriendt, S.~Gocht, E.~Demirovic, J.~Nordstrom, and P.J. Stuckey.
\newblock {Cutting to the Core of Psuedo-Boolean Optimization: Combining
  Core-Guided Search with Cutting Planes Reasoning}.
\newblock In {\em Thirty-Fift AAAI Conference on Artificial Intelligence}.
  Elsevier, 2021.

\bibitem{Domingos2009}
P.~Domingos and D.~Lowd.
\newblock {\em {Markov Logic Networks}}.
\newblock Morgan and Claypool Publishers, Williston, VT, 2009.

\bibitem{Freund1985}
R.M. Freund and J.B. Orlin.
\newblock {On the Complexity of Four Polynomial Containment Problems}.
\newblock {\em {Mathematical Programming}}, 33:139--145, 1985.

\bibitem{Georgakopoulos1988}
G.~Georgakopoulos, D.~Kavvadias, and C.H. Papadimitriou.
\newblock {Probabilistic Satisfiability}.
\newblock {\em {Journal of Complexity}}, 4:1--11, 1988.

\bibitem{Georgeff1999}
M.~Georgeff, B.~Pell, M.~Pollack, M.~Tambe, and M.~Wooldridge.
\newblock {The Belief-Desire-Intention Model of Agency}.
\newblock In J{\"o}rg~P. M{\"u}ller, Anand~S. Rao, and Munindar~P. Singh,
  editors, {\em Intelligent Agents V: Agents Theories, Architectures, and
  Languages}, pages 1--10, Berlin, Heidelberg, 1999. Springer Berlin
  Heidelberg.

\bibitem{Gomory1958}
R.E. Gomory.
\newblock {Outline of an Algorithm for Integer Solution to Linear Programs}.
\newblock {\em {Bulletin of the Americal Mathematical Society}},
  64(5):275--278, 1958.

\bibitem{Henderson2020}
T.C. Henderson, R.~Simmons, B.~Serbinowski, M.~Cline, D.~Sacharny, X.~Fan, and
  A.~Mitiche.
\newblock {Probabilistic Sentence Satisfiability: An Approach to PSAT}.
\newblock {\em {Artificial Intelligence}}, 278:71--87, 2020.

\bibitem{Henderson2021}
Thomas~C. Henderson, Amar Mitiche, Xiuyi Fan, and David Sacharny.
\newblock {Some Explorations in SAT}.
\newblock Technical Report UUCS-21-016, University of Utah, July 2021.

\bibitem{Henderson2023a}
Thomas~C. Henderson, David Sacharny, Xiuyi Fan, Amar Mitiche, and Thatcher
  Geary.
\newblock {GEO-SAT: A Geometric Approach to Satisfiability}.
\newblock Technical Report UUCS-23-003, University of Utah, November 2023.

\bibitem{Henderson2023}
Thomas~C. Henderson, David Sacharny, Amar Mitiche, Xiuyi Fan, Amelia Lessen,
  Ishaan Rajan, and Tessa Nishida.
\newblock {Chop-SAT: A New Approach to Solving SAT and Probabilistic SAT for
  Agent Knowledge Bases}.
\newblock In {\em International Conference on Agents and Artificial
  Intelligence}, Lisbon, Spain, February 2023.

\bibitem{Moretti2003}
A.C. Moretti.
\newblock {A Weighted Projection Centering Method}.
\newblock {\em {Computational and Applied Mathematics}}, 22(1):19--36, 2003.

\bibitem{Nilsson1986}
N.~Nilsson.
\newblock {Probabilistic Logic}.
\newblock {\em Artificial Intelligence Journal}, 28:71--87, 1986.

\bibitem{Pearl1988}
J.~Pearl.
\newblock {\em {Probabilistic Reasoning in Intelligent Systems}}.
\newblock Morgan Kaufmann, San Mateo, CA, 1988.

\bibitem{Russell2010}
Stuart Russell and Peter Norvig.
\newblock {\em {Artificial Intelligence: A Modern Approach}}.
\newblock Prentice Hall Press, Upper Saddle River, NJ, 3rd edition, 2009.

\bibitem{Sacharny2021}
D.~Sacharny, Thomas~C. Henderson, Michael Cline, and Benjamin Russon.
\newblock {Reinforcement Learning at the Cognitive Level in a Belief, Desire,
  Intention UAS Agent}.
\newblock In {\em Intelligent Autonomous Systems Confernce}, Singapore, June
  2021.

\bibitem{Sipser2012}
M.~Sipser.
\newblock {\em {Introduction to the Theory of Computation}}.
\newblock Cengage Learning, Independence, KY, 2012.

\bibitem{Yob1975}
G.~Yob.
\newblock {Hunt the Wumpus?}
\newblock {\em {Creative Computing}}, September--October 1975.

\bibitem{Zhang2003}
Y.~Zhang.
\newblock {On Numerical Solution of the Maximum Volume Ellipsoid Problem}.
\newblock {\em {SIAM Journal on Optimization}}, 14(1), 2003.

\end{thebibliography}
