Premise Selection in the Naproche System

Cramer, Marcos; Koepke, Peter; Kühlwein, Daniel; Schröder, Bernhard

doi:10.1007/978-3-642-14203-1_37

Cited by 4 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have developed a prototypical Naproche system, which can automatically check texts written in the Naproche CNL for logical correctness [6]. We test this system by reformulating parts of mathematical textbooks and the basics of mathematical theories in the Naproche CNL and having the resulting texts automatically checked.…”

Section: The Naproche Systemmentioning

confidence: 99%

See 1 more Smart Citation

Parsing and Disambiguation of Symbolic Mathematics in the Naproche System

Cramer

Koepke

Schröder

2011

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. The Naproche system is a system for linguistically analysing and proof-checking mathematical texts written in a controlled natural language. The aim is to have an input language that is as close as possible to the language that mathematicians actually use when writing textbooks or papers. Mathematical texts consist of a combination of natural language and symbolic mathematics, with symbolic mathematics obeying its own syntactic rules. We discuss the difficulties that a program for parsing and disambiguating symbolic mathematics must face and present how these difficulties have been tackled in the Naproche system. One of these difficulties is the fact that information provided in the preceding contextincluding information provided in natural language -can influence the way a symbolic expression has to be disambiguated.

show abstract

Section: The Naproche Systemmentioning

confidence: 99%

“…So (3) and (4) are allowed, but (5), (6) and (7) (with z read as an infix, f as a prefix and g as a suffix function symbol) are not allowed.…”

Section: Defaultness Of the Syntactic Type Classicalmentioning

confidence: 99%