The Connection Graph Proof Procedure as a Logical-Connectionist Model of the Mind

Although BToM and AToM have demonstrated some success outside of the specific modeling contexts in which they were developed, neither has been applied to situations in which

En outre, ma tentative dans cette seconde partie du manuscrit est d’´etablir les ponts entre la construction de mod`eles pour les logiques modales et le domaine de r´e´ecriture

In order to clarify some of these differences we have, from the example in Figure 2, compiled three categories regarding the meaning of some operations (the semantics) and the

In this paper, we give a formal statement which expresses that a simple and local test performed on every node before its construction permits to avoid the construction of useless

2.3 Exploitation of the Graph Context to Reduce the Search Space If the number of nodes of a graph is reduced by a factor k, its graph context is reduced by a factor k 2 and the

Our agent model has shown that in competitive settings such as repeated rock-paper-scissors games, second-order theory of mind can benefit agents greatly [32], while human behaviour

A similar situation is found in the plurivaluationistic semantics for other vague predicates besides our example of tall: typically, the class of admissible fuzzy models P can

An extended abduc- tive logic program ET is made up of a triple hP, A, T P ICi, where P is a stan- dard logic program, A (Abducibles) is a set of predicate names and T P IC