Sciweavers

1650 search results - page 121 / 330
» The HOM problem is decidable
Sort
View
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 4 months ago
Nominal Unification from a Higher-Order Perspective
Abstract. Nominal Logic is an extension of first-order logic with equality, name-binding, name-swapping, and freshness of names. Contrarily to higher-order logic, bound variables a...
Jordi Levy, Mateu Villaret
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 4 months ago
The complexity of linear-time temporal logic over the class of ordinals
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
Stéphane Demri, Alexander Rabinovich
144
Voted
AUTOMATICA
2006
85views more  AUTOMATICA 2006»
15 years 4 months ago
Stability analysis of network-based cooperative resource allocation strategies
Resource allocation involves deciding how to divide a resource of limited availability among multiple demands in a way that optimizes current objectives. In this brief paper we fo...
Alvaro E. Gil, Kevin M. Passino
IJFCS
2008
102views more  IJFCS 2008»
15 years 4 months ago
On Stateless Automata and P Systems
We introduce the notion of stateless multihead two-way (respectively, oneway) NFAs and stateless multicounter systems and relate them to P systems and vector addition systems. In ...
Linmin Yang, Zhe Dang, Oscar H. Ibarra
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 4 months ago
Alternative axiomatics and complexity of deliberative STIT theories
We propose two alternatives to Xu’s axiomatization of Chellas’s STIT. The first one simplifies its presentation, and also provides an alternative axiomatization of the delib...
Philippe Balbiani, Andreas Herzig, Nicolas Troquar...