The Discrete Event Calculus Reasoner
Abstract
We describe the Discrete Event Calculus Reasoner, which uses satisfiability (SAT) to solve event calculus problems. The program can be used to perform automated deduction, abduction, postdiction, and model finding. We discuss the architecture of the program and the encoding of SAT problems. We present some simple examples of how the program is used and then present a more complicated example. We discuss the language used to describe commonsense reasoning problems to the program.
Keywords
Commonsense reasoning
Event calculus
Reasoning about action and change
Discrete event calculus
Discrete Event Calculus Reasoner
Satisfiability
Deduction
Abduction
Postdiction
Model finding
This chapter ...
Get Commonsense Reasoning, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
