229 search results - page 33 / 46 » Natural Language Proof Explanation |
AMAST
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. When designing an open system, there might be no implementation available for certain components at verification time. For such systems, verification has to be based on a...
ML
2007
ACM
13 years 10 months ago
2007
ACM
The problem of disjoint sets, also known as union-find, consists in maintaining a partition of a finite set within a data structure. This structure provides two operations: a fu...
JELIA
1990
Springer
14 years 2 months ago
1990
Springer
Traditional accounts of the semantic interpretation of quantified phrases and its interaction with reference and ellipsis have relied on formal manipulations of logical forms (qua...
GECCO
2007
Springer
14 years 5 months ago
2007
Springer
Automated event extraction remains a very difficult challenge requiring information analysts to manually identify key events of interest within massive, dynamic data. Many techniq...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...