681 search results - page 80 / 137 » Parsing as Natural Deduction |
NDQA
2003
14 years 11 months ago
2003
We describe our approach in constructing question answering systems, which involves natural language parsing enhanced with named entity extraction and part-of-speech tagging. Perf...
APLAS
2005
ACM
15 years 3 months ago
2005
ACM
Many problems in program analysis can be expressed naturally and concisely in a declarative language like Datalog. This makes it easy to specify new analyses or extend or compose e...
DEXA
2004
Springer
15 years 3 months ago
2004
Springer
Reasoning in legal and social domains appears not to be well dealt with by deductive approaches. This is because such reasoning is open-endedly defeasible, and because the various ...
ESOP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We present a proof theoretical method for de-compiling lowlevel code to the typed lambda calculus. We first define a proof system for a low-level code language based on...
ISMVL
2000
IEEE
15 years 2 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...