Sciweavers

2214 search results - page 192 / 443
» Complexity of Reasoning
Sort
View
127
Voted
CADE
2006
Springer
16 years 4 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...
122
Voted
SIGMOD
2003
ACM
88views Database» more  SIGMOD 2003»
16 years 3 months ago
Mapping Data in Peer-to-Peer Systems: Semantics and Algorithmic Issues
We consider the problem of mapping data in peer-topeer data-sharing systems. Such systems often rely on the use of mapping tables listing pairs of corresponding values to search f...
Anastasios Kementsietsidis, Marcelo Arenas, Ren&ea...
143
Voted
TIME
2009
IEEE
15 years 10 months ago
Model Checking CTL is Almost Always Inherently Sequential
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
142
Voted
ATAL
2009
Springer
15 years 10 months ago
Rational play and rational beliefs under uncertainty
Alternating-time temporal logic (atl) is one of the most influential logics for reasoning about agents’ abilities. Constructive Strategic Logic (csl) is a variant of atl for im...
Nils Bulling, Wojciech Jamroga
143
Voted
ATAL
2009
Springer
15 years 10 months ago
Pragmatic-strategic reputation-based decisions in BDI agents
Computational trust and reputation models have been recognized as one of the key technologies required to design and implement agent systems. These models manage and aggregate the...
Isaac Pinyol, Jordi Sabater-Mir