Programming with dependent types is a blessing and a curse. It is a blessing to be able to bake invariants into the definition of datatypes: we can finally write correct-by-cons...
A protein is identified by a finite sequence of aminoacids, each of them chosen from a set of 20 elements. The Protein Structure Prediction Problem is the problem of predicting t...
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
We provide a translation from CTL to Datalog¬ Succ. The translation has the following advantages: a) It is natural. b) It provides intuition to the expressive power of CTL and it...
Foto N. Afrati, Theodore Andronikos, Vassia Pavlak...
This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to t...
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars ...