Sciweavers

1220 search results - page 67 / 244
» Restricting grammatical complexity
Sort
View
129
Voted
LICS
2003
IEEE
15 years 8 months ago
New Directions in Instantiation-Based Theorem Proving
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
Harald Ganzinger, Konstantin Korovin
106
Voted
ATAL
2003
Springer
15 years 8 months ago
Expressive global protocols via logic-based electronic institutions
Communication is the key feature of Multi-agent Systems. The interactions among components of a system may take many distinct forms of increasing complexity such as in auctions, n...
Wamberto Weber Vasconcelos
124
Voted
AAAI
2008
15 years 5 months ago
Interaction Structure and Dimensionality Reduction in Decentralized MDPs
Decentralized Markov Decision Processes are a powerful general model of decentralized, cooperative multi-agent problem solving. The high complexity of the general problem leads to...
Martin Allen, Marek Petrik, Shlomo Zilberstein
IJCAI
2003
15 years 4 months ago
On the Undecidability of Description and Dynamic Logics with Recursion and Counting
The evolution of Description Logics (DLs) and Propositional Dynamic Logics produced a hierar­ chy of decidable logics with multiple maximal el­ ements. It would be desirable to ...
Piero A. Bonatti
107
Voted
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 2 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen