439 search results - page 14 / 88 » Instantiation-Based Automated Reasoning: From Theory to Prac... |
108
click to vote
LICS
2012
IEEE
13 years 4 days ago
2012
IEEE
—We show how to reliably compute fast-growing functions with timed-arc Petri nets and data nets. This construction provides ordinal-recursive lower bounds on the complexity of th...
CADE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
131
click to vote
DALT
2010
Springer
14 years 4 months ago
2010
Springer
Social reasoning theories, whilst studied extensively in the area of multiagent systems, are hard to implement directly in agents. They often specify properties of beliefs or behav...
TARK
1998
Springer
15 years 1 months ago
1998
Springer
: Salmetintroduced a notion of hypothetical knowledge and showed how it could be used to capture the type of counterfactual reasoning necessary to force the backwards induction sol...
101
click to vote
JSW
2008
14 years 9 months ago
2008
Automated negotiation is an important applying field of agent theory and technology. For the current agent theoretical models have some troubles in explaining the agent's nego...