Sciweavers

218 search results - page 33 / 44
» Finite Trees as Ordinals
Sort
View
JAL
2002
86views more  JAL 2002»
14 years 9 months ago
Exploiting structure in quantified formulas
We study the computational problem "find the value of the quantified formula obtained by quantifying the variables in a sum of terms." The "sum" can be based o...
Richard Edwin Stearns, Harry B. Hunt III
TCS
2002
14 years 9 months ago
Monadic second-order logic on tree-like structures
An operation M which constructs from a given structure M a tree-like structure whose domain consists of the finite sequences of elements of M is considered. A notion of automata r...
Igor Walukiewicz
ASE
2005
137views more  ASE 2005»
14 years 9 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
AIIDE
2008
15 years 6 days ago
Dynamic Expansion of Behaviour Trees
Artificial intelligence in games is typically used for creating player's opponents. Manual edition of intelligent behaviors for Non-Player Characters (NPCs) of games is a cum...
Gonzalo Flórez Puga, Marco Antonio Gó...
ATAL
2007
Springer
15 years 4 months ago
Normative system games
We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic ...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...