Results 251 to 260 of about 15,517 (291)
Some of the next articles are maybe not open access.
2008
Bratman argued that the purpose of intentions are to constrain the complexity of future decisions. However, the role of intentions in making future commitments is not well understood. In this paper, we propose a methodology to understand how an agent's commitment to its intentions relates to their dynamics.
Timothy William Cleaver +1 more
openaire +1 more source
Bratman argued that the purpose of intentions are to constrain the complexity of future decisions. However, the role of intentions in making future commitments is not well understood. In this paper, we propose a methodology to understand how an agent's commitment to its intentions relates to their dynamics.
Timothy William Cleaver +1 more
openaire +1 more source
Linguistics and Philosophy, 1989
Some aspects of the theory of generalized quantifiers related to linguistics are considered. Syntactically, generalized polyadic quantifiers appear in expressions \(Qx_ 1...x_ n\cdot \phi (x_ 1,...,x_ n)\); this is interpreted set-theoretically as \(\| \phi \| \in Q\).
openaire +3 more sources
Some aspects of the theory of generalized quantifiers related to linguistics are considered. Syntactically, generalized polyadic quantifiers appear in expressions \(Qx_ 1...x_ n\cdot \phi (x_ 1,...,x_ n)\); this is interpreted set-theoretically as \(\| \phi \| \in Q\).
openaire +3 more sources
2016
Various properties of functions denoted by anaphors and anaphoric determiners are studied in this paper. These properties indicate similarities conservativity, intersectivity and differences predicate invariance, anaphoric conservativity, anaphoric intersectivity between anaphoric functions and quantifiers and show that anaphors essentially extend the ...
openaire +1 more source
Various properties of functions denoted by anaphors and anaphoric determiners are studied in this paper. These properties indicate similarities conservativity, intersectivity and differences predicate invariance, anaphoric conservativity, anaphoric intersectivity between anaphoric functions and quantifiers and show that anaphors essentially extend the ...
openaire +1 more source
2004
The logic MSOL+\(\mathbb{B}\) is defined, by extending monadic second-order logic on the infinite binary tree with a new bounding quantifier\(\mathbb{B}\). In this logic, a formula \(\mathbb{B}\)X. φ(X) states that there is a finite bound on the size of sets satisfying φ(X).
openaire +1 more source
The logic MSOL+\(\mathbb{B}\) is defined, by extending monadic second-order logic on the infinite binary tree with a new bounding quantifier\(\mathbb{B}\). In this logic, a formula \(\mathbb{B}\)X. φ(X) states that there is a finite bound on the size of sets satisfying φ(X).
openaire +1 more source
Philosophical Studies, 2005
In the tradition of substructural logics, it has been claimed for a long time that conjunction and inclusive disjunction are ambiguous:we should, in fact, distinguish between ‘lattice’ connectives (also called additive or extensional) and ‘group’ connectives (also called multiplicative or intensional).
openaire +2 more sources
In the tradition of substructural logics, it has been claimed for a long time that conjunction and inclusive disjunction are ambiguous:we should, in fact, distinguish between ‘lattice’ connectives (also called additive or extensional) and ‘group’ connectives (also called multiplicative or intensional).
openaire +2 more sources
2015
Over the course of this decade, both mobile devices and mobile device applications designed for the express purpose of tracking physiological and cognitive performance metrics are nearly ubiquitous in our everyday endeavors. Though the idea of tracking our own various daily metrics is nothing new, the advent of technological innovations that carry the ...
openaire +1 more source
Over the course of this decade, both mobile devices and mobile device applications designed for the express purpose of tracking physiological and cognitive performance metrics are nearly ubiquitous in our everyday endeavors. Though the idea of tracking our own various daily metrics is nothing new, the advent of technological innovations that carry the ...
openaire +1 more source
2012
This paper studies how quantificational expressions such as few, three and all can be grounded in real-world perception. Based on findings from psycholinguistics, we propose a computational model designed for use in robot-robot interaction scenarios which involve discrimination tasks for objects in the real world.
Pauw, S., Spranger, M.
openaire +4 more sources
This paper studies how quantificational expressions such as few, three and all can be grounded in real-world perception. Based on findings from psycholinguistics, we propose a computational model designed for use in robot-robot interaction scenarios which involve discrimination tasks for objects in the real world.
Pauw, S., Spranger, M.
openaire +4 more sources
Interactions, 2006
"When you can measure what you are speaking about and express it in numbers, you know something about it. But when you cannot measure it, when you cannot express it in numbers, your knowledge is of an unsatisfactory kind: It may be the beginning of knowledge, but you have scarcely, in your thoughts, advanced to the stage of Science."
openaire +1 more source
"When you can measure what you are speaking about and express it in numbers, you know something about it. But when you cannot measure it, when you cannot express it in numbers, your knowledge is of an unsatisfactory kind: It may be the beginning of knowledge, but you have scarcely, in your thoughts, advanced to the stage of Science."
openaire +1 more source
2006
We describe a general way of building logics with Lindstrom quantifiers, which capture regular complexity classes on ordered structures with polysize reductions. We then extend this method so as to accommodate complexity classes based on oracle Turing machines.
Johann A. Makowsky, Y. B. Pnueli
openaire +2 more sources
We describe a general way of building logics with Lindstrom quantifiers, which capture regular complexity classes on ordered structures with polysize reductions. We then extend this method so as to accommodate complexity classes based on oracle Turing machines.
Johann A. Makowsky, Y. B. Pnueli
openaire +2 more sources
On Representations of Quantifiers
Journal of Semantics, 1994Cette etude psychometrique montre que la similarite semantique des quantificateurs en langage naturel est mieux presentee par un schema arborescent qu'un modele geometrique. Par ailleurs l'auteur suggere qu'au-dela d'une conception semantique globale, unidimentionnelle des quantificateurs (le montant ou la proportion), il existe d'autres constituants ...
openaire +2 more sources