3738 search results - page 438 / 748 » Parametrized Logic Programming |
225
click to vote
PADL
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. Boyer and Moore's ACL2 theorem prover combines firstorder applicative Common Lisp with a computational, first-order logic. While ACL2 has become popular and is being...
111
Voted
FM
2009
Springer
15 years 10 months ago
2009
Springer
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
137
Voted
LOPSTR
2009
Springer
15 years 10 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
161
click to vote
EPIA
2003
Springer
15 years 8 months ago
2003
Springer
Modern information retrieval systems need the capability to reason about the knowledge conveyed by text bases. In this paper a methodology to automatically create ontologies and cl...
105
Voted
IFL
2001
Springer
15 years 7 months ago
2001
Springer
A programming language with subtyping can be translated into a language without subtyping by inserting conversion functions. Previous studies of this interpretation showed only the...