95-53Klarlundetal.:AutomatedLogicalVerificationbasedonTraceAbstractions BRICSBasic Research in Computer Science Automated Logical Verification Trace Abstractions Nils Klarlund Moge...
The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of cou...
We propose to model human reasoning tasks using completed logic programs interpreted under the three-valued Lukasiewicz semantics. Given an appropriate immediate consequence operat...
A compositional Petri net based semantics is given to a simple pointer-manipulating language. The model is then applied to give a notion of validity to the judgements made by conc...
In earlier work [9], we defined CTL model-checking over finite-valued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois an...