Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
Abstract. We present an encoding of a sequent calculus for a multiagent epistemic logic in Athena, an interactive theorem proving system for many-sorted first-order logic. We then ...
In this paper we study the nonchaotic and chaotic behavior of all 3D conservative quadratic ODE systems with five terms on the right-hand side and one nonlinear term (5-1 systems...
Abstract. In this paper we provide a simple proof of the extension theorem for partial orderings due to Suzumura [1983] when the domain of the partial order is finite. The extensio...
—BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time mo...