Abstract. This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics o...
Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
Jan Schwinghammer, Lars Birkedal, Bernhard Reus, H...
Abstract We introduce some differences in the style defeasible information is represented and inferences are made in nonmonotonic reasoning. These, at first sight harmless, chang...
Marcelino C. Pequeno, Rodrigo de M. S. Veras, Wlad...
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
Neil Immerman, Alexander Moshe Rabinovich, Thomas ...
In the logical approach to information retrieval (IR), retrieval is considered as uncertain inference. Whereas classical IR models are based on propositional logic, we combine Dat...