Sciweavers

433 search results - page 52 / 87
» Description Logics in the Calculus of Structures
Sort
View
CADE
2007
Springer
15 years 10 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
14 years 11 months ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
FM
2003
Springer
146views Formal Methods» more  FM 2003»
15 years 3 months ago
Interacting State Machines for Mobility
We present two instantiations of generic Interactive State Machines (ISMs) with mobility features which are useful for modeling and verifying dynamically changing mobile systems. I...
Thomas A. Kuhn, David von Oheimb
IJVR
2008
137views more  IJVR 2008»
14 years 10 months ago
Reasoning about Action for Behavioral Animation of Intelligent Virtual Agents
Recent work in behavioral animation has taken impressive steps towards a virtual human. As for intelligent virtual agents, abbreviated "IVAs", the behaviors displayed in ...
Yisong Liu, Shan Zhong, Yongzhao Zhan
DIMACS
1996
14 years 11 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin