We consider the problem of extending temporal deductive databases with stratified negation. We argue that the classical stratification test for deductive databases is too restrictive when one shifts attention to the temporal case. Moreover, as we demonstrate, the (more general) local stratification approach is impractical: detecting whether a temporal deductive database is locally stratified is...

A computational model of spatial relational reasoning implemented in the ACT-R cognitive architecture allows for the simulation of a wide range of behavioral data in the context of both determinate and indeterminate deductive spatial reasoning tasks. In that respect the presented study bridges the gap between results of previous work that investigated determinacy conditions separately. ACT-R’s ...

[Jo93a] C. A. Johnson, Top down deduction in indefinite deductive databases, Keele University technical report (TR93-08).

This paper summarizes our experiences from an exercise in deductive verification of functional properties of automotive embedded Ccode in an industrial setting. We propose a formal requirements model that supports the way C-code requirements are currently written at Scania. We describe our work, for a safety-critical module of an embedded system, on formalizing its functional requirements and v...

T h e inf luence of s t imu lus modali ty and task dif f iculty on workload and perform a n c e was invest igated in the current s tudy. T h e goal ums t o quant i fy the "cost" (in t e r m s of response t i m e and ezperienced workload) incurred when essentially serial task componen t s shared c o m m o n e l emen t s (e.g., the response to one init iated the other) which could be accomplished...

The Set Cover problem has as input a set R of m items, a set C of n subsets of R and a weight function w : C → IR. The task is to choose a subset C ′ ⊆ C of minimum weight whose union contains all items of R. The sets R and C can be represented by an m × n binary matrix A that consists of a row for every item in R and a column for every subset of R in C, where an entry ai,j is 1 iff the ith ite...

Modular deductive verification provides a sound and powerful technique to establish that any call to a given function respects its given specification. However, relational properties, i.e. properties relating several function calls, are not supported. This short paper presents an original automated technique for specification and verification of such properties using the classic deductive verif...