A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...
— Synthesis of robot behaviors towards nontrivial goals often requires reasoning about both discrete and continuous aspects of the underlying domain. Existing approaches in build...
We provide a logical analysis of private international law, the body of law establishing when courts of a country should decide a case (jurisdiction) and what legal system they sho...
In this work, we develop a binding-time analysis for the logic programming language Mercury. We introduce a precise domain of binding-times, based on the type information available...
Abstract. Revision of a Description Logic-based ontology to incorporate newly received information consistently is an important problem for the lifecycle of ontologies. Many approa...