Event calculus answer set programming

Erik T. Mueller

Event calculus reasoning can be performed using answer set programming tools developed at the University of Potsdam (Gebser et al., 2013), based on a reformulation of the event calculus in answer set programming (Lee & Palla, 2012; Kim et al., 2009) and the DEC axioms (Mueller, 2004, 2015) for the event calculus (Miller & Shanahan, 2002; Shanahan, 1997; Kowalski & Sergot, 1986).

Instructions

1. Download and install clingo.
2. Download the discrete event calculus (DEC) axioms:
   • dec.lp
3. Download domain descriptions:
   • book.lp
   • rundrive.lp
   • circuit.lp (requires the CC axioms cc.lp)
4. Run domain descriptions:
   • clingo -c maxtime=1 -n 0 dec.lp rundrive.lp
   • clingo -c maxtime=4 -n 0 dec.lp book.lp
   • clingo -c maxtime=2 -n 0 dec.lp cc.lp circuit.lp

Related Resources

• 2023 (D'Asaro, Bikakis, Dickens, and Miller): EPEC - epistemic probabilistic event calculus
• 2022 (Arias, Carro, Chen, and Gupta): s(CASP) - answer set programming with constraints and event calculus support
• 2013 (Ma, Miller, Morgenstern, and Patkos): EFEC - epistemic functional event calculus
• 2009 (Lee and Palla): F2LP - first-order language converter for answer set programming
• 2009 (Kim): format-output - output formatter - converts answer set solver output into Discrete Event Calculus Reasoner output format
• 2008 (Kim, Lee, and Palla): ECASP - prototype tool for event calculus reasoning using answer set programming
• 2005 (Mueller): Discrete Event Calculus Reasoner - SAT-based event calculus reasoner

Bibliography

• Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2013). Answer set solving in practice. Morgan & Claypool. https://doi.org/10.1007/978-3-031-01561-8
• Kim, T.-W., Lee, J., & Palla, R. (2009). Circumscriptive event calculus as answer set programming. In Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009) (pp. 823–829).
• Kowalski, R. A., & Sergot, M. J. (1986). A logic-based calculus of events. New Generation Computing, 4(1), 67–95. https://doi.org/10.1007/bf03037383
• Lee, J., & Palla, R. (2012). Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming. Journal of Artificial Intelligence Research, 43, 571–620. https://doi.org/10.1613/jair.3489
• Miller, R., & Shanahan, M. (2002). Some alternative formulations of the event calculus. In A. C. Kakas and F. Sadri (Eds.), Computational logic: Logic programming and beyond: Essays in honour of Robert A. Kowalski, Part II (pp. 452–490). Springer. https://doi.org/10.1007/3-540-45632-5_17
• Mueller, E. T. (2004). Event calculus reasoning through satisfiability. Journal of Logic and Computation, 14(5), 703–730. https://doi.org/10.1093/logcom/14.5.703
• Mueller, E. T. (2015). Commonsense Reasoning: An Event Calculus Based Approach (2nd Ed.). Morgan Kaufmann. https://doi.org/10.1016/c2014-0-00192-x
• Shanahan, M. (1997). Solving the Frame Problem. MIT Press.