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...
We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas...
Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter...
We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify pr...
Abstract. We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programmi...
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...