700 search results - page 37 / 140 » On Termination of Constraint Logic Programs |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
SOFSEM
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
CP
2005
Springer
15 years 1 months ago
2005
Springer
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
ETAI
2000
14 years 11 months ago
2000
Stochastic logic programs combine ideas from probabilistic grammars with the expressive power of definite clause logic; as such they can be considered as an extension of probabili...
102
click to vote
ISMB
1994
15 years 18 days ago
1994
Apilot program,CME,is describedfor generatinga physical genetic mapfromhybridization fingerprintingdata. CMEis implementedin the parallel constraint logic programming language Eli...