Sciweavers

178 search results - page 29 / 36
» Dependability Arguments with Trusted Bases
Sort
View
ATAL
2010
Springer
13 years 8 months ago
CTL.STIT: enhancing ATL to express important multi-agent system verification properties
We present the logic CTL.STIT, which is the join of the logic CTL with a multi-agent strategic stit-logic variant. CTL.STIT subsumes ATL, and adds expressivity to it that we claim...
Jan Broersen
JCP
2006
106views more  JCP 2006»
13 years 7 months ago
On the Development of Knowledge Management Services for Collaborative Decision Making
Admitting that the quality of a decision depends on the quality of the knowledge used to make it, it is argued that the enhancement of the decision making efficiency and effectiven...
Christina E. Evangelou, Nikos I. Karacapilidis, Ma...
CORR
2010
Springer
102views Education» more  CORR 2010»
13 years 7 months ago
On Factor Universality in Symbolic Spaces
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on ...
Laurent Boyer, Guillaume Theyssier
MT
2010
134views more  MT 2010»
13 years 5 months ago
Improve syntax-based translation using deep syntactic structures
This paper introduces deep syntactic structures to syntax-based Statistical Machine Translation (SMT). We use a Head-driven Phrase Structure Grammar (HPSG) parser to obtain the de...
Xianchao Wu, Takuya Matsuzaki, Jun-ichi Tsujii
LICS
2010
IEEE
13 years 5 months ago
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Manuel Bodirsky, Martin Hils, Barnaby Martin