155 search results - page 15 / 31 » Harmonising natural deduction |
IWPT
2001
13 years 9 months ago
2001
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 ...
CSL
2006
Springer
13 years 11 months ago
2006
Springer
Based on natural deduction, Pure Type Systems (PTS) can express a wide range of type theories. In order to express proof-search in such theories, we introduce the Pure Type Sequent...
ICWSM
2008
13 years 9 months ago
2008
We explore the emerging phenomenon of blogging about personal goals, and demonstrate how natural language processing tools can be used to uncover psychologically meaningful constr...
LFCS
2007
Springer
14 years 2 months ago
2007
Springer
We introduce a natural deduction formulation for the Logic of Proofs, a refinement of modal logic S4 in which the assertion PA is replaced by [[s]]A whose intended reading is “s...
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Nominal logic is a variant of first-order logic equipped with a “freshname quantifier” N and other features useful for reasoning about languages with bound names. I...