The paper focusses on the logical backgrounds of the Dijkstra-Scholten program development style for correct programs. For proving the correctness of a program (i.e. the fact that...
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...
Abstract. We consider the problem of computing the logical difference between distinct versions of description logic terminologies. For the lightweight description logic EL, we pre...