Abstract. We present a domain-independent algorithm for planning that computes macros in a novel way. Our algorithm computes macros “on-the-fly” for a given set of states and ...
After briefly mentioning the historical background of PLL/SRL, we examine PRISM, a logic-based modeling language, as an instance of PLL/SRL research. We first look at the distrib...
A relation between two secrets, known in the literature as nondeducibility, was originally introduced by Sutherland. We extend it to a relation between sets of secrets that we call...
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...