626 search results - page 74 / 126 » The Automatic Interpretation of Nominalizations |
ICLP
1999
Springer
13 years 12 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
TAPSOFT
1997
Springer
13 years 11 months ago
1997
Springer
The goal of this paper is to analyse semantics of algorithms with explicit continuous time with further aim to nd approaches to automatize model checking in high level, easily unde...
BIBM
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper investigates multi-topic aspects in automatic classification of clinical free text. In many practical situations, we need to deal with documents overlapping with multip...
CAV
2010
Springer
13 years 11 months ago
2010
Springer
We address the issue of automatic invariant synthesis for sequential programs manipulating singly-linked lists carrying data over infinite data doe define for that a framework ba...
EXPCS
2007
13 years 11 months ago
2007
Utility programs, which perform similar and largely independent operations on a sequence of inputs, include such common applications as compilers, interpreters, and document parse...