Sciweavers

1124 search results - page 161 / 225
» Mobile robot programming using natural language
Sort
View
ICFP
2012
ACM
11 years 10 months ago
Transporting functions across ornaments
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...
Pierre-Évariste Dagand, Conor McBride
ICLP
2004
Springer
14 years 1 months ago
Protein Folding Simulation in CCP
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...
Alessandro Dal Palù, Agostino Dovier, Feder...
CSL
2004
Springer
14 years 1 months ago
Set Constraints on Regular Terms
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...
Pawel Rychlikowski, Tomasz Truderung
BIRTHDAY
2003
Springer
14 years 27 days ago
From CTL to Datalog
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...
APAL
2006
112views more  APAL 2006»
13 years 7 months ago
On complexity of verification of interacting agents' behavior
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 ...