Sciweavers

618 search results - page 58 / 124
» Computational Models of Natural Language Argument
Sort
View
CSL
2010
Springer
14 years 11 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
ACL
1992
14 years 11 months ago
GPSM: A Generalized Probabilistic Semantic Model for Ambiguity Resolution
In natural language processing, ambiguity resolution is a central issue, and can be regarded as a preference assignment problem. In this paper, a Generalized Probabilistic Semanti...
Jing-Shin Chang, Yih-Fen Luo, Keh-Yih Su
UAI
2004
14 years 11 months ago
Solving Factored MDPs with Continuous and Discrete Variables
Although many real-world stochastic planning problems are more naturally formulated by hybrid models with both discrete and continuous variables, current state-of-the-art methods ...
Carlos Guestrin, Milos Hauskrecht, Branislav Kveto...
VL
2002
IEEE
104views Visual Languages» more  VL 2002»
15 years 2 months ago
First Steps in Programming: A Rationale for Attention Investment Models
Research into the cognitive aspects of programming originated in the study of professional programmers (whether experts or students). Even “end-user” programmers in previous s...
Alan F. Blackwell
CORR
2002
Springer
93views Education» more  CORR 2002»
14 years 9 months ago
Modeling Complex Domains of Actions and Change
This paper studies the problem of modeling complex domains of actions and change within highlevel action description languages. We investigate two main issues of concern: (a) can ...
Antonis C. Kakas, Loizos Michael