Sciweavers

228 search results - page 17 / 46
» A Theory of Restrictions for Logics and Automata
Sort
View
APAL
1999
97views more  APAL 1999»
13 years 8 months ago
Coalgebraic Logic
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible one-step behaviors of the system. A fundamental question...
Lawrence S. Moss
RTA
2005
Springer
14 years 2 months ago
Intruder Deduction for AC-Like Equational Theories with Homomorphisms
Cryptographic protocols are small programs which involve a high level of concurrency and which are difficult to analyze by hand. The most successful methods to verify such protocol...
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
POPL
2010
ACM
14 years 6 months ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
AI
1998
Springer
13 years 8 months ago
The Logical Foundations of Goal-Regression Planning in Autonomous Agents
This paper addresses the logical foundations of goal-regression planning in autonomous rational agents. It focuses mainly on three problems. The first is that goals and subgoals w...
John L. Pollock
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 8 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