We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
Simona Colucci, Tommaso Di Noia, Eugenio Di Sciasc...
A definition of types in an information system is given from ld abstractions through data constructs, schema and definitions to physical data values. Category theory suggests tha...
We survey determinacy, definability, and complexity issues of Banach-Mazur games on finite and infinite graphs. Infinite games where two players take turns to move a token thro...
Background: High-density tiling arrays and new sequencing technologies are generating rapidly increasing volumes of transcriptome and protein-DNA interaction data. Visualization a...
J. Christopher Bare, Tie Koide, David J. Reiss, Da...
Abstract. Orc is a theory of orchestration of services that allows structured programming of distributed and timed computations. Several formal semantics have been proposed for Orc...