4513 search results - page 503 / 903 » Logic programming with satisfiability |
140
click to vote
ENTCS
2007
15 years 4 months ago
2007
There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementati...
250
Voted
PADL
2009
Springer
16 years 5 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...
127
click to vote
FM
2009
Springer
15 years 11 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...
153
click to vote
LOPSTR
2009
Springer
15 years 11 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...
176
click to vote
EPIA
2003
Springer
15 years 10 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...