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...
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Manta...
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. 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 ...
Bi-intuitionistic logic is the extension of intuitionistic logic with exclusion, a connective dual to implication. Cut-elimination in biintuitionistic logic is complicated due to t...
Team logic is a new logic, introduced by Väänänen [11], extending dependence logic by classical negation. Dependence logic adds to first-order logic atomic formulas expressing...
Abstract. This paper presents a new version of the CL contract specification language. CL combines deontic logic with propositional dynamic logic but it applies the modalities exc...
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...