References

  1. Felicidad Aguado, Pedro Cabalar, Martin Diéguez, Gilberto Pérez & Concepción Vidal (2013): Temporal\, equilibrium\, logic:\, a survey. Journal of Applied Non-Classical Logics 23(1–2), pp. 2–24, doi:10.1080/11663081.2013.798985.
  2. Harald Beck, Minh Dao-Tran & Thomas Eiter (2016): Equivalent Stream Reasoning Programs. In: Kambhampati, pp. 929–935.
  3. Bernhard Beckert & Joachim Posegga (1995): leanTAP: Lean Tableau-based Deduction. Journal of Automated Reasoning 15(3), pp. 339–358, doi:10.1007/BF00881804.
  4. Wolfgang Bibel (1987): Automated Theorem Proving. Artificial intelligence. F. Vieweg und Sohn, Wiesbaden, doi:10.1007/978-3-322-90102-6.
  5. Pedro Cabalar, Jorge Fandinno & Luis Fariñas del Cerro (2020): Autoepistemic Answer Set Programming. Artificial Intelligence 289, pp. 103382, doi:10.1016/j.artint.2020.103382.
  6. Pedro Cabalar, Roland Kaminski, Max Ostrowski & Torsten Schaub (2016): An ASP Semantics for Default Reasoning with Constraints. In: Kambhampati, pp. 1015–1021.
  7. Jorge Fandinno, Christoph Glinzer, Zachary Hansen, Jan Heuer, Yuliya Lierler, Vladimir Lifschitz, Torsten Schaub & Tobias Stolzmann (2025): Anthem 2.0: Automated Reasoning for Answer Set Programming. Available at https://arxiv.org/abs/2507.11704. (To appear in TPLP 2025).
  8. Jorge Fandinno, Vladimir Lifschitz, Patrick Lühne & Torsten Schaub (2020): Verifying Tight Logic Programs with anthem and Vampire. Theory and Practice of Logic Programming 20(5), pp. 735–750, doi:10.1017/S1471068420000344.
  9. Melvin Fitting (1983): Proof Methods for Modal and Intuitionistic Logics. D. Reidel, Dordrecht, doi:10.1007/978-94-017-2794-5.
  10. Michael Gelfond & Vladimir Lifschitz (1990): Logic Programs with Classical Negation. In: David Warren & Péter Szeredi: Proceedings of the Seventh International Conference on Logic Programming (ICLP'90). MIT Press, pp. 579–597.
  11. Gerhard Gentzen (1935): Untersuchungen über das Logische Schließen. Mathematische Zeit\-schrift 39, pp. 176–210, 405–431, doi:10.1007/BF01201353.
  12. Kurt Gödel (1932): Zum intuitionistischen Aussagenkalkül. Anzeiger der Akademie der Wissenschaften in Wien, pp. 65–66.
  13. Arend Heyting (1930): Die formalen Regeln der intuitionistischen Logik. In: Sitzungsberichte der Preussischen Akademie der Wissenschaften. Deutsche Akademie der Wissenschaften zu Berlin, pp. 42–56.
  14. Subbarao Kambhampati (2016): Proceedings of the Twenty-fifth International Joint Conference on Artificial Intelligence (IJCAI'16). IJCAI/AAAI Press.
  15. Vladimir Lifschitz (2019): Answer Set Programming. Springer, Cham, doi:10.1007/978-3-030-24658-7.
  16. Vladimir Lifschitz, David Pearce & Agustín Valverde (2001): Strongly equivalent logic programs. ACM Transactions on Computational Logic 2(4), pp. 526–541, doi:10.1145/383779.383783.
  17. Vladimir Lifschitz, David Pearce & Agustín Valverde (2007): A Characterization of Strong Equivalence for Logic Programs with Variables. In: Chitta Baral, Gerhard Brewka & John Schlipf: Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07), Lecture Notes in Artificial Intelligence 4483. Springer, Heidelberg, pp. 188–200, doi:10.1007/978-3-540-72200-7_17.
  18. Grigori Mints (2010): Cut-free formulations for a quantified logic of here and there. Ann. Pure Appl. Log. 162(3), pp. 237–242, doi:10.1016/J.APAL.2010.09.009.
  19. Jens Otten (1997): ilean\!T\!AP: An Intuitionistic Theorem Prover. In: Didier Galmiche: TABLEAUX 1997, Lecture Notes in Artificial Intelligence 1227. Springer, Heidelberg, pp. 307–312, doi:10.1007/BFb0027422.
  20. Jens Otten (2010): Restricting backtracking in connection calculi. AI Commun. 23(2–3), pp. 159–182, doi:10.3233/AIC-2010-0464.
  21. Jens Otten (2011): A Non-clausal Connection Calculus. In: Kai Brünnler & George Metcalfe: TABLEAUX 2011, Lecture Notes in Artificial Intelligence 6793. Springer, Heidelberg, pp. 226–241, doi:10.1007/978-3-642-22119-4_18.
  22. Jens Otten (2016): nanoCoP: A Non-clausal Connection Prover. In: Nicola Olivetti & Ashish Tiwari: IJCAR 2016, Lecture Notes in Artificial Intelligence 9706. Springer, Heidelberg, pp. 302–312, doi:10.1007/978-3-319-40229-1_21.
  23. Jens Otten (2017): Non-clausal Connection Calculi for Non-classical Logics. In: Renate Schmidt & Cláudia Nalon: TABLEAUX 2017, Lecture Notes in Artificial Intelligence 10501. Springer, Cham, pp. 209–227, doi:10.1007/978-3-319-66902-1_13.
  24. Jens Otten (2021): The nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal Logics. In: Anupam Das & Sara Negri: TABLEAUX 2021, Lecture Notes in Artificial Intelligence 12842. Springer, Cham, pp. 236–249, doi:10.1007/978-3-030-86059-2_14.
  25. Jens Otten & Wolfgang Bibel (2003): leanCoP: lean connection-based theorem proving. Journal of Symbolic Computation 36(1–2), pp. 139–161, doi:10.1016/S0747-7171(03)00037-3.
  26. Jens Otten & Wolfgang Bibel (2017): Advances in Connection-Based Automated Theorem Proving. In: Mike Hinchey, Jonathan P. Bowen & Ernst-Rüdiger Olderog: Provably Correct Systems, NASA Monographs in Systems and Software Engineering. Springer, Cham, pp. 211–241, doi:10.1007/978-3-319-48628-4_9.
  27. David Pearce (2006): Equilibrium logic. Annals of Mathematics and Artificial Intelligence 47(1–2), pp. 3–41, doi:10.1007/s10472-006-9028-z.
  28. David Pearce, Inmaculada de Guzmán & Augustín Valverde (2000): A Tableau Calculus for Equilibrium Entailment. In: Roy Dyckhoff: Proceedings of the Ninth International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2000), Lecture Notes in Computer Science 1847. Springer, Heidelberg, pp. 352–367, doi:10.1007/10722086_28.
  29. David Pearce & Augustín Valverde (2005): A First Order Nonmonotonic Extension of Constructive Logic. Studia Logica 30(2–3), pp. 321–346, doi:10.1007/s11225-005-8473-8.
  30. Francis Jeffry Pelletier (1986): Seventy-Five Problems for Testing Automatic Theorem Provers. Journal of Automated Reasoning 2(2), pp. 191–216, doi:10.1007/BF02432151.
  31. Thomas Raths, Jens Otten & Christoph Kreitz (2007): The ILTP problem library for intuitionistic logic. Journal of Automated Reasoning 38, pp. 261–271, doi:10.1007/s10817-006-9060-z.
  32. Raymond M. Smullyan (1968): First-Order Logic. Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer, Berlin, Heidelberg, New York, doi:10.1007/978-3-642-86718-7.
  33. Lincoln A. Wallen (1990): Automated Deduction in Nonclassical Logics. MIT Press, Cambridge, Mass..
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org