One of the central problems in building broad-coverage story understanding systems is generating expectations about event sequences, i.e. predicting what happens next given some a...
Automata on infinite words (ω-automata) have wide applications in formal language theory as well as in modeling and verifying reactive systems. Complementation of ωautomata is ...
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
Benjamin C. Pierce, Peter Sewell, Stephanie Weiric...
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...