193 search results - page 13 / 39 » A Paraconsistent Higher Order Logic |
CADE
2009
Springer
14 years 8 months ago
2009
Springer
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of first-ord...
EMNLP
2010
13 years 5 months ago
2010
This paper addresses the problem of learning to map sentences to logical form, given training data consisting of natural language sentences paired with logical representations of ...
ITP
2010
13 years 11 months ago
2010
Nitpick is a counterexample generator for Isabelle/HOL that builds on Kodkod, a SAT-based first-order relational model finder. Nitpick supports unbounded quantification, (co)ind...
ASM
2010
ASM
14 years 22 days ago
2010
ASM
Traditionally, simulation is used to perform probabilistic analysis. However, it provides less accurate results and cannot handle large-scale problems due to the enormous CPU time ...
PLILP
1995
Springer
13 years 11 months ago
1995
Springer
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...