Search results for 'Henk A. Dijkstra' (try it on Scholar)

21 found
Order:
  1.  37
    Joel Katzav, Henk A. Dijkstra & A. T. J. de Laat (2012). Assessing Climate Model Projections: State of the Art and Philosophical Reflections. Studies in History and Philosophy of Science Part B 43 (4):258-276.
    The present paper draws on climate science and the philosophy of science in order to evaluate climate-model-based approaches to assessing climate projections. We analyze the difficulties that arise in such assessment and outline criteria of adequacy for approaches to it. In addition, we offer a critical overview of the approaches used in the IPCC working group one fourth report, including the confidence building, Bayesian and likelihood approaches. Finally, we consider approaches that do not feature in the IPCC reports, including three (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  2.  10
    Pieter Dijkstra, Floris Bex, Henry Prakken & Kees Vey Mestdagdeh (2005). Towards a Multi-Agent System for Regulated Information Exchange in Crime Investigations. Artificial Intelligence and Law 13 (1):133-151.
    This paper outlines a multi-agent architecture for regulated information exchange of crime investigation data between police forces. Interactions between police officers about information exchange are analysed as negotiation dialogues with embedded persuasion dialogues. An architecture is then proposed consisting of two agents, a requesting agent and a responding agent, and a communication language and protocol with which these agents can interact to promote optimal information exchange while respecting the law. Finally, dialogue policies are defined for the individual agents, specifying their (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  3.  7
    Pieter Dijkstra, Floris Bex, Henry Prakken & Kees de Vey Mestdagh (2005). Towards a Multi-Agent System for Regulated Information Exchange in Crime Investigations. Artificial Intelligence and Law 13 (1):133-151.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  4.  2
    Geske Dijkstra (1995). [Book Review] Industrialization in Sandinista Nicaragua, Policy and Practice in a Mixed Economy. [REVIEW] Science and Society 59 (1):104-106.
    Direct download  
     
    Export citation  
     
    My bibliography  
  5.  2
    Jitse Dijkstra & Geoffrey Greatrex (2009). Patriarchs and Politics in Constantinople in the Reign of Anastasius (with a Reedition of O.Mon.Epiph. 59). Millennium 6 (1).
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  6.  8
    Jack A. Adams & Sanne Dijkstra (1966). Short-Term Memory for Motor Responses. Journal of Experimental Psychology 71 (2):314.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  7.  9
    Katinka Dijkstra, Michael P. Kaschak & Rolf A. Zwaan (2007). Body Posture Facilitates Retrieval of Autobiographical Memories. Cognition 102 (1):139-149.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  8.  5
    Koen A. Dijkstra, Joop van der Pligt & Gerben A. van Kleef (2014). Effects of Processing Style on Responsiveness to Affective Stimuli and Processing Fluency. Cognition and Emotion 28 (6):959-970.
  9.  18
    T. Mulder, J. Hochstenbach, P. Dijkstra & J. Geertzen (2008). Born to Adapt, but Not in Your Dreams. Consciousness and Cognition 17 (4):1266-1271.
    The brain adapts to changes that take place in the body. Deprivation of input results in size reduction of cortical representations, whereas an increase in input results in an increase of representational space. Amputation forms one of the most dramatic disturbances of the integrity of the body. The brain adapts in many ways to this breakdown of the afferent–efferent equilibrium. However, almost all studies focus on the sensorimotor consequences. It is not known whether adaptation takes place also at other “levels” (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  10.  9
    Jaime Bohórquez V. (2008). Intuitionistic Logic According to Dijkstra's Calculus of Equational Deduction. Notre Dame Journal of Formal Logic 49 (4):361-384.
    Dijkstra and Scholten have proposed a formalization of classical predicate logic on a novel deductive system as an alternative to Hilbert's style of proof and Gentzen's deductive systems. In this context we call it CED (Calculus of Equational Deduction). This deductive method promotes logical equivalence over implication and shows that there are easy ways to prove predicate formulas without the introduction of hypotheses or metamathematical tools such as the deduction theorem. Moreover, syntactic considerations (in Dijkstra's words, "letting the (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  11.  8
    Juan C. Agudelo & Walter Carnielli (2011). Polynomial Ring Calculus for Modal Logics: A New Semantics and Proof Method for Modalities. Review of Symbolic Logic 4 (1):150-170.
    A new (sound and complete) proof style adequate for modal logics is defined from the polynomial ring calculus (PRC). The new semantics not only expresses truth conditions of modal formulas by means of polynomials, but also permits to perform deductions through polynomial handling. This paper also investigates relationships among the PRC here defined, the algebraic semantics for modal logics, equational logics, the Dijkstra–Scholten equational-proof style, and rewriting systems. The method proposed is throughly exemplified for S5, and can be easily (...)
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography  
  12.  17
    Derek Partridge (1995). On the Difficulty of Really Considering a Radical Novelty. Minds and Machines 5 (3):391-410.
    The fundamental assumptions in Dijkstra''s influential article on computing science teaching are challenged. Dijkstra''s paper presents the radical novelties of computing, and the consequent problems that we must tackle through a formal, logic-based approach to program derivation. Dijkstra''s main premise is that the algorithmic programming paradigm is the only one, in fact, the only possible one. It is argued that there is at least one other, the network-programming paradigm, which itself is a radical novelty with respect to (...)
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  13.  0
    Jaime Bohórquez (2008). Intuitionistic Logic According to Dijkstra's Calculus of Equational Deduction. Notre Dame Journal of Formal Logic 49 (4):361-384.
    Dijkstra and Scholten have proposed a formalization of classical predicate logic on a novel deductive system as an alternative to Hilbert's style of proof and Gentzen's deductive systems. In this context we call it CED . This deductive method promotes logical equivalence over implication and shows that there are easy ways to prove predicate formulas without the introduction of hypotheses or metamathematical tools such as the deduction theorem. Moreover, syntactic considerations have led to the "calculational style," an impressive array (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  14. F. X. Alario, S. Allen, G. T. M. Altmann, P. Bach, C. Becchio, I. Blanchette, L. Boroditsky, A. Brown, R. Campbell & U. Cartwright-Finch (2007). Dehaene-Lambertz, G., 261 Dijkstra, K., 139 Dumay, N., 341. Cognition 102:486-487.
    Translate
     
     
    Export citation  
     
    My bibliography  
  15.  9
    P. Brugger (2008). The Phantom Limb in Dreams☆. Consciousness and Cognition 17 (4):1272-1278.
    Mulder and colleagues [Mulder, T., Hochstenbach, J., Dijkstra, P. U., Geertzen, J. H. B. . Born to adapt, but not in your dreams. Consciousness and Cognition, 17, 1266–1271.] report that a majority of amputees continue to experience a normally-limbed body during their night dreams. They interprete this observation as a failure of the body schema to adapt to the new body shape. The present note does not question this interpretation, but points to the already existing literature on the phenomenology (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  16.  3
    Robert Zaller (1987). Philip Guston and the Crisis of the Image. Critical Inquiry 14 (1):69.
    The twentieth century began with the deconstruction of the image, as it is ending with the effort to restore it. Cubism, dada, and abstract expressionism took apart what, in their various ways, pop art, magic realism, and neoexpressionism have tried to put back together. Tonality in music and narrative in literature have undergone similar change.1 What has been at stake in each case has been the redefinition of a center, a normative or ordering principle as such. Yeats intuited this general (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  17.  1
    Vladimir Lifschitz (2001). On Calculational Proofs. Annals of Pure and Applied Logic 113 (1-3):207-224.
    This note is about the “calculational style” of presenting proofs introduced by Dijkstra and Scholten and adopted in some books on theoretical computer science. We define the concept of a calculation, which is a formal counterpart of the idea of a calculational proof. The definition is in terms of a new formalization DS of predicate logic. Any proof tree in the system DS can be represented as a sequence of calculations. This fact shows that any logically valid predicate formula (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  18.  12
    Christopher Manning, Parsing and Hypergraphs.
    While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view of parsing as directed hypergraph analysis which naturally covers both symbolic and probabilistic parsing. We illustrate the approach by showing how a dynamic extension of Dijkstra’s algorithm can be used to construct a probabilistic chart parser with an Ç´Ò¿µ time bound for arbitrary PCFGs, while preserving as much of the flexibility of symbolic chart parsers as allowed by the (...)
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
  19.  9
    Kalpesh Kapoor, Kamal Lodaya & Uday S. Reddy (2011). Fine-Grained Concurrency with Separation Logic. Journal of Philosophical Logic 40 (5):583-632.
    Reasoning about concurrent programs involves representing the information that concurrent processes manipulate disjoint portions of memory. In sophisticated applications, the division of memory between processes is not static. Through operations, processes can exchange the implied ownership of memory cells. In addition, processes can also share ownership of cells in a controlled fashion as long as they perform operations that do not interfere, e.g., they can concurrently read shared cells. Thus the traditional paradigm of distributed computing based on locations is replaced (...)
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography  
  20.  6
    Dan Klein & Christopher D. Manning, Parsing and Hypergraphs.
    While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view of parsing as directed hypergraph analysis which naturally covers both symbolic and probabilistic parsing. We illustrate the approach by showing how a dynamic extension of Dijkstra’s algorithm can be used to construct a probabilistic chart parser with an Ç´Ò¿µ time bound for arbitrary PCFGs, while preserving as much of the flexibility of symbolic chart parsers as allowed by the (...)
    No categories
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  21.  1
    Max I. Kanovich (1996). Linear Logic Automata. Annals of Pure and Applied Logic 78 (1-3):147-188.
    A Linear Logic automaton is a hybrid of a finite automaton and a non-deterministic Petri net. LL automata commands are represented by propositional Horn Linear Logic formulas. Computations performed by LL automata directly correspond to cut-free derivations in Linear Logic.A programming language of LL automata is developed in which typical sequential, non-deterministic and parallel programming constructs are expressed in the natural way.All non-deterministic computations, e.g. computations performed by programs built up of guarded commands in the Dijkstra's approach to non-deterministic (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography