3973 search results - page 593 / 795 » Records for Logic Programming |
210
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing ...
137
click to vote
CADE
2008
Springer
16 years 4 months ago
2008
Springer
Interval-based methods are commonly used for computing numerical bounds on expressions and proving inequalities on real numbers. Yet they are hardly used in proof assistants, as th...
140
click to vote
CADE
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. Recently, it ...
130
click to vote
CADE
2004
Springer
16 years 4 months ago
2004
Springer
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
120
click to vote
ICFP
2003
ACM
16 years 4 months ago
2003
ACM
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...