Sciweavers

2519 search results - page 421 / 504
» Reasoning with Textual Cases
Sort
View
ICFP
2005
ACM
16 years 6 months ago
Toward a general theory of names: binding and scope
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
James Cheney
WOLLIC
2009
Springer
16 years 1 months ago
Classic-Like Analytic Tableaux for Finite-Valued Logics
The paper provides a recipe for adequately representing a very inclusive class of finite-valued logics by way of tableaux. The only requisite for applying the method is that the o...
Carlos Caleiro, João Marcos
ATAL
2009
Springer
16 years 1 months ago
Incorporating helpful behavior into collaborative planning
This paper considers the design of agent strategies for deciding whether to help other members of a group with whom an agent is engaged in a collaborative activity. Three characte...
Ece Kamar, Ya'akov Gal, Barbara J. Grosz
ICRA
2008
IEEE
150views Robotics» more  ICRA 2008»
16 years 1 months ago
A Bayesian approach to empirical local linearization for robotics
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
Jo-Anne Ting, Aaron D'Souza, Sethu Vijayakumar, St...
LPNMR
2007
Springer
16 years 28 days ago
A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming
Logic programming under the answer-set semantics nowadays deals with numerous different notions of equivalence between programs. This is due to the fact that equivalence for substi...
Stefan Woltran