Sciweavers

5084 search results - page 198 / 1017
» Proving Possibility Properties
Sort
View
155
Voted
AAI
2007
66views more  AAI 2007»
15 years 6 months ago
Simulation and Analysis of Controlled Multi-Representational Reasoning Processes
Multi-representation reasoning processes often show a variety of reasoning paths that can be followed. To analyse such reasoning processes with special attention for differences b...
Tibor Bosse, Catholijn M. Jonker, Jan Treur
ENTCS
2008
82views more  ENTCS 2008»
15 years 6 months ago
A Static Analysis for Beta-Binders
We introduce a Control Flow Analysis, that statically approximates the dynamic behaviour of processes, expressed in the Beta-Binders calculus. Our analysis of a system is able to ...
Chiara Bodei
EOR
2007
109views more  EOR 2007»
15 years 6 months ago
Accessibility in oriented networks
The aim of this work is to present a numerical measure of the importance of each player in a cooperative game when the cooperation possibilities are limited according to the links...
Rafael Amer, José Miguel Giménez, An...
COGSCI
2004
82views more  COGSCI 2004»
15 years 6 months ago
Restricting grammatical complexity
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...
Robert Frank
STOC
2003
ACM
114views Algorithms» more  STOC 2003»
16 years 6 months ago
Testing subgraphs in directed graphs
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
Noga Alon, Asaf Shapira